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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717373764030

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:16:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:16:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:16:05] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-03 00:16:05] [INFO ] Transformed 602 places.
[2024-06-03 00:16:05] [INFO ] Transformed 944 transitions.
[2024-06-03 00:16:05] [INFO ] Found NUPN structural information;
[2024-06-03 00:16:05] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 133 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 115 place count 487 transition count 838
Iterating global reduction 1 with 106 rules applied. Total rules applied 221 place count 487 transition count 838
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 240 place count 468 transition count 814
Iterating global reduction 1 with 19 rules applied. Total rules applied 259 place count 468 transition count 814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 260 place count 468 transition count 813
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 262 place count 466 transition count 811
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 466 transition count 811
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 265 place count 465 transition count 810
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 465 transition count 810
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 267 place count 464 transition count 809
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 464 transition count 809
Applied a total of 268 rules in 130 ms. Remains 464 /602 variables (removed 138) and now considering 809/944 (removed 135) transitions.
// Phase 1: matrix 809 rows 464 cols
[2024-06-03 00:16:05] [INFO ] Computed 10 invariants in 26 ms
[2024-06-03 00:16:05] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-03 00:16:05] [INFO ] Invariant cache hit.
[2024-06-03 00:16:06] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-06-03 00:16:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 28 ms to minimize.
[2024-06-03 00:16:19] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:16:19] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:16:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:16:20] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:16:20] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:16:20] [INFO ] Deduced a trap composed of 99 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:16:20] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:16:21] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:16:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 5 ms to minimize.
[2024-06-03 00:16:22] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:16:22] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:16:23] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-06-03 00:16:28] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:16:32] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1273 variables, and 26 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-03 00:16:44] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:16:44] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-03 00:16:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-03 00:17:02] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/1273 variables, and 30 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 0/808 constraints, Known Traps: 20/20 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 464/602 places, 809/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61535 ms. Remains : 464/602 places, 809/944 transitions.
Support contains 133 out of 464 places after structural reductions.
[2024-06-03 00:17:07] [INFO ] Flatten gal took : 97 ms
[2024-06-03 00:17:07] [INFO ] Flatten gal took : 74 ms
[2024-06-03 00:17:07] [INFO ] Input system was already deterministic with 809 transitions.
Support contains 131 out of 464 places (down from 133) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 2162 ms. (18 steps per ms) remains 69/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
[2024-06-03 00:17:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 294/395 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 65 unsolved
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 2 ms to minimize.
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:17:10] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 4/13 constraints. Problems are: Problem set: 4 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 12/407 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 753/1160 variables, 407/421 constraints. Problems are: Problem set: 4 solved, 65 unsolved
[2024-06-03 00:17:11] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:17:12] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1160 variables, 2/423 constraints. Problems are: Problem set: 4 solved, 65 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1160/1273 variables, and 423 constraints, problems are : Problem set: 4 solved, 65 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 407/464 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 65 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 306/395 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 6/15 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-06-03 00:17:14] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 1/16 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 3 ms to minimize.
[2024-06-03 00:17:16] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 4/20 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 12/407 variables, 1/21 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-06-03 00:17:17] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 1/22 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 753/1160 variables, 407/429 constraints. Problems are: Problem set: 5 solved, 64 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1160/1273 variables, and 491 constraints, problems are : Problem set: 5 solved, 64 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 407/464 constraints, PredecessorRefiner: 62/69 constraints, Known Traps: 12/12 constraints]
After SMT, in 10103ms problems are : Problem set: 5 solved, 64 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 257 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 459 transition count 733
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 72 rules applied. Total rules applied 140 place count 392 transition count 728
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 152 place count 389 transition count 719
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 163 place count 380 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 379 transition count 717
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 164 place count 379 transition count 690
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 218 place count 352 transition count 690
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 227 place count 343 transition count 678
Iterating global reduction 5 with 9 rules applied. Total rules applied 236 place count 343 transition count 678
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 236 place count 343 transition count 677
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 342 transition count 677
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 316 place count 303 transition count 638
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 372 place count 275 transition count 746
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 377 place count 275 transition count 741
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 399 place count 275 transition count 719
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 421 place count 253 transition count 719
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 253 transition count 718
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 433 place count 253 transition count 718
Applied a total of 433 rules in 190 ms. Remains 253 /464 variables (removed 211) and now considering 718/809 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 253/464 places, 718/809 transitions.
RANDOM walk for 40000 steps (42 resets) in 578 ms. (69 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4002 steps (17 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (17 resets) in 28 ms. (137 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4002 steps (17 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4002 steps (16 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 52/55 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (17 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (17 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (13 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4002 steps (17 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (14 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (21 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (21 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
[2024-06-03 00:17:19] [INFO ] Flow matrix only has 698 transitions (discarded 20 similar events)
// Phase 1: matrix 698 rows 253 cols
[2024-06-03 00:17:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:17:19] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 174/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:19] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:17:20] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:17:20] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:20] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:21] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 4/244 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 696/940 variables, 244/259 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 15/274 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 10/950 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/950 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 1/951 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/951 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 0/951 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 951/951 variables, and 283 constraints, problems are : Problem set: 0 solved, 44 unsolved in 4513 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 174/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:24] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 696/940 variables, 244/260 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 15/275 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 43/318 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:26] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 10/950 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/950 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:29] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:17:29] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 16 (OVERLAPS) 1/951 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:17:33] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2024-06-03 00:17:33] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/951 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/951 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 19 (OVERLAPS) 0/951 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 951/951 variables, and 333 constraints, problems are : Problem set: 0 solved, 44 unsolved in 14753 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
After SMT, in 19325ms problems are : Problem set: 0 solved, 44 unsolved
Fused 44 Parikh solutions to 43 different solutions.
Parikh walk visited 6 properties in 12463 ms.
Support contains 59 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 718/718 transitions.
Graph (trivial) has 49 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 251 transition count 710
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 247 transition count 710
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 247 transition count 707
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 244 transition count 707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 242 transition count 705
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 242 transition count 705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 241 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 241 transition count 704
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 31 place count 236 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 236 transition count 697
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 232 transition count 723
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 232 transition count 721
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 51 place count 232 transition count 713
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 61 place count 224 transition count 711
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 224 transition count 711
Applied a total of 62 rules in 76 ms. Remains 224 /253 variables (removed 29) and now considering 711/718 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 224/253 places, 711/718 transitions.
RANDOM walk for 40000 steps (1267 resets) in 342 ms. (116 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (20 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (24 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
[2024-06-03 00:17:51] [INFO ] Flow matrix only has 686 transitions (discarded 25 similar events)
// Phase 1: matrix 686 rows 224 cols
[2024-06-03 00:17:51] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:17:51] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 159/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-03 00:17:51] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:17:52] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/217 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 686/903 variables, 217/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/903 variables, 15/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-03 00:17:53] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/903 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/903 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 7/910 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/910 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/910 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 910/910 variables, and 252 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 224/224 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 159/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/217 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 686/903 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/903 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/903 variables, 32/277 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-03 00:17:55] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/903 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-03 00:17:56] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/903 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 7/910 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/910 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/910 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 0/910 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 910/910 variables, and 287 constraints, problems are : Problem set: 0 solved, 33 unsolved in 6915 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 224/224 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 5/5 constraints]
After SMT, in 9623ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 4079 ms.
Support contains 54 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 711/711 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 222 transition count 714
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 222 transition count 713
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 222 transition count 709
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 20 place count 218 transition count 702
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 1 with 61 rules applied. Total rules applied 81 place count 218 transition count 641
Applied a total of 81 rules in 44 ms. Remains 218 /224 variables (removed 6) and now considering 641/711 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 218/224 places, 641/711 transitions.
RANDOM walk for 40000 steps (1190 resets) in 847 ms. (47 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4002 steps (19 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (19 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (24 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
[2024-06-03 00:18:05] [INFO ] Flow matrix only has 617 transitions (discarded 24 similar events)
// Phase 1: matrix 617 rows 218 cols
[2024-06-03 00:18:05] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:05] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 156/207 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 00:18:06] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:18:06] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 4/211 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 617/828 variables, 211/223 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 57/280 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 7/835 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/835 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 287 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 218/218 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 156/207 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 00:18:08] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 4/211 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 617/828 variables, 211/224 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 57/281 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 28/309 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 7/835 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-03 00:18:10] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/835 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/835 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 318 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5076 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 218/218 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 4/4 constraints]
After SMT, in 7061ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 4607 ms.
Support contains 51 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 641/641 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 218 transition count 640
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 640
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 216 transition count 639
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 216 transition count 637
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 214 transition count 634
Applied a total of 11 rules in 23 ms. Remains 214 /218 variables (removed 4) and now considering 634/641 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 214/218 places, 634/641 transitions.
RANDOM walk for 40000 steps (1218 resets) in 350 ms. (113 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (21 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (19 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (20 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (17 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 416042 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :16 out of 29
Probabilistic random walk after 416042 steps, saw 96365 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :16
[2024-06-03 00:18:20] [INFO ] Flow matrix only has 610 transitions (discarded 24 similar events)
// Phase 1: matrix 610 rows 214 cols
[2024-06-03 00:18:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:18:20] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 168/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-03 00:18:20] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 9/206 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 607/813 variables, 206/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 55/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 8/821 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/823 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/823 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/823 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/824 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/824 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/824 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 282 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 214/214 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 168/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 9/206 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-03 00:18:22] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 607/813 variables, 206/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 55/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/813 variables, 13/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/813 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 8/821 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-03 00:18:23] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/821 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 2/823 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/823 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/823 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 1/824 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/824 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/824 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 297 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 214/214 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 3833ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 6770 ms.
Support contains 29 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 634/634 transitions.
Graph (trivial) has 46 edges and 214 vertex of which 2 / 214 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 212 transition count 592
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 212 transition count 589
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 209 transition count 589
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 207 transition count 586
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 207 transition count 586
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 203 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 202 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 202 transition count 579
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 195 transition count 596
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 195 transition count 587
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 195 transition count 583
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 191 transition count 583
Applied a total of 54 rules in 38 ms. Remains 191 /214 variables (removed 23) and now considering 583/634 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 191/214 places, 583/634 transitions.
RANDOM walk for 40000 steps (1280 resets) in 311 ms. (128 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (259 resets) in 99 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (15 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (241 resets) in 93 ms. (425 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (233 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (248 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (226 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (253 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (239 resets) in 50 ms. (784 steps per ms) remains 8/9 properties
[2024-06-03 00:18:32] [INFO ] Flow matrix only has 559 transitions (discarded 24 similar events)
// Phase 1: matrix 559 rows 191 cols
[2024-06-03 00:18:32] [INFO ] Computed 10 invariants in 1 ms
[2024-06-03 00:18:32] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 152/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/185 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 559/744 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 83/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 6/750 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/750 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 750/750 variables, and 285 constraints, problems are : Problem set: 0 solved, 8 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 152/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/185 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 559/744 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 83/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 6/750 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/750 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 750/750 variables, and 293 constraints, problems are : Problem set: 0 solved, 8 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1540ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1861 ms.
Support contains 21 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 583/583 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 190 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 190 transition count 581
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 189 transition count 581
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 186 transition count 590
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 186 transition count 578
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 186 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 185 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 185 transition count 561
Applied a total of 40 rules in 33 ms. Remains 185 /191 variables (removed 6) and now considering 561/583 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 185/191 places, 561/583 transitions.
RANDOM walk for 40000 steps (1287 resets) in 915 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (235 resets) in 49 ms. (800 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (262 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (253 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (241 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (272 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
[2024-06-03 00:18:36] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
// Phase 1: matrix 538 rows 185 cols
[2024-06-03 00:18:36] [INFO ] Computed 10 invariants in 1 ms
[2024-06-03 00:18:36] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:18:36] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/179 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 538/717 variables, 179/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 84/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6/723 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/723 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/723 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 723/723 variables, and 280 constraints, problems are : Problem set: 0 solved, 7 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/179 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 538/717 variables, 179/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 84/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 7/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6/723 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/723 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/723 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 723/723 variables, and 287 constraints, problems are : Problem set: 0 solved, 7 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1425ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3313 ms.
Support contains 19 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 561/561 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 560
Applied a total of 2 rules in 14 ms. Remains 184 /185 variables (removed 1) and now considering 560/561 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 184/185 places, 560/561 transitions.
RANDOM walk for 40000 steps (1297 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (242 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (16 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (257 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (250 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (262 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (257 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 594901 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :4 out of 7
Probabilistic random walk after 594901 steps, saw 169639 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :4
[2024-06-03 00:18:44] [INFO ] Flow matrix only has 537 transitions (discarded 23 similar events)
// Phase 1: matrix 537 rows 184 cols
[2024-06-03 00:18:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:44] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/178 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:18:44] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 537/715 variables, 178/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 84/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/721 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/721 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/721 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 721/721 variables, and 279 constraints, problems are : Problem set: 0 solved, 3 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/178 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:18:44] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 537/715 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 84/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/721 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/721 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/721 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 721/721 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 438 ms.
Support contains 7 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 560/560 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 184 transition count 556
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 180 transition count 556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 179 transition count 514
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 179 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 177 transition count 512
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 173 transition count 516
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 67 place count 173 transition count 471
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 69 place count 173 transition count 469
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 78 place count 171 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 96 place count 171 transition count 444
Applied a total of 96 rules in 29 ms. Remains 171 /184 variables (removed 13) and now considering 444/560 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 171/184 places, 444/560 transitions.
RANDOM walk for 40000 steps (1504 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (312 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (304 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (325 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 617441 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 3
Probabilistic random walk after 617441 steps, saw 201620 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-06-03 00:18:48] [INFO ] Flow matrix only has 393 transitions (discarded 51 similar events)
// Phase 1: matrix 393 rows 171 cols
[2024-06-03 00:18:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:48] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/165 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 393/558 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/564 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/165 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:18:49] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:18:49] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 393/558 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 88/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:18:49] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/564 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 275 constraints, problems are : Problem set: 0 solved, 3 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 344 ms.
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 171/171 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-03 00:18:49] [INFO ] Flow matrix only has 393 transitions (discarded 51 similar events)
[2024-06-03 00:18:49] [INFO ] Invariant cache hit.
[2024-06-03 00:18:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-03 00:18:50] [INFO ] Flow matrix only has 393 transitions (discarded 51 similar events)
[2024-06-03 00:18:50] [INFO ] Invariant cache hit.
[2024-06-03 00:18:50] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-03 00:18:50] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-06-03 00:18:50] [INFO ] Redundant transitions in 43 ms returned [350, 353, 354]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 433 sub problems to find dead transitions.
[2024-06-03 00:18:50] [INFO ] Flow matrix only has 390 transitions (discarded 51 similar events)
// Phase 1: matrix 390 rows 171 cols
[2024-06-03 00:18:50] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:50] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-03 00:18:53] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:18:53] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-06-03 00:18:53] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-03 00:18:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:18:55] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:18:55] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:18:55] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-03 00:18:55] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-03 00:18:56] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:18:56] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 390/561 variables, 171/196 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 88/284 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 284 constraints, problems are : Problem set: 0 solved, 433 unsolved in 21176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 390/561 variables, 171/196 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 88/284 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 433/717 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 717 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
After SMT, in 51503ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 51507ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 171/171 places, 441/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52076 ms. Remains : 171/171 places, 441/444 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 52 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 35 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 809 transitions.
Computed a total of 72 stabilizing places and 78 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 437 transition count 748
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 437 transition count 748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 437 transition count 746
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 428 transition count 737
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 428 transition count 737
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 427 transition count 736
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 427 transition count 736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 426 transition count 735
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 426 transition count 735
Applied a total of 78 rules in 38 ms. Remains 426 /464 variables (removed 38) and now considering 735/809 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 426/464 places, 735/809 transitions.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 33 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 39 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 735 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 420 transition count 726
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 418 transition count 724
Applied a total of 95 rules in 18 ms. Remains 418 /464 variables (removed 46) and now considering 724/809 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 432 transition count 743
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 432 transition count 740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 423 transition count 729
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 27 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 727 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 420 transition count 726
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 418 transition count 724
Applied a total of 95 rules in 30 ms. Remains 418 /464 variables (removed 46) and now considering 724/809 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 771
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 422 transition count 757
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 755
Applied a total of 91 rules in 41 ms. Remains 420 /464 variables (removed 44) and now considering 755/809 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 420/464 places, 755/809 transitions.
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:42] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:19:42] [INFO ] Input system was already deterministic with 755 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 743
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 421 transition count 728
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 421 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 726
Applied a total of 93 rules in 43 ms. Remains 419 /464 variables (removed 45) and now considering 726/809 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 419/464 places, 726/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 726 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 354 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 448 transition count 704
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 360 transition count 696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 189 place count 356 transition count 696
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 189 place count 356 transition count 666
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 249 place count 326 transition count 666
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 270 place count 305 transition count 583
Iterating global reduction 3 with 21 rules applied. Total rules applied 291 place count 305 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 296 place count 305 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 298 place count 303 transition count 578
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 298 place count 303 transition count 568
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 318 place count 293 transition count 568
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 320 place count 291 transition count 564
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 291 transition count 564
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 382 place count 261 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 384 place count 260 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 260 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 259 transition count 532
Applied a total of 386 rules in 93 ms. Remains 259 /464 variables (removed 205) and now considering 532/809 (removed 277) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 259/464 places, 532/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 532 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 437 transition count 777
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 437 transition count 777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 437 transition count 775
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 427 transition count 763
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 427 transition count 763
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 426 transition count 762
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 426 transition count 762
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 425 transition count 761
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 425 transition count 761
Applied a total of 80 rules in 17 ms. Remains 425 /464 variables (removed 39) and now considering 761/809 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 425/464 places, 761/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 761 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 432 transition count 743
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 432 transition count 740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 423 transition count 729
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 18 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 727 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 354 edges and 464 vertex of which 15 / 464 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 451 transition count 710
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 365 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 180 place count 363 transition count 705
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 180 place count 363 transition count 673
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 244 place count 331 transition count 673
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 266 place count 309 transition count 617
Iterating global reduction 3 with 22 rules applied. Total rules applied 288 place count 309 transition count 617
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 292 place count 309 transition count 613
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 294 place count 307 transition count 613
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 294 place count 307 transition count 603
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 314 place count 297 transition count 603
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 316 place count 295 transition count 599
Iterating global reduction 5 with 2 rules applied. Total rules applied 318 place count 295 transition count 599
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 380 place count 264 transition count 568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 263 transition count 538
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 263 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 383 place count 263 transition count 537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 385 place count 262 transition count 536
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 387 place count 262 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 261 transition count 535
Applied a total of 388 rules in 57 ms. Remains 261 /464 variables (removed 203) and now considering 535/809 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 261/464 places, 535/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 535 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 363 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 448 transition count 705
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 94 rules applied. Total rules applied 182 place count 361 transition count 698
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 187 place count 357 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 356 transition count 697
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 188 place count 356 transition count 666
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 250 place count 325 transition count 666
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 272 place count 303 transition count 581
Iterating global reduction 4 with 22 rules applied. Total rules applied 294 place count 303 transition count 581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 299 place count 303 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 301 transition count 576
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 301 place count 301 transition count 566
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 321 place count 291 transition count 566
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 289 transition count 562
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 289 transition count 562
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 385 place count 259 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 387 place count 258 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 257 transition count 530
Applied a total of 388 rules in 51 ms. Remains 257 /464 variables (removed 207) and now considering 530/809 (removed 279) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 530 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 742
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 739
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 423 transition count 729
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 423 transition count 729
Applied a total of 85 rules in 11 ms. Remains 423 /464 variables (removed 41) and now considering 729/809 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 423/464 places, 729/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 421 transition count 727
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Applied a total of 93 rules in 18 ms. Remains 419 /464 variables (removed 45) and now considering 725/809 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 419/464 places, 725/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 725 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 742
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 739
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 422 transition count 728
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 422 transition count 728
Applied a total of 87 rules in 11 ms. Remains 422 /464 variables (removed 42) and now considering 728/809 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 422/464 places, 728/809 transitions.
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:19:43] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:19:43] [INFO ] Input system was already deterministic with 728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 361 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 448 transition count 706
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 179 place count 362 transition count 700
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 359 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 184 place count 358 transition count 699
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 184 place count 358 transition count 666
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 250 place count 325 transition count 666
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 272 place count 303 transition count 581
Iterating global reduction 4 with 22 rules applied. Total rules applied 294 place count 303 transition count 581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 299 place count 303 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 301 transition count 576
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 301 place count 301 transition count 566
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 321 place count 291 transition count 566
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 289 transition count 562
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 289 transition count 562
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 385 place count 259 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 387 place count 258 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 257 transition count 530
Applied a total of 388 rules in 45 ms. Remains 257 /464 variables (removed 207) and now considering 530/809 (removed 279) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:19:44] [INFO ] Input system was already deterministic with 530 transitions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 433 transition count 744
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 433 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 433 transition count 741
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 423 transition count 729
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 32 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:19:44] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:44] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:19:44] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-03 00:19:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 464 places, 809 transitions and 2478 arcs took 5 ms.
Total runtime 219106 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 464
TRANSITIONS: 809
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 870
MODEL NAME: /home/mcc/execution/411/model
464 places, 809 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-19-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="FireWire-PT-19"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-19, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898300314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;