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

--------------------
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 1717357685170

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:48:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:48:06] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 19:48:06] [INFO ] Transformed 602 places.
[2024-06-02 19:48:06] [INFO ] Transformed 944 transitions.
[2024-06-02 19:48:06] [INFO ] Found NUPN structural information;
[2024-06-02 19:48:06] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 202 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-02 19:48:06] [INFO ] Computed 10 invariants in 14 ms
[2024-06-02 19:48:07] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-02 19:48:07] [INFO ] Invariant cache hit.
[2024-06-02 19:48:07] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-06-02 19:48:07] [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-02 19:48:18] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 30 ms to minimize.
[2024-06-02 19:48:20] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:48:20] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:48:20] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:48:21] [INFO ] Deduced a trap composed of 94 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:48:21] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:48:21] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:48:21] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 3 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:48:23] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:48:23] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:48:24] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 4 ms to minimize.
[2024-06-02 19:48:28] [INFO ] Deduced a trap composed of 78 places in 54 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-02 19:48:31] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:48:32] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 808 unsolved
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 30032 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-02 19:48:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:48:45] [INFO ] Deduced a trap composed of 80 places in 52 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-02 19:48:52] [INFO ] Deduced a trap composed of 30 places in 44 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-02 19:49:02] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30016 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 60544ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in LTL mode, iteration 1 : 464/602 places, 809/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61490 ms. Remains : 464/602 places, 809/944 transitions.
Support contains 133 out of 464 places after structural reductions.
[2024-06-02 19:49:08] [INFO ] Flatten gal took : 97 ms
[2024-06-02 19:49:08] [INFO ] Flatten gal took : 44 ms
[2024-06-02 19:49:08] [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 (16 resets) in 2203 ms. (18 steps per ms) remains 71/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
[2024-06-02 19:49:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 291/396 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 67 unsolved
[2024-06-02 19:49:10] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 6 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 3 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 5/14 constraints. Problems are: Problem set: 4 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 12/408 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 67 unsolved
[2024-06-02 19:49:12] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 67 unsolved
[2024-06-02 19:49:12] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 1/17 constraints. Problems are: Problem set: 4 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 755/1163 variables, 408/425 constraints. Problems are: Problem set: 4 solved, 67 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1273 variables, and 425 constraints, problems are : Problem set: 4 solved, 67 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 408/464 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 4 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 67 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 303/396 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 7/16 constraints. Problems are: Problem set: 5 solved, 66 unsolved
[2024-06-02 19:49:15] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:49:15] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:49:15] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 3/19 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 12/408 variables, 1/20 constraints. Problems are: Problem set: 5 solved, 66 unsolved
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:49:17] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 2/22 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 755/1163 variables, 408/430 constraints. Problems are: Problem set: 5 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1163 variables, 63/493 constraints. Problems are: Problem set: 5 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1273 variables, and 493 constraints, problems are : Problem set: 5 solved, 66 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 408/464 constraints, PredecessorRefiner: 63/71 constraints, Known Traps: 12/12 constraints]
After SMT, in 10068ms problems are : Problem set: 5 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 251 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 3 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 459 transition count 737
Reduce places removed 63 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 68 rules applied. Total rules applied 132 place count 396 transition count 732
Reduce places removed 3 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 13 rules applied. Total rules applied 145 place count 393 transition count 722
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 155 place count 383 transition count 722
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 155 place count 383 transition count 694
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 211 place count 355 transition count 694
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 220 place count 346 transition count 682
Iterating global reduction 4 with 9 rules applied. Total rules applied 229 place count 346 transition count 682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 229 place count 346 transition count 681
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 345 transition count 681
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 4 with 78 rules applied. Total rules applied 309 place count 306 transition count 642
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 4 with 56 rules applied. Total rules applied 365 place count 278 transition count 750
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 370 place count 278 transition count 745
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 392 place count 278 transition count 723
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 414 place count 256 transition count 723
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 256 transition count 722
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 424 place count 256 transition count 722
Applied a total of 424 rules in 170 ms. Remains 256 /464 variables (removed 208) and now considering 722/809 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 256/464 places, 722/809 transitions.
RANDOM walk for 40000 steps (28 resets) in 519 ms. (76 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 63/66 properties
BEST_FIRST walk for 4003 steps (18 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (14 resets) in 32 ms. (121 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4000 steps (11 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (17 resets) in 15 ms. (250 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (13 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 51/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (11 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4002 steps (13 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4001 steps (14 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (16 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (16 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
[2024-06-02 19:49:20] [INFO ] Flow matrix only has 702 transitions (discarded 20 similar events)
// Phase 1: matrix 702 rows 256 cols
[2024-06-02 19:49:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:49:20] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 174/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 4/245 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 698/943 variables, 245/258 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 15/273 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 13/956 variables, 9/282 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/956 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 2/958 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/958 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/958 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 958/958 variables, and 284 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3904 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/256 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 174/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 19:49:24] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:49:25] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 1 ms to minimize.
[2024-06-02 19:49:25] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:49:25] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2024-06-02 19:49:25] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 4/245 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 19:49:26] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:49:26] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 698/943 variables, 245/265 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 15/280 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/943 variables, 45/325 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 19:49:27] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:49:28] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/943 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/943 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 13/956 variables, 9/336 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/956 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/956 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (OVERLAPS) 2/958 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/958 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 18 (OVERLAPS) 0/958 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 958/958 variables, and 339 constraints, problems are : Problem set: 0 solved, 46 unsolved in 13507 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/256 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 12/12 constraints]
After SMT, in 17462ms problems are : Problem set: 0 solved, 46 unsolved
Fused 46 Parikh solutions to 45 different solutions.
Parikh walk visited 1 properties in 14014 ms.
Support contains 64 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 722/722 transitions.
Graph (trivial) has 47 edges and 256 vertex of which 4 / 256 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 254 transition count 715
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 251 transition count 714
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 250 transition count 713
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 250 transition count 711
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 248 transition count 711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 247 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 247 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 246 transition count 709
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 246 transition count 709
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 3 with 10 rules applied. Total rules applied 28 place count 241 transition count 704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 241 transition count 702
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 36 place count 238 transition count 724
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 238 transition count 722
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 46 place count 238 transition count 714
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 62 place count 230 transition count 706
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 105 place count 230 transition count 663
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 230 transition count 663
Applied a total of 106 rules in 98 ms. Remains 230 /256 variables (removed 26) and now considering 663/722 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 230/256 places, 663/722 transitions.
RANDOM walk for 40000 steps (1154 resets) in 378 ms. (105 steps per ms) remains 34/45 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 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 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (23 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (23 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4001 steps (21 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
[2024-06-02 19:49:52] [INFO ] Flow matrix only has 645 transitions (discarded 18 similar events)
// Phase 1: matrix 645 rows 230 cols
[2024-06-02 19:49:52] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:49:52] [INFO ] State equation strengthened by 59 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, 32 unsolved
At refinement iteration 1 (OVERLAPS) 165/219 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 19:49:52] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:49:52] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:49:52] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:49:53] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 4/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 645/868 variables, 223/237 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/868 variables, 59/296 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/868 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 7/875 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/875 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/875 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 303 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 165/219 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 4/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 645/868 variables, 223/237 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/868 variables, 59/296 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/868 variables, 31/327 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:49:56] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:49:56] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:49:56] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 7/875 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/875 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/875 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/875 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 875/875 variables, and 340 constraints, problems are : Problem set: 0 solved, 32 unsolved in 6374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 9/9 constraints]
After SMT, in 8585ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 3575 ms.
Support contains 54 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 663/663 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 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 661
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 228 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 228 transition count 659
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 226 transition count 659
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 2 with 4 rules applied. Total rules applied 12 place count 224 transition count 657
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 224 transition count 656
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 222 transition count 664
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 33 place count 222 transition count 648
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 222 transition count 645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 39 place count 219 transition count 645
Applied a total of 39 rules in 51 ms. Remains 219 /230 variables (removed 11) and now considering 645/663 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 219/230 places, 645/663 transitions.
RANDOM walk for 40000 steps (1226 resets) in 610 ms. (65 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (21 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (15 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 393401 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :16 out of 31
Probabilistic random walk after 393401 steps, saw 91434 distinct states, run finished after 3004 ms. (steps per millisecond=130 ) properties seen :16
[2024-06-02 19:50:08] [INFO ] Flow matrix only has 621 transitions (discarded 24 similar events)
// Phase 1: matrix 621 rows 219 cols
[2024-06-02 19:50:08] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:50:08] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 171/202 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:50:08] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:50:08] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 9/211 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:50:08] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 618/829 variables, 211/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 55/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 8/837 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/837 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 2/839 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 1/840 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/840 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/840 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 289 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 219/219 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 171/202 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 9/211 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 618/829 variables, 211/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 55/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/829 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 8/837 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 2/839 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/839 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 1/840 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/840 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 0/840 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 306 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3087 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 219/219 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints]
After SMT, in 4816ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 5134 ms.
Support contains 31 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 645/645 transitions.
Graph (trivial) has 48 edges and 219 vertex of which 2 / 219 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 41 transitions
Reduce isomorphic transitions removed 43 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 218 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 217 transition count 601
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 217 transition count 599
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 215 transition count 599
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 213 transition count 596
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 213 transition count 596
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 21 place count 208 transition count 591
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 208 transition count 590
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 207 transition count 587
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 207 transition count 587
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 199 transition count 607
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 199 transition count 595
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 199 transition count 591
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 63 place count 195 transition count 588
Applied a total of 63 rules in 45 ms. Remains 195 /219 variables (removed 24) and now considering 588/645 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 195/219 places, 588/645 transitions.
RANDOM walk for 40000 steps (1335 resets) in 220 ms. (180 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40003 steps (256 resets) in 40 ms. (975 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (24 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (257 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (255 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (241 resets) in 70 ms. (563 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (247 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (262 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (254 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
[2024-06-02 19:50:18] [INFO ] Flow matrix only has 560 transitions (discarded 28 similar events)
// Phase 1: matrix 560 rows 195 cols
[2024-06-02 19:50:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:50:18] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 155/181 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 8/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 560/749 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 83/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 6/755 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/755 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/755 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 291 constraints, problems are : Problem set: 0 solved, 11 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 155/181 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 8/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:50:19] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:50:19] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 560/749 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 83/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 11/298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 6/755 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:50:20] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:50:20] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/755 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/755 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/755 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 7/7 constraints]
After SMT, in 2946ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 4414 ms.
Support contains 26 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 588/588 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 195 transition count 587
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 194 transition count 587
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 194 transition count 585
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 192 transition count 585
Applied a total of 6 rules in 18 ms. Remains 192 /195 variables (removed 3) and now considering 585/588 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 192/195 places, 585/588 transitions.
RANDOM walk for 40000 steps (1308 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (247 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (11 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 59 ms. (666 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (264 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (243 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (254 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (266 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (262 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 448611 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :5 out of 10
Probabilistic random walk after 448611 steps, saw 123170 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :5
[2024-06-02 19:50:29] [INFO ] Flow matrix only has 557 transitions (discarded 28 similar events)
// Phase 1: matrix 557 rows 192 cols
[2024-06-02 19:50:29] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 19:50:29] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 152/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/186 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 557/743 variables, 186/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 83/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/749 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/749 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 290 constraints, problems are : Problem set: 0 solved, 5 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 152/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/186 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 557/743 variables, 186/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 83/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 5/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/749 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/749 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/749 variables, and 295 constraints, problems are : Problem set: 0 solved, 5 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1672ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1778 ms.
Support contains 12 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 585/585 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 192 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 191 transition count 584
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 191 transition count 580
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 10 place count 187 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 185 transition count 578
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 180 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 180 transition count 580
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 180 transition count 577
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 44 place count 177 transition count 569
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 77 place count 177 transition count 536
Applied a total of 77 rules in 38 ms. Remains 177 /192 variables (removed 15) and now considering 536/585 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 177/192 places, 536/585 transitions.
RANDOM walk for 40000 steps (1363 resets) in 1662 ms. (24 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (270 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (270 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (13 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (275 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 422061 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 5
Probabilistic random walk after 422061 steps, saw 134813 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-02 19:50:36] [INFO ] Flow matrix only has 473 transitions (discarded 63 similar events)
// Phase 1: matrix 473 rows 177 cols
[2024-06-02 19:50:36] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:50:36] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/153 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/171 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 473/644 variables, 171/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 89/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/650 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/650 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 280 constraints, problems are : Problem set: 0 solved, 5 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/153 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/171 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:37] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 473/644 variables, 171/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 89/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/644 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/650 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/650 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/650 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 286 constraints, problems are : Problem set: 0 solved, 5 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1453 ms.
Support contains 12 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 536/536 transitions.
Applied a total of 0 rules in 16 ms. Remains 177 /177 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 177/177 places, 536/536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 536/536 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-06-02 19:50:39] [INFO ] Flow matrix only has 473 transitions (discarded 63 similar events)
[2024-06-02 19:50:39] [INFO ] Invariant cache hit.
[2024-06-02 19:50:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 19:50:39] [INFO ] Flow matrix only has 473 transitions (discarded 63 similar events)
[2024-06-02 19:50:39] [INFO ] Invariant cache hit.
[2024-06-02 19:50:39] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 19:50:40] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-06-02 19:50:40] [INFO ] Redundant transitions in 28 ms returned []
Running 528 sub problems to find dead transitions.
[2024-06-02 19:50:40] [INFO ] Flow matrix only has 473 transitions (discarded 63 similar events)
[2024-06-02 19:50:40] [INFO ] Invariant cache hit.
[2024-06-02 19:50:40] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 19:50:43] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:50:44] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:50:44] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:50:44] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:50:44] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:50:45] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:50:45] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:50:45] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:50:45] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 19:50:47] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (OVERLAPS) 473/650 variables, 177/197 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 89/286 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 19:50:58] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:50:59] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 9 (OVERLAPS) 0/650 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 528 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 288 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 528 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 473/650 variables, 177/199 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 89/288 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 528/816 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 19:51:26] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 817 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 13/13 constraints]
After SMT, in 60628ms problems are : Problem set: 0 solved, 528 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61248 ms. Remains : 177/177 places, 536/536 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 19:51:40] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:51:41] [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 37 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 37 ms. Remains : 426/464 places, 735/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:51:41] [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 35 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 35 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:51:41] [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 38 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 38 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:51:41] [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 20 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 21 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:41] [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 20 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 20 ms. Remains : 420/464 places, 755/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:51:41] [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 29 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 30 ms. Remains : 419/464 places, 726/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:41] [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 0 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 98 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 98 ms. Remains : 259/464 places, 532/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:51:41] [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 37 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 37 ms. Remains : 425/464 places, 761/809 transitions.
[2024-06-02 19:51:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:51:42] [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 37 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 38 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:51:42] [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 0 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 0 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 67 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 68 ms. Remains : 261/464 places, 535/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:51:42] [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 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 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 1 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 1 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 1 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 52 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 53 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:51:42] [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 16 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 16 ms. Remains : 423/464 places, 729/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:51:42] [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 29 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 30 ms. Remains : 419/464 places, 725/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:42] [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 15 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 15 ms. Remains : 422/464 places, 728/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:42] [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 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 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 0 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 1 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 50 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 50 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:51:42] [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 23 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 24 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:42] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:51:42] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 19:51:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 464 places, 809 transitions and 2478 arcs took 4 ms.
Total runtime 216672 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-14
Could not compute solution for formula : FireWire-PT-19-CTLFireability-2024-15

BK_STOP 1717357903458

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ctl formula name FireWire-PT-19-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/850/ctl_0_
ctl formula name FireWire-PT-19-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/850/ctl_1_
ctl formula name FireWire-PT-19-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/850/ctl_2_
ctl formula name FireWire-PT-19-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/850/ctl_3_
ctl formula name FireWire-PT-19-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/850/ctl_4_
ctl formula name FireWire-PT-19-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/850/ctl_5_
ctl formula name FireWire-PT-19-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/850/ctl_6_
ctl formula name FireWire-PT-19-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/850/ctl_7_
ctl formula name FireWire-PT-19-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/850/ctl_8_
ctl formula name FireWire-PT-19-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/850/ctl_9_
ctl formula name FireWire-PT-19-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/850/ctl_10_
ctl formula name FireWire-PT-19-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/850/ctl_11_
ctl formula name FireWire-PT-19-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/850/ctl_12_
ctl formula name FireWire-PT-19-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/850/ctl_13_
ctl formula name FireWire-PT-19-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/850/ctl_14_
ctl formula name FireWire-PT-19-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/850/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r553-tall-171734901400314"
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 ;