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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716931681102

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 21:28:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 21:28:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:28:02] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-28 21:28:02] [INFO ] Transformed 1403 places.
[2024-05-28 21:28:02] [INFO ] Transformed 1303 transitions.
[2024-05-28 21:28:02] [INFO ] Found NUPN structural information;
[2024-05-28 21:28:02] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 81 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 1201 transition count 1101
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 1201 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 405 place count 1200 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 406 place count 1200 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 407 place count 1199 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 1199 transition count 1099
Applied a total of 408 rules in 450 ms. Remains 1199 /1403 variables (removed 204) and now considering 1099/1303 (removed 204) transitions.
// Phase 1: matrix 1099 rows 1199 cols
[2024-05-28 21:28:03] [INFO ] Computed 181 invariants in 26 ms
[2024-05-28 21:28:03] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-28 21:28:03] [INFO ] Invariant cache hit.
[2024-05-28 21:28:04] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-05-28 21:28:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 30290ms
Starting structural reductions in LTL mode, iteration 1 : 1199/1403 places, 1099/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32209 ms. Remains : 1199/1403 places, 1099/1303 transitions.
Support contains 81 out of 1199 places after structural reductions.
[2024-05-28 21:28:35] [INFO ] Flatten gal took : 99 ms
[2024-05-28 21:28:35] [INFO ] Flatten gal took : 55 ms
[2024-05-28 21:28:35] [INFO ] Input system was already deterministic with 1099 transitions.
Support contains 70 out of 1199 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2430 ms. (16 steps per ms) remains 20/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
[2024-05-28 21:28:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 281/313 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 886/1199 variables, 148/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1199 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1099/2298 variables, 1199/1380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2298 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/2298 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2298/2298 variables, and 1380 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1199/1199 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 281/313 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 886/1199 variables, 148/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-28 21:28:38] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 24 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 3 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 3 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1199 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1099/2298 variables, 1199/1399 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2298 variables, 20/1419 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 4 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 7256ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 1199 transition count 873
Reduce places removed 226 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 231 rules applied. Total rules applied 457 place count 973 transition count 868
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 462 place count 968 transition count 868
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 462 place count 968 transition count 720
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 758 place count 820 transition count 720
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 769 place count 809 transition count 709
Iterating global reduction 3 with 11 rules applied. Total rules applied 780 place count 809 transition count 709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 780 place count 809 transition count 703
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 792 place count 803 transition count 703
Performed 325 Post agglomeration using F-continuation condition.Transition count delta: 325
Deduced a syphon composed of 325 places in 1 ms
Reduce places removed 325 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1442 place count 478 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1443 place count 478 transition count 377
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1445 place count 477 transition count 376
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1553 place count 423 transition count 408
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1554 place count 423 transition count 407
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1556 place count 423 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1558 place count 421 transition count 405
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1578 place count 421 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1579 place count 420 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1581 place count 418 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1581 place count 418 transition count 403
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1583 place count 417 transition count 403
Applied a total of 1583 rules in 247 ms. Remains 417 /1199 variables (removed 782) and now considering 403/1099 (removed 696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 417/1199 places, 403/1099 transitions.
RANDOM walk for 40000 steps (8 resets) in 615 ms. (64 steps per ms) remains 8/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
// Phase 1: matrix 403 rows 417 cols
[2024-05-28 21:28:44] [INFO ] Computed 179 invariants in 4 ms
[2024-05-28 21:28:44] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 44/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/68 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 97/165 variables, 68/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 138/303 variables, 69/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 26/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 7/310 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/318 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 159/477 variables, 82/295 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 28/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/477 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 11/488 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/488 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 6/494 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/494 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 128/622 variables, 70/412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/622 variables, 25/437 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/622 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 7/629 variables, 5/442 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/629 variables, 5/447 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/629 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 8/637 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/637 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 68/705 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/705 variables, 15/510 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/705 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 2/707 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/707 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/707 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 2/709 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/709 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 59/768 variables, 30/545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/768 variables, 9/554 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/768 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 4/772 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/772 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/772 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 25/797 variables, 16/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/797 variables, 6/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/797 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 1/798 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/798 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/798 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 2/800 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/800 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 16/816 variables, 10/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/816 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/816 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/816 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 1/817 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/817 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/817 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 1/818 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/818 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/818 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 2/820 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/820 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/820 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 0/820 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 607 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 44/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/68 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 97/165 variables, 68/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 138/303 variables, 69/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 26/197 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/303 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 7/310 variables, 7/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/310 variables, 7/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/310 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 8/318 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/318 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 159/477 variables, 82/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 28/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 11/488 variables, 9/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/488 variables, 7/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/488 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 6/494 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/494 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 128/622 variables, 70/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/622 variables, 25/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/622 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 7/629 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/629 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 8/637 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/637 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 68/705 variables, 44/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/705 variables, 15/521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/705 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 2/707 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/707 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/707 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 2/709 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/709 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 59/768 variables, 30/556 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/768 variables, 9/565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/768 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 4/772 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/772 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/772 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 25/797 variables, 16/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/797 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/797 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 1/798 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/798 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/798 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (OVERLAPS) 2/800 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/800 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 16/816 variables, 10/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/816 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/816 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/816 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 1/817 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/817 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/817 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 1/818 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/818 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/818 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 2/820 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/820 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/820 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 0/820 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 618 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2624 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 417/417 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 4439ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 7 properties in 1307 ms.
Support contains 4 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 403/403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 417 transition count 400
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 414 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 6 place count 414 transition count 389
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 28 place count 403 transition count 389
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 389 transition count 375
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 66 place count 384 transition count 379
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 381 transition count 376
Applied a total of 69 rules in 48 ms. Remains 381 /417 variables (removed 36) and now considering 376/403 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 381/417 places, 376/403 transitions.
RANDOM walk for 40000 steps (8 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 486157 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 486157 steps, saw 330893 distinct states, run finished after 3004 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 376 rows 381 cols
[2024-05-28 21:28:53] [INFO ] Computed 179 invariants in 2 ms
[2024-05-28 21:28:53] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/63 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/122 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 82/204 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/207 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/211 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/290 variables, 40/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 16/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/292 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/292 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/292 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/296 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/296 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 67/363 variables, 38/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/363 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 3/366 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/366 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/366 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 6/372 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/372 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 54/426 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/426 variables, 12/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 51/477 variables, 24/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/477 variables, 9/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/477 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 3/480 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/480 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/480 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/486 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/486 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 54/540 variables, 30/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/540 variables, 12/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/540 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 51/591 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/591 variables, 9/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/591 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 3/594 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/594 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/594 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/600 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/600 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 49/649 variables, 30/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/649 variables, 12/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/649 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 27/676 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/676 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/676 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/678 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/678 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/678 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 2/680 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/680 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 24/704 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/704 variables, 6/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/704 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 17/721 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/721 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/721 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 1/722 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/722 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/722 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 2/724 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/724 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 16/740 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/740 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/740 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 9/749 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/749 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/749 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/749 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 1/750 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/750 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/750 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 1/751 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/751 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/751 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 6/757 variables, 4/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/757 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/757 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 0/757 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 381/381 constraints, ReadFeed: 8/8 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/63 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/122 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/204 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/207 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/207 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/211 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/211 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 79/290 variables, 40/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/290 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/290 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/292 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/292 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/292 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/296 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/296 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/363 variables, 38/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/363 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/363 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/366 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/366 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/366 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/372 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/372 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 54/426 variables, 30/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/426 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/426 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 51/477 variables, 24/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/477 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/477 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 3/480 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/480 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/480 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 6/486 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 54/540 variables, 30/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/540 variables, 12/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/540 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 51/591 variables, 24/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/591 variables, 9/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/591 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 3/594 variables, 3/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/594 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/594 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 6/600 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/600 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 49/649 variables, 30/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/649 variables, 12/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/649 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 27/676 variables, 14/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/676 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/676 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 2/678 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/678 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/678 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/680 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/680 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 24/704 variables, 14/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/704 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/704 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 17/721 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/721 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/721 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 1/722 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/722 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/722 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2/724 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/724 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 16/740 variables, 10/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/740 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/740 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 9/749 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/749 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/749 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/749 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 1/750 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/750 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/750 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 1/751 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/751 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/751 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 6/757 variables, 4/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/757 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/757 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 0/757 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 757/757 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 381/381 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 381 /381 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 381/381 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 381 /381 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-28 21:28:54] [INFO ] Invariant cache hit.
[2024-05-28 21:28:54] [INFO ] Implicit Places using invariants in 191 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 380/381 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 379 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 379 transition count 375
Applied a total of 2 rules in 12 ms. Remains 379 /380 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 379 cols
[2024-05-28 21:28:54] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:28:55] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-28 21:28:55] [INFO ] Invariant cache hit.
[2024-05-28 21:28:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-28 21:28:55] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/381 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 734 ms. Remains : 379/381 places, 375/376 transitions.
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 531295 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 531295 steps, saw 360922 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-28 21:28:58] [INFO ] Invariant cache hit.
[2024-05-28 21:28:58] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/63 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/122 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 82/204 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/207 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/211 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/290 variables, 40/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 16/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/292 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/292 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/292 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/296 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/296 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 67/363 variables, 38/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/363 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 3/366 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/366 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/366 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 6/372 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/372 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 54/426 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/426 variables, 12/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 51/477 variables, 24/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/477 variables, 9/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/477 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 3/480 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/480 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/480 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/486 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/486 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 54/540 variables, 30/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/540 variables, 12/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/540 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 51/591 variables, 24/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/591 variables, 9/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/591 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 3/594 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/594 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/594 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/600 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/600 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 49/649 variables, 30/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/649 variables, 12/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/649 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 27/676 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/676 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/676 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/678 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/678 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/678 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 2/680 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/680 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 24/704 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/704 variables, 6/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/704 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 17/721 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/721 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/721 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 1/722 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/722 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/722 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 2/724 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/724 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 16/740 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/740 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/740 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 8/748 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/748 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/748 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 6/754 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/754 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/754 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 0/754 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/63 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/122 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/204 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/207 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/211 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/211 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 79/290 variables, 40/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/290 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/292 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/292 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/292 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/296 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/296 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 67/363 variables, 38/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/363 variables, 14/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/363 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/366 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/366 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/366 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/372 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/372 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 54/426 variables, 30/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/426 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/426 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 51/477 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/477 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/477 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 3/480 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/480 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/480 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 6/486 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/486 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 54/540 variables, 30/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/540 variables, 12/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/540 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 51/591 variables, 24/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/591 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/591 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 3/594 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/594 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/594 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 6/600 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/600 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 49/649 variables, 30/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/649 variables, 12/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/649 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 27/676 variables, 14/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/676 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/676 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 2/678 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/678 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/678 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2/680 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/680 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 24/704 variables, 14/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/704 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/704 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 17/721 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/721 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/721 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 1/722 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/722 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/722 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 2/724 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/724 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 16/740 variables, 10/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/740 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/740 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/740 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 8/748 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/748 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/748 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 6/754 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/754 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/754 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 0/754 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 18 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 379/379 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-28 21:28:59] [INFO ] Invariant cache hit.
[2024-05-28 21:29:00] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-28 21:29:00] [INFO ] Invariant cache hit.
[2024-05-28 21:29:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-28 21:29:00] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-28 21:29:00] [INFO ] Redundant transitions in 20 ms returned []
Running 370 sub problems to find dead transitions.
[2024-05-28 21:29:00] [INFO ] Invariant cache hit.
[2024-05-28 21:29:00] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 2/379 variables, 9/178 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-28 21:29:05] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:29:05] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 375/754 variables, 379/559 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (OVERLAPS) 0/754 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 566 constraints, problems are : Problem set: 0 solved, 370 unsolved in 19930 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 2/379 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 375/754 variables, 379/559 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 370/936 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (OVERLAPS) 0/754 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 936 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24669 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 379/379 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 2/2 constraints]
After SMT, in 44666ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 44669ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45227 ms. Remains : 379/379 places, 375/375 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 379 transition count 375
Applied a total of 42 rules in 13 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 379 cols
[2024-05-28 21:29:45] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:29:45] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2024-05-28 21:29:45] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:29:45] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2024-05-28 21:29:45] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:29:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 21:29:45] [INFO ] After 25ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:29:45] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:29:45] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 391 ms.
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 41 ms
[2024-05-28 21:29:45] [INFO ] Input system was already deterministic with 1099 transitions.
Computed a total of 324 stabilizing places and 324 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 78 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 39 ms
[2024-05-28 21:29:45] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1198 transition count 858
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 958 transition count 857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 957 transition count 857
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 482 place count 957 transition count 703
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 790 place count 803 transition count 703
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 806 place count 787 transition count 687
Iterating global reduction 3 with 16 rules applied. Total rules applied 822 place count 787 transition count 687
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 822 place count 787 transition count 677
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 842 place count 777 transition count 677
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 0 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1470 place count 463 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1471 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1473 place count 462 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1475 place count 460 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1477 place count 458 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1477 place count 458 transition count 358
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1479 place count 457 transition count 358
Applied a total of 1479 rules in 112 ms. Remains 457 /1199 variables (removed 742) and now considering 358/1099 (removed 741) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 457/1199 places, 358/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1181 transition count 1081
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1181 transition count 1081
Applied a total of 36 rules in 58 ms. Remains 1181 /1199 variables (removed 18) and now considering 1081/1099 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1181/1199 places, 1081/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 39 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 31 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 66 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 28 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1198 transition count 856
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 956 transition count 856
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 484 place count 956 transition count 702
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 792 place count 802 transition count 702
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 807 place count 787 transition count 687
Iterating global reduction 2 with 15 rules applied. Total rules applied 822 place count 787 transition count 687
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 822 place count 787 transition count 678
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 840 place count 778 transition count 678
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1470 place count 463 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1473 place count 462 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1475 place count 460 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1477 place count 458 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1477 place count 458 transition count 358
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1479 place count 457 transition count 358
Applied a total of 1479 rules in 97 ms. Remains 457 /1199 variables (removed 742) and now considering 358/1099 (removed 741) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 457/1199 places, 358/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 56 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1184 transition count 1084
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1184 transition count 1084
Applied a total of 30 rules in 57 ms. Remains 1184 /1199 variables (removed 15) and now considering 1084/1099 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1184/1199 places, 1084/1099 transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:29:46] [INFO ] Input system was already deterministic with 1084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 62 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1198 transition count 857
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 957 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 956 transition count 856
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 484 place count 956 transition count 703
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 790 place count 803 transition count 703
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 805 place count 788 transition count 688
Iterating global reduction 3 with 15 rules applied. Total rules applied 820 place count 788 transition count 688
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 820 place count 788 transition count 678
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 840 place count 778 transition count 678
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1468 place count 464 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 464 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 463 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1473 place count 461 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1475 place count 459 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1475 place count 459 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1477 place count 458 transition count 359
Applied a total of 1477 rules in 98 ms. Remains 458 /1199 variables (removed 741) and now considering 359/1099 (removed 740) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 458/1199 places, 359/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 359 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1198 transition count 858
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 958 transition count 857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 957 transition count 857
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 482 place count 957 transition count 703
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 790 place count 803 transition count 703
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 806 place count 787 transition count 687
Iterating global reduction 3 with 16 rules applied. Total rules applied 822 place count 787 transition count 687
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 822 place count 787 transition count 677
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 842 place count 777 transition count 677
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1466 place count 465 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1467 place count 465 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1469 place count 464 transition count 363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 462 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1473 place count 460 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1473 place count 460 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1475 place count 459 transition count 360
Applied a total of 1475 rules in 99 ms. Remains 459 /1199 variables (removed 740) and now considering 360/1099 (removed 739) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 459/1199 places, 360/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1181 transition count 1081
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1181 transition count 1081
Applied a total of 36 rules in 68 ms. Remains 1181 /1199 variables (removed 18) and now considering 1081/1099 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 1181/1199 places, 1081/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 57 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1198 transition count 861
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 961 transition count 859
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 478 place count 959 transition count 859
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 478 place count 959 transition count 706
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 784 place count 806 transition count 706
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 797 place count 793 transition count 693
Iterating global reduction 3 with 13 rules applied. Total rules applied 810 place count 793 transition count 693
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 810 place count 793 transition count 686
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 824 place count 786 transition count 686
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 0 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1452 place count 472 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1453 place count 472 transition count 371
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1455 place count 471 transition count 370
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1457 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1459 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1459 place count 467 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1461 place count 466 transition count 367
Applied a total of 1461 rules in 112 ms. Remains 466 /1199 variables (removed 733) and now considering 367/1099 (removed 732) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 466/1199 places, 367/1099 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1182 transition count 1082
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1182 transition count 1082
Applied a total of 34 rules in 74 ms. Remains 1182 /1199 variables (removed 17) and now considering 1082/1099 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 1182/1199 places, 1082/1099 transitions.
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:48] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1184 transition count 1084
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1184 transition count 1084
Applied a total of 30 rules in 57 ms. Remains 1184 /1199 variables (removed 15) and now considering 1084/1099 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1184/1199 places, 1084/1099 transitions.
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:48] [INFO ] Input system was already deterministic with 1084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 1099/1099 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1181 transition count 1081
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1181 transition count 1081
Applied a total of 36 rules in 70 ms. Remains 1181 /1199 variables (removed 18) and now considering 1081/1099 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1181/1199 places, 1081/1099 transitions.
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:29:48] [INFO ] Input system was already deterministic with 1081 transitions.
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:29:48] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:29:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-28 21:29:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1199 places, 1099 transitions and 2838 arcs took 6 ms.
Total runtime 106335 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-020B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 717
MODEL NAME: /home/mcc/execution/411/model
1199 places, 1099 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-020B, 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 r355-tall-171683758400282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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