fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683759600815
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldRVs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6509.188 3600000.00 7273350.00 7815.70 TFTFFTFFFT?T?FTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 244K 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 ShieldRVs-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2023-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717051462020

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:44:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 06:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:44:23] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-30 06:44:23] [INFO ] Transformed 803 places.
[2024-05-30 06:44:23] [INFO ] Transformed 903 transitions.
[2024-05-30 06:44:23] [INFO ] Found NUPN structural information;
[2024-05-30 06:44:23] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (44 resets) in 2424 ms. (16 steps per ms) remains 7/16 properties
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 891 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
// Phase 1: matrix 903 rows 803 cols
[2024-05-30 06:44:25] [INFO ] Computed 81 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ShieldRVs-PT-020B-ReachabilityFireability-2024-13 is UNSAT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 525/799 variables, 80/354 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/799 variables, 525/879 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/803 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 4/884 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 903/1706 variables, 803/1687 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1706 variables, 0/1687 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 1687 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2067 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 253/253 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 546/799 variables, 80/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/799 variables, 546/879 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-30 06:44:27] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 35 ms to minimize.
[2024-05-30 06:44:28] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 3 ms to minimize.
[2024-05-30 06:44:28] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-30 06:44:28] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 4 ms to minimize.
[2024-05-30 06:44:28] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-30 06:44:28] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 3 ms to minimize.
[2024-05-30 06:44:29] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-30 06:44:30] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 20/899 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-30 06:44:31] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-30 06:44:31] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-30 06:44:31] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-30 06:44:31] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-05-30 06:44:31] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 4 ms to minimize.
[2024-05-30 06:44:32] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-30 06:44:32] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-30 06:44:32] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 7409ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 253 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 803 transition count 863
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 87 place count 763 transition count 856
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 756 transition count 856
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 94 place count 756 transition count 790
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 226 place count 690 transition count 790
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 309 place count 607 transition count 707
Iterating global reduction 3 with 83 rules applied. Total rules applied 392 place count 607 transition count 707
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 392 place count 607 transition count 693
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 420 place count 593 transition count 693
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 602 place count 502 transition count 602
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 615 place count 502 transition count 602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 616 place count 501 transition count 601
Applied a total of 616 rules in 185 ms. Remains 501 /803 variables (removed 302) and now considering 601/903 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 501/803 places, 601/903 transitions.
RANDOM walk for 40000 steps (72 resets) in 908 ms. (44 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
// Phase 1: matrix 601 rows 501 cols
[2024-05-30 06:44:33] [INFO ] Computed 81 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 251/499 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/501 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 601/1102 variables, 501/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1102 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 582 constraints, problems are : Problem set: 0 solved, 5 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 501/501 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/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 251/499 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 06:44:34] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-30 06:44:34] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-30 06:44:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-30 06:44:34] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 3 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-30 06:44:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-30 06:44:36] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 5 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-30 06:44:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-30 06:44:38] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 3 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:39] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:44:40] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:44:41] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
Problem ShieldRVs-PT-020B-ReachabilityFireability-2024-15 is UNSAT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 8/168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 6/174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/501 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 3/178 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:42] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 601/1102 variables, 501/680 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1102 variables, 4/684 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:44:45] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:44:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:44:46] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1102 variables, 9/693 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:46] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1102 variables, 1/694 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:47] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1102 variables, 1/695 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:48] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2024-05-30 06:44:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:44:48] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
[2024-05-30 06:44:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1102 variables, 4/699 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:49] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-30 06:44:49] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-30 06:44:49] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:44:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:44:50] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2024-05-30 06:44:50] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1102 variables, 6/705 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:51] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:44:51] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:44:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:44:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:44:51] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:44:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-30 06:44:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:44:52] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-30 06:44:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:44:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1102 variables, 10/715 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:53] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:44:53] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-30 06:44:53] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:44:53] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:44:53] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:44:54] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:44:54] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1102 variables, 7/722 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:44:55] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:44:56] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:44:56] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:44:56] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:44:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:44:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1102 variables, 11/733 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1102 variables, 0/733 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:44:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:44:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:44:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:44:58] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 06:44:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-30 06:44:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-30 06:44:59] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-30 06:44:59] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 3 ms to minimize.
[2024-05-30 06:44:59] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:45:00] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-30 06:45:00] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 06:45:00] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 06:45:00] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/1102 variables, 13/746 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:45:01] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-30 06:45:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-30 06:45:02] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 06:45:02] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:45:02] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1102 variables, 6/752 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:45:03] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1102 variables, 1/753 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:45:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-30 06:45:05] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-30 06:45:05] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-30 06:45:05] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1102 variables, 4/757 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1102 variables, 0/757 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 06:45:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:45:07] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2024-05-30 06:45:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/1102 variables, 3/760 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1102 variables, 0/760 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/1102 variables, 0/760 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 760 constraints, problems are : Problem set: 1 solved, 4 unsolved in 34954 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 174/174 constraints]
After SMT, in 35961ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 5511 ms.
Support contains 200 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 601/601 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 597
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 497 transition count 595
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 495 transition count 595
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 12 place count 495 transition count 584
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 34 place count 484 transition count 584
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 38 place count 480 transition count 580
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 480 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 42 place count 480 transition count 579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 479 transition count 579
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 76 place count 463 transition count 563
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 463 transition count 563
Applied a total of 81 rules in 64 ms. Remains 463 /501 variables (removed 38) and now considering 563/601 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 463/501 places, 563/601 transitions.
RANDOM walk for 40000 steps (77 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 394393 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 4
Probabilistic random walk after 394393 steps, saw 77428 distinct states, run finished after 3006 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 563 rows 463 cols
[2024-05-30 06:45:18] [INFO ] Computed 81 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/461 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/463 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 563/1026 variables, 463/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1026 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 544 constraints, problems are : Problem set: 0 solved, 4 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 463/463 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/461 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-30 06:45:19] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-30 06:45:20] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-30 06:45:21] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
[2024-05-30 06:45:22] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:45:23] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-30 06:45:24] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-30 06:45:25] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 4 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/463 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:45:26] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 563/1026 variables, 463/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1026 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:27] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:28] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-30 06:45:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 06:45:30] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-30 06:45:30] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:30] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1026 variables, 20/656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:30] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-30 06:45:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:32] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1026 variables, 15/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:45:33] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:33] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:33] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-05-30 06:45:33] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:45:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 06:45:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:45:34] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:45:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1026 variables, 9/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:35] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:36] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1026 variables, 14/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-30 06:45:37] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:45:37] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1026 variables, 3/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:38] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-30 06:45:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:45:38] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:38] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1026 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:40] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:45:40] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1026 variables, 5/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 06:45:40] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1026 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1026 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1026 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 707 constraints, problems are : Problem set: 0 solved, 4 unsolved in 23366 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 463/463 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 159/159 constraints]
After SMT, in 24021ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2237 ms.
Support contains 200 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 563/563 transitions.
Applied a total of 0 rules in 12 ms. Remains 463 /463 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 463/463 places, 563/563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 563/563 transitions.
Applied a total of 0 rules in 12 ms. Remains 463 /463 variables (removed 0) and now considering 563/563 (removed 0) transitions.
[2024-05-30 06:45:44] [INFO ] Invariant cache hit.
[2024-05-30 06:45:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-30 06:45:44] [INFO ] Invariant cache hit.
[2024-05-30 06:45:44] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-30 06:45:45] [INFO ] Redundant transitions in 51 ms returned []
Running 561 sub problems to find dead transitions.
[2024-05-30 06:45:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 2/463 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:45:52] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:45:52] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2024-05-30 06:45:52] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-30 06:45:52] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-30 06:45:52] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 06:45:53] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-05-30 06:45:54] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:45:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:45:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:45:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:45:56] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-30 06:45:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:45:56] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:46:00] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-30 06:46:02] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 06:46:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-30 06:46:04] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:46:05] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 06:46:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-30 06:46:10] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-30 06:46:11] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-30 06:46:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 06:46:13] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 06:46:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 06:46:13] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 06:46:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 06:46:13] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 06:46:14] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 06:46:14] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-30 06:46:14] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 4 ms to minimize.
[2024-05-30 06:46:14] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-05-30 06:46:15] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-30 06:46:15] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30749 ms. Remains : 463/463 places, 563/563 transitions.
[2024-05-30 06:46:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2024-05-30 06:46:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 463 places, 563 transitions and 2225 arcs took 6 ms.
[2024-05-30 06:46:15] [INFO ] Flatten gal took : 75 ms
Total runtime 112255 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-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: 463
TRANSITIONS: 563
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]


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


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

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

Process ID: 2122
MODEL NAME: /home/mcc/execution/411/model
463 places, 563 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-2023-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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-171683759600815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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