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.r492-smll-171636266300170.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 EisenbergMcGuire-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 753K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717223717927

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:35:21] [INFO ] Load time of PNML (sax parser for PT used): 482 ms
[2024-06-01 06:35:21] [INFO ] Transformed 414 places.
[2024-06-01 06:35:21] [INFO ] Transformed 1296 transitions.
[2024-06-01 06:35:21] [INFO ] Found NUPN structural information;
[2024-06-01 06:35:21] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 755 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 104 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 398 transition count 1200
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 398 transition count 1200
Applied a total of 32 rules in 178 ms. Remains 398 /414 variables (removed 16) and now considering 1200/1296 (removed 96) transitions.
[2024-06-01 06:35:21] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
// Phase 1: matrix 606 rows 398 cols
[2024-06-01 06:35:21] [INFO ] Computed 19 invariants in 44 ms
[2024-06-01 06:35:22] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-06-01 06:35:22] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-06-01 06:35:22] [INFO ] Invariant cache hit.
[2024-06-01 06:35:23] [INFO ] State equation strengthened by 234 read => feed constraints.
[2024-06-01 06:35:24] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2517 ms to find 0 implicit places.
Running 1194 sub problems to find dead transitions.
[2024-06-01 06:35:24] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-06-01 06:35:24] [INFO ] Invariant cache hit.
[2024-06-01 06:35:24] [INFO ] State equation strengthened by 234 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 46 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 6 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 6 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 105 places in 354 ms of which 5 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 61 places in 289 ms of which 5 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 54 places in 404 ms of which 6 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 91 places in 317 ms of which 4 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 112 places in 357 ms of which 7 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 99 places in 423 ms of which 5 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 95 places in 418 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 61 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 78 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 73 places in 453 ms of which 6 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 78 places in 453 ms of which 6 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 45 places in 445 ms of which 6 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 89 places in 405 ms of which 5 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 82 places in 394 ms of which 5 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 71 places in 340 ms of which 5 ms to minimize.
SMT process timed out in 31332ms, After SMT, problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 31410ms
Starting structural reductions in LTL mode, iteration 1 : 398/414 places, 1200/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34186 ms. Remains : 398/414 places, 1200/1296 transitions.
Support contains 104 out of 398 places after structural reductions.
[2024-06-01 06:35:56] [INFO ] Flatten gal took : 267 ms
[2024-06-01 06:35:56] [INFO ] Flatten gal took : 166 ms
[2024-06-01 06:35:57] [INFO ] Input system was already deterministic with 1200 transitions.
Support contains 103 out of 398 places (down from 104) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4592 ms. (8 steps per ms) remains 61/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
[2024-06-01 06:35:58] [INFO ] Flow matrix only has 606 transitions (discarded 594 similar events)
[2024-06-01 06:35:58] [INFO ] Invariant cache hit.
[2024-06-01 06:35:58] [INFO ] State equation strengthened by 234 read => feed constraints.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp56 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 2 (OVERLAPS) 318/398 variables, 12/13 constraints. Problems are: Problem set: 3 solved, 58 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 6/19 constraints. Problems are: Problem set: 4 solved, 57 unsolved
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 32 places in 313 ms of which 6 ms to minimize.
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 5 ms to minimize.
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 5 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 4 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-06-01 06:36:04] [INFO ] Deduced a trap composed of 93 places in 460 ms of which 6 ms to minimize.
SMT process timed out in 5215ms, After SMT, problems are : Problem set: 4 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 398 transition count 1196
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 394 transition count 1196
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 8 place count 394 transition count 1093
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 214 place count 291 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 285 transition count 1057
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 285 transition count 1057
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 284 place count 256 transition count 1028
Applied a total of 284 rules in 259 ms. Remains 256 /398 variables (removed 142) and now considering 1028/1200 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 256/398 places, 1028/1200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1389 ms. (28 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
Interrupted probabilistic random walk after 111097 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :20 out of 55
Probabilistic random walk after 111097 steps, saw 53091 distinct states, run finished after 3007 ms. (steps per millisecond=36 ) properties seen :20
[2024-06-01 06:36:08] [INFO ] Flow matrix only has 434 transitions (discarded 594 similar events)
// Phase 1: matrix 434 rows 256 cols
[2024-06-01 06:36:08] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:36:08] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 201/254 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 5 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 64 places in 352 ms of which 5 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 7 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 77 places in 346 ms of which 5 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 4 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 63 places in 332 ms of which 4 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 4 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 3 ms to minimize.
[2024-06-01 06:36:14] [INFO ] Deduced a trap composed of 92 places in 311 ms of which 4 ms to minimize.
[2024-06-01 06:36:14] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:36:14] [INFO ] Deduced a trap composed of 87 places in 289 ms of which 5 ms to minimize.
[2024-06-01 06:36:15] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:36:15] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 4 ms to minimize.
[2024-06-01 06:36:15] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 3 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 3 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:36:17] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:36:17] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:36:17] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:17] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:36:18] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 5 ms to minimize.
[2024-06-01 06:36:18] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 4 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 79 places in 311 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:22] [INFO ] Deduced a trap composed of 40 places in 366 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 2/256 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 53 places in 320 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 434/690 variables, 256/319 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/690 variables, 204/523 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/690 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/690 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/690 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/690 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (OVERLAPS) 0/690 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 525 constraints, problems are : Problem set: 0 solved, 35 unsolved in 22991 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 256/256 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 201/254 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:32] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 4 ms to minimize.
[2024-06-01 06:36:32] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:36:32] [INFO ] Deduced a trap composed of 56 places in 341 ms of which 4 ms to minimize.
[2024-06-01 06:36:33] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:36:33] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:36:34] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 78 places in 329 ms of which 5 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 55 places in 322 ms of which 5 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 4 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 35 places in 321 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 64 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 4 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 77 places in 331 ms of which 4 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 49 places in 321 ms of which 4 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 53 places in 319 ms of which 4 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 4 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 4 ms to minimize.
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 87 places in 321 ms of which 4 ms to minimize.
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 82 places in 309 ms of which 5 ms to minimize.
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:36:42] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 3 ms to minimize.
[2024-06-01 06:36:42] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 2/256 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 4 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 5 ms to minimize.
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:45] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 7 ms to minimize.
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:36:47] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 3 ms to minimize.
[2024-06-01 06:36:47] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 434/690 variables, 256/359 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/690 variables, 204/563 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/690 variables, 35/598 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 4 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 59 places in 336 ms of which 4 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 58 places in 312 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/690 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/690 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 0/690 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 605 constraints, problems are : Problem set: 0 solved, 35 unsolved in 28191 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 256/256 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 91/91 constraints]
After SMT, in 51267ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 1 properties in 6566 ms.
Support contains 52 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 1028/1028 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 256 transition count 1018
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 246 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 242 transition count 994
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 242 transition count 994
Applied a total of 28 rules in 69 ms. Remains 242 /256 variables (removed 14) and now considering 994/1028 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 242/256 places, 994/1028 transitions.
RANDOM walk for 40000 steps (8 resets) in 677 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 156296 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :1 out of 34
Probabilistic random walk after 156296 steps, saw 63989 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :1
[2024-06-01 06:37:09] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-06-01 06:37:09] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:37:09] [INFO ] State equation strengthened by 184 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 189/240 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:10] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:37:10] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:37:10] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 62 places in 324 ms of which 5 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 4 ms to minimize.
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:37:13] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:37:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:37:13] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 61 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 60 places in 336 ms of which 5 ms to minimize.
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:37:16] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:16] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 400/642 variables, 242/284 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 184/468 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/642 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:18] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/642 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/642 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/642 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 469 constraints, problems are : Problem set: 0 solved, 33 unsolved in 11372 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 242/242 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 189/240 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:21] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 4 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 81 places in 305 ms of which 4 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 4 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 66 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 65 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 54 places in 334 ms of which 4 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 61 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 3 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 50 places in 272 ms of which 5 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 71 places in 287 ms of which 5 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:28] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:29] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 2/242 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 5 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 70 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 4 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:37:33] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:33] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 77 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 400/642 variables, 242/318 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/642 variables, 184/502 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/642 variables, 33/535 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/642 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/642 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:37:40] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:37:40] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:37:41] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/642 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:43] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/642 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/642 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 4 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 4 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 49 places in 342 ms of which 4 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 4 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/642 variables, 6/550 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 4 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/642 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 06:37:54] [INFO ] Deduced a trap composed of 58 places in 305 ms of which 4 ms to minimize.
[2024-06-01 06:37:54] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:37:55] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:37:55] [INFO ] Deduced a trap composed of 86 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:37:55] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/642 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/642 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 26 (OVERLAPS) 0/642 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 559 constraints, problems are : Problem set: 0 solved, 33 unsolved in 40117 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 242/242 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 81/81 constraints]
After SMT, in 51572ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 1 properties in 6121 ms.
Support contains 50 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 994/994 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 242 transition count 992
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 992
Applied a total of 4 rules in 52 ms. Remains 240 /242 variables (removed 2) and now considering 992/994 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 240/242 places, 992/994 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:38:07] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 06:38:07] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:38:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:38:07] [INFO ] Flatten gal took : 63 ms
[2024-06-01 06:38:07] [INFO ] Input system was already deterministic with 1200 transitions.
Support contains 88 out of 398 places (down from 95) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 26 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-06-01 06:38:07] [INFO ] Flatten gal took : 43 ms
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 53 ms
[2024-06-01 06:38:08] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 28 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 44 ms
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 48 ms
[2024-06-01 06:38:08] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 1116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 1116
Applied a total of 28 rules in 22 ms. Remains 384 /398 variables (removed 14) and now considering 1116/1200 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 384/398 places, 1116/1200 transitions.
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 41 ms
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 46 ms
[2024-06-01 06:38:08] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 1122
Applied a total of 26 rules in 17 ms. Remains 385 /398 variables (removed 13) and now considering 1122/1200 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 385/398 places, 1122/1200 transitions.
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 41 ms
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 46 ms
[2024-06-01 06:38:08] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 386 transition count 1128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 386 transition count 1128
Applied a total of 24 rules in 17 ms. Remains 386 /398 variables (removed 12) and now considering 1128/1200 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 386/398 places, 1128/1200 transitions.
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 36 ms
[2024-06-01 06:38:08] [INFO ] Flatten gal took : 39 ms
[2024-06-01 06:38:09] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
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 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 119 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-06-01 06:38:09] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:38:09] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:38:09] [INFO ] Input system was already deterministic with 966 transitions.
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667933 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667933 steps, saw 164325 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-06-01 06:38:12] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 06:38:12] [INFO ] Computed 19 invariants in 12 ms
[2024-06-01 06:38:12] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 121/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1135ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 75 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 8452 steps (0 resets) in 249 ms. (33 steps per ms) remains 0/3 properties
RANDOM walk for 4000000 steps (8 resets) in 13510 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2693 ms. (1484 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2467038 steps, run timeout after 12001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 2467038 steps, saw 488599 distinct states, run finished after 12001 ms. (steps per millisecond=205 ) properties seen :0
[2024-06-01 06:38:30] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:38:30] [INFO ] Invariant cache hit.
[2024-06-01 06:38:30] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:38:30] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/606 variables, 120/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 121/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1244ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 51 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 42 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 06:38:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:38:31] [INFO ] Invariant cache hit.
[2024-06-01 06:38:31] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 06:38:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:38:31] [INFO ] Invariant cache hit.
[2024-06-01 06:38:32] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:38:33] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2024-06-01 06:38:33] [INFO ] Redundant transitions in 106 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 06:38:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:38:33] [INFO ] Invariant cache hit.
[2024-06-01 06:38:33] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 4 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:38:49] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:38:49] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:38:49] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 6 ms to minimize.
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 4 ms to minimize.
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 4 ms to minimize.
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 5 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 6 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:38:56] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 58 places in 273 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 54 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:39:11] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:39:11] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 4 ms to minimize.
[2024-06-01 06:39:11] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:39:12] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 3 ms to minimize.
[2024-06-01 06:39:12] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:39:12] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:39:12] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:39:13] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:39:13] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 3 ms to minimize.
[2024-06-01 06:39:13] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:39:18] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 4 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 4 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 53 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:39:27] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60725ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62814 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 15240 steps (0 resets) in 76 ms. (197 steps per ms) remains 0/3 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 6 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 79 transition count 134
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 74 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 289 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 295 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 326 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 357 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 363 place count 43 transition count 92
Applied a total of 363 rules in 65 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 92 rows 43 cols
[2024-06-01 06:39:34] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 06:39:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 06:39:34] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:39:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 06:39:34] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:39:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 06:39:34] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
TRAPS : Iteration 1
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 2
[2024-06-01 06:39:34] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:39:34] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 467 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 253 place count 265 transition count 1002
Iterating global reduction 2 with 13 rules applied. Total rules applied 266 place count 265 transition count 1002
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 2 with 60 rules applied. Total rules applied 326 place count 235 transition count 972
Applied a total of 326 rules in 123 ms. Remains 235 /398 variables (removed 163) and now considering 972/1200 (removed 228) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 235/398 places, 972/1200 transitions.
[2024-06-01 06:39:34] [INFO ] Flatten gal took : 47 ms
[2024-06-01 06:39:34] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:39:35] [INFO ] Input system was already deterministic with 972 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 12 place count 392 transition count 1083
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 234 place count 281 transition count 1083
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 270 transition count 1017
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 270 transition count 1017
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 2 with 60 rules applied. Total rules applied 316 place count 240 transition count 987
Applied a total of 316 rules in 120 ms. Remains 240 /398 variables (removed 158) and now considering 987/1200 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 240/398 places, 987/1200 transitions.
[2024-06-01 06:39:35] [INFO ] Flatten gal took : 46 ms
[2024-06-01 06:39:35] [INFO ] Flatten gal took : 51 ms
[2024-06-01 06:39:35] [INFO ] Input system was already deterministic with 987 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
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 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 64 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-06-01 06:39:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:39:35] [INFO ] Flatten gal took : 32 ms
[2024-06-01 06:39:35] [INFO ] Input system was already deterministic with 966 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 655242 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 655242 steps, saw 162074 distinct states, run finished after 3006 ms. (steps per millisecond=217 ) properties seen :0
[2024-06-01 06:39:38] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 06:39:38] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 06:39:38] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/606 variables, 120/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 121/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 3 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 121/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 39 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 400000 steps (8 resets) in 1523 ms. (262 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 06:39:40] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:39:40] [INFO ] Invariant cache hit.
[2024-06-01 06:39:40] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 06:39:40] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 06:39:40] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 06:39:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:39:40] [INFO ] After 39ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:39:40] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:39:40] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:39:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 06:39:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 06:39:40] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:39:40] [INFO ] After 35ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
TRAPS : Iteration 1
[2024-06-01 06:39:41] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:39:41] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 11687 ms. (342 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2705 ms. (1478 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2045575 steps, run timeout after 9001 ms. (steps per millisecond=227 ) properties seen :0 out of 1
Probabilistic random walk after 2045575 steps, saw 420356 distinct states, run finished after 9001 ms. (steps per millisecond=227 ) properties seen :0
[2024-06-01 06:39:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:39:53] [INFO ] Invariant cache hit.
[2024-06-01 06:39:53] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/606 variables, 120/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 121/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/430 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/438 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:54] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:39:54] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:39:54] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:39:55] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:55] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 121/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:39:55] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 36 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 36 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 06:39:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:39:55] [INFO ] Invariant cache hit.
[2024-06-01 06:39:56] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 06:39:56] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:39:56] [INFO ] Invariant cache hit.
[2024-06-01 06:39:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2024-06-01 06:39:57] [INFO ] Redundant transitions in 18 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:40:08] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:40:08] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:40:16] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:40:19] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:40:20] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:40:20] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:40:20] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:40:37] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:40:46] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:40:46] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:40:49] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 3 ms to minimize.
[2024-06-01 06:40:49] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:40:49] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 3 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62818 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 400000 steps (8 resets) in 1435 ms. (278 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 06:40:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:40:59] [INFO ] Invariant cache hit.
[2024-06-01 06:40:59] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 06:40:59] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 06:40:59] [INFO ] After 238ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 06:40:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:40:59] [INFO ] After 53ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:40:59] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:40:59] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:40:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-01 06:40:59] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-01 06:40:59] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:40:59] [INFO ] After 47ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:41:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:41:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
TRAPS : Iteration 1
[2024-06-01 06:41:00] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:00] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 1428 steps (0 resets) in 10 ms. (129 steps per ms) remains 0/1 properties
RANDOM walk for 1765 steps (0 resets) in 9 ms. (176 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36244 steps, run visited all 1 properties in 274 ms. (steps per millisecond=132 )
Probabilistic random walk after 36244 steps, saw 20427 distinct states, run finished after 291 ms. (steps per millisecond=124 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 79 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 75 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 286 place count 75 transition count 130
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 291 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 322 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 353 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 359 place count 44 transition count 94
Applied a total of 359 rules in 19 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2024-06-01 06:41:00] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 06:41:00] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:41:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 06:41:00] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:41:00] [INFO ] After 10ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:41:00] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:00] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 180 ms.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 1116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 1116
Applied a total of 28 rules in 11 ms. Remains 384 /398 variables (removed 14) and now considering 1116/1200 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 384/398 places, 1116/1200 transitions.
[2024-06-01 06:41:00] [INFO ] Flatten gal took : 31 ms
[2024-06-01 06:41:00] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:41:00] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 398 transition count 1194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 392 transition count 1194
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 392 transition count 1080
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 278 transition count 1080
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 254 place count 264 transition count 996
Iterating global reduction 2 with 14 rules applied. Total rules applied 268 place count 264 transition count 996
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 2 with 60 rules applied. Total rules applied 328 place count 234 transition count 966
Applied a total of 328 rules in 87 ms. Remains 234 /398 variables (removed 164) and now considering 966/1200 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 234/398 places, 966/1200 transitions.
[2024-06-01 06:41:01] [INFO ] Flatten gal took : 42 ms
[2024-06-01 06:41:01] [INFO ] Flatten gal took : 48 ms
[2024-06-01 06:41:01] [INFO ] Input system was already deterministic with 966 transitions.
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624498 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624498 steps, saw 154430 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2024-06-01 06:41:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 06:41:04] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 06:41:04] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 120/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1937ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 40 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 400000 steps (8 resets) in 1729 ms. (231 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 06:41:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:41:06] [INFO ] Invariant cache hit.
[2024-06-01 06:41:06] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 06:41:06] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-01 06:41:07] [INFO ] After 190ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 06:41:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:41:07] [INFO ] After 30ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:41:07] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:41:07] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:41:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 06:41:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 06:41:07] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:07] [INFO ] After 32ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 434 ms
TRAPS : Iteration 1
[2024-06-01 06:41:07] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:41:07] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 9686 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2721 ms. (1469 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1970605 steps, run timeout after 9001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 1970605 steps, saw 406426 distinct states, run finished after 9001 ms. (steps per millisecond=218 ) properties seen :0
[2024-06-01 06:41:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:41:20] [INFO ] Invariant cache hit.
[2024-06-01 06:41:20] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 112/430 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/438 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 168/606 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 120/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/82 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/430 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1903ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10467 steps, including 385 resets, run visited all 1 properties in 52 ms. (steps per millisecond=201 )
FORMULA EisenbergMcGuire-PT-06-CTLFireability-2023-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 67 ms.
Starting structural reductions in LTL mode, iteration 0 : 398/398 places, 1200/1200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 386 transition count 1128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 386 transition count 1128
Applied a total of 24 rules in 25 ms. Remains 386 /398 variables (removed 12) and now considering 1128/1200 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 386/398 places, 1128/1200 transitions.
[2024-06-01 06:41:22] [INFO ] Flatten gal took : 42 ms
[2024-06-01 06:41:22] [INFO ] Flatten gal took : 48 ms
[2024-06-01 06:41:22] [INFO ] Input system was already deterministic with 1128 transitions.
[2024-06-01 06:41:22] [INFO ] Flatten gal took : 52 ms
[2024-06-01 06:41:22] [INFO ] Flatten gal took : 52 ms
[2024-06-01 06:41:22] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2024-06-01 06:41:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 398 places, 1200 transitions and 5592 arcs took 16 ms.
Total runtime 361900 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 : EisenbergMcGuire-PT-06-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-06-CTLFireability-2023-14

BK_STOP 1717224083074

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1932/ctl_0_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1932/ctl_1_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1932/ctl_2_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1932/ctl_3_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1932/ctl_4_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1932/ctl_5_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1932/ctl_6_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1932/ctl_7_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1932/ctl_8_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1932/ctl_9_
ctl formula name EisenbergMcGuire-PT-06-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1932/ctl_10_
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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r492-smll-171636266300170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 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 ;