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-171683758100127.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 ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758100127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 5.1K 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 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:30 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:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 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 503K 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 ShieldIIPs-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716903472051

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 13:37:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 13:37:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:37:53] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-28 13:37:53] [INFO ] Transformed 1803 places.
[2024-05-28 13:37:53] [INFO ] Transformed 1773 transitions.
[2024-05-28 13:37:53] [INFO ] Found NUPN structural information;
[2024-05-28 13:37:53] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2087 ms. (19 steps per ms) remains 5/15 properties
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1004 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
// Phase 1: matrix 1773 rows 1803 cols
[2024-05-28 13:37:55] [INFO ] Computed 271 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1077/1214 variables, 165/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1214 variables, 1077/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 589/1803 variables, 106/1485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 589/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1803 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1773/3576 variables, 1803/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3576 variables, 0/3877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3576/3576 variables, and 3877 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2124 ms.
Refiners :[Domain max(s): 1803/1803 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1803/1803 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1077/1214 variables, 165/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1214 variables, 1077/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 13:37:57] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 48 ms to minimize.
[2024-05-28 13:37:58] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 6 ms to minimize.
[2024-05-28 13:37:58] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 5 ms to minimize.
[2024-05-28 13:37:58] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 5 ms to minimize.
[2024-05-28 13:37:59] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:37:59] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 7 ms to minimize.
[2024-05-28 13:37:59] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 4 ms to minimize.
[2024-05-28 13:37:59] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:38:00] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 5 ms to minimize.
[2024-05-28 13:38:00] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 4 ms to minimize.
[2024-05-28 13:38:00] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 5 ms to minimize.
[2024-05-28 13:38:00] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 5 ms to minimize.
[2024-05-28 13:38:01] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 5 ms to minimize.
[2024-05-28 13:38:01] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 4 ms to minimize.
[2024-05-28 13:38:01] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 5 ms to minimize.
[2024-05-28 13:38:02] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 5 ms to minimize.
[2024-05-28 13:38:02] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/3576 variables, and 1396 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5008 ms.
Refiners :[Domain max(s): 1214/1803 constraints, Positive P Invariants (semi-flows): 165/271 constraints, State Equation: 0/1803 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 17/17 constraints]
After SMT, in 7341ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 1803 transition count 1651
Reduce places removed 122 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 130 rules applied. Total rules applied 252 place count 1681 transition count 1643
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 260 place count 1673 transition count 1643
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 260 place count 1673 transition count 1504
Deduced a syphon composed of 139 places in 3 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 538 place count 1534 transition count 1504
Discarding 182 places :
Symmetric choice reduction at 3 with 182 rule applications. Total rules 720 place count 1352 transition count 1322
Iterating global reduction 3 with 182 rules applied. Total rules applied 902 place count 1352 transition count 1322
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 902 place count 1352 transition count 1261
Deduced a syphon composed of 61 places in 8 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1024 place count 1291 transition count 1261
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 5 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1824 place count 891 transition count 861
Partial Free-agglomeration rule applied 172 times.
Drop transitions (Partial Free agglomeration) removed 172 transitions
Iterating global reduction 3 with 172 rules applied. Total rules applied 1996 place count 891 transition count 861
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1997 place count 890 transition count 860
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1998 place count 889 transition count 860
Applied a total of 1998 rules in 682 ms. Remains 889 /1803 variables (removed 914) and now considering 860/1773 (removed 913) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 889/1803 places, 860/1773 transitions.
RANDOM walk for 40000 steps (13 resets) in 767 ms. (52 steps per ms) remains 3/5 properties
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
// Phase 1: matrix 860 rows 889 cols
[2024-05-28 13:38:03] [INFO ] Computed 270 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 411/483 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 196/679 variables, 70/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/695 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 751/1446 variables, 695/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1446 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 204/1650 variables, 120/1021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 31/1052 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/1663 variables, 9/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1663 variables, 9/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1663 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 15/1678 variables, 7/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1678 variables, 6/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1678 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 51/1729 variables, 43/1126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1729 variables, 6/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1729 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 6/1735 variables, 6/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1735 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1735 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 14/1749 variables, 14/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1749 variables, 5/1159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1749 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1749 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1749/1749 variables, and 1159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 262/262 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 411/483 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 3 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 5 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 196/679 variables, 70/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 4 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:38:08] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 3 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 7 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-28 13:38:10] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/679 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/695 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 3 ms to minimize.
[2024-05-28 13:38:11] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/695 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:12] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-05-28 13:38:12] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/695 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 751/1446 variables, 695/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1446 variables, 1/958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:12] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:38:12] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:38:12] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 3 ms to minimize.
[2024-05-28 13:38:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1446 variables, 10/968 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:38:14] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-28 13:38:15] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 11 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1446 variables, 17/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1446 variables, 6/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1446 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 204/1650 variables, 120/1111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1650 variables, 31/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1650 variables, 2/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 4 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 4 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 4 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 7 ms to minimize.
[2024-05-28 13:38:20] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:38:20] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:38:20] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 4 ms to minimize.
[2024-05-28 13:38:20] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:38:20] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1650 variables, 20/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 3 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:38:25] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:38:25] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1650 variables, 12/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1650 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 13/1663 variables, 9/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1663 variables, 9/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:25] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1663 variables, 1/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1663 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 15/1678 variables, 7/1202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1678 variables, 6/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:26] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:38:26] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:38:26] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 3 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 3 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 3 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1678 variables, 8/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1678 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 51/1729 variables, 43/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1729 variables, 6/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:28] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1729 variables, 1/1266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1729 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 6/1735 variables, 6/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1735 variables, 2/1274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:29] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1735 variables, 1/1275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1735 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 14/1749 variables, 14/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1749 variables, 5/1294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-05-28 13:38:30] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1749 variables, 2/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1749 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 0/1749 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1749/1749 variables, and 1296 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26051 ms.
Refiners :[Positive P Invariants (semi-flows): 262/262 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 134/134 constraints]
After SMT, in 27329ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1435 ms.
Support contains 72 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 860/860 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 889 transition count 852
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 881 transition count 851
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 880 transition count 851
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 880 transition count 839
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 868 transition count 839
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 116 place count 831 transition count 802
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 143 place count 831 transition count 802
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 830 transition count 801
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 830 transition count 801
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 827 transition count 798
Applied a total of 148 rules in 186 ms. Remains 827 /889 variables (removed 62) and now considering 798/860 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 827/889 places, 798/860 transitions.
RANDOM walk for 40000 steps (12 resets) in 522 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 117506 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 3
Probabilistic random walk after 117506 steps, saw 69132 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 798 rows 827 cols
[2024-05-28 13:38:36] [INFO ] Computed 270 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 379/451 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 188/639 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/649 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 710/1359 variables, 649/855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 187/1546 variables, 118/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 37/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1546 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/1549 variables, 3/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1549 variables, 3/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1549 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/1553 variables, 2/1018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1553 variables, 4/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1553 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1555 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1555 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1555 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 52/1607 variables, 36/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1607 variables, 9/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1607 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1607 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3/1610 variables, 5/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1610 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 15/1625 variables, 12/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1625 variables, 6/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1625 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/1625 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1625/1625 variables, and 1097 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 827/827 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 379/451 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:37] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:38:37] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:38:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:38:37] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:38:37] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 188/639 variables, 70/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 3 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 3 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 18/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/649 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 710/1359 variables, 649/899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1359 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:38:45] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1359 variables, 20/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1359 variables, 4/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 5/929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1359 variables, 5/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 4 ms to minimize.
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1359 variables, 4/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1359 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 187/1546 variables, 118/1056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1546 variables, 37/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1546 variables, 2/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:49] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-05-28 13:38:49] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 3 ms to minimize.
[2024-05-28 13:38:50] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-28 13:38:51] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 5 ms to minimize.
[2024-05-28 13:38:52] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 4 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 4 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1546 variables, 20/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1546 variables, 19/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1546 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1546 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 3/1549 variables, 3/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1549 variables, 3/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1549 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 4/1553 variables, 2/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1553 variables, 4/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1553 variables, 2/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1553 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 2/1555 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1555 variables, 2/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1555 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 52/1607 variables, 36/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1607 variables, 9/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1607 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:38:59] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:39:00] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1607 variables, 2/1200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:39:00] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1607 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1607 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 3/1610 variables, 5/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1610 variables, 3/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1610 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 15/1625 variables, 12/1221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1625 variables, 6/1227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1625 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 0/1625 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1625/1625 variables, and 1227 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24614 ms.
Refiners :[Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 827/827 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 127/127 constraints]
After SMT, in 25915ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2376 ms.
Support contains 72 out of 827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 798/798 transitions.
Applied a total of 0 rules in 22 ms. Remains 827 /827 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 827/827 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 798/798 transitions.
Applied a total of 0 rules in 21 ms. Remains 827 /827 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2024-05-28 13:39:04] [INFO ] Invariant cache hit.
[2024-05-28 13:39:04] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 13:39:04] [INFO ] Invariant cache hit.
[2024-05-28 13:39:05] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2024-05-28 13:39:05] [INFO ] Redundant transitions in 65 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-28 13:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/809 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-28 13:39:20] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:39:20] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 779 unsolved
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 30275ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31716 ms. Remains : 827/827 places, 798/798 transitions.
[2024-05-28 13:39:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-28 13:39:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 827 places, 798 transitions and 3716 arcs took 22 ms.
[2024-05-28 13:39:36] [INFO ] Flatten gal took : 123 ms
Total runtime 103185 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-030B

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: 827
TRANSITIONS: 798
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 1418
MODEL NAME: /home/mcc/execution/411/model
827 places, 798 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 ReachabilityFireability -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="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-030B, examination is ReachabilityFireability"
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-171683758100127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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