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.r356-tall-171683762000878.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 itstools
Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000878
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 61K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K 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 1.3M 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-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2023-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717071983302

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 12:26:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 12:26:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:26:24] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-30 12:26:24] [INFO ] Transformed 4003 places.
[2024-05-30 12:26:24] [INFO ] Transformed 4503 transitions.
[2024-05-30 12:26:24] [INFO ] Found NUPN structural information;
[2024-05-30 12:26:24] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2367 ms. (16 steps per ms) remains 4/15 properties
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
[2024-05-30 12:26:26] [INFO ] Flatten gal took : 508 ms
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
[2024-05-30 12:26:26] [INFO ] Flatten gal took : 214 ms
// Phase 1: matrix 4503 rows 4003 cols
[2024-05-30 12:26:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11025899160099462676.gal : 108 ms
[2024-05-30 12:26:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14634631993435190987.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11025899160099462676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14634631993435190987.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-30 12:26:26] [INFO ] Computed 401 invariants in 91 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality14634631993435190987.prop.
At refinement iteration 2 (OVERLAPS) 2854/2890 variables, 285/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2890 variables, 2854/3175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2890 variables, 0/3175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1113/4003 variables, 116/3291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4003 variables, 1113/4404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4003 variables, 0/4404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4503/8506 variables, 4003/8407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8506/8506 variables, and 8407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3648 ms.
Refiners :[Domain max(s): 4003/4003 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 4003/4003 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/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2854/2890 variables, 285/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2890 variables, 2854/3175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 12:26:32] [INFO ] Deduced a trap composed of 53 places in 1228 ms of which 128 ms to minimize.
[2024-05-30 12:26:33] [INFO ] Deduced a trap composed of 48 places in 1075 ms of which 13 ms to minimize.
[2024-05-30 12:26:34] [INFO ] Deduced a trap composed of 67 places in 918 ms of which 14 ms to minimize.
[2024-05-30 12:26:35] [INFO ] Deduced a trap composed of 74 places in 986 ms of which 12 ms to minimize.
SMT process timed out in 8979ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 4003 transition count 4115
Reduce places removed 388 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 389 rules applied. Total rules applied 777 place count 3615 transition count 4114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 778 place count 3614 transition count 4114
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 497 Pre rules applied. Total rules applied 778 place count 3614 transition count 3617
Deduced a syphon composed of 497 places in 10 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 1772 place count 3117 transition count 3617
Discarding 688 places :
Symmetric choice reduction at 3 with 688 rule applications. Total rules 2460 place count 2429 transition count 2929
Iterating global reduction 3 with 688 rules applied. Total rules applied 3148 place count 2429 transition count 2929
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 3148 place count 2429 transition count 2645
Deduced a syphon composed of 284 places in 7 ms
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 3 with 568 rules applied. Total rules applied 3716 place count 2145 transition count 2645
Performed 694 Post agglomeration using F-continuation condition.Transition count delta: 694
Deduced a syphon composed of 694 places in 17 ms
Reduce places removed 694 places and 0 transitions.
Iterating global reduction 3 with 1388 rules applied. Total rules applied 5104 place count 1451 transition count 1951
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions (Partial Free agglomeration) removed 201 transitions
Iterating global reduction 3 with 201 rules applied. Total rules applied 5305 place count 1451 transition count 1951
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5306 place count 1450 transition count 1950
Applied a total of 5306 rules in 1381 ms. Remains 1450 /4003 variables (removed 2553) and now considering 1950/4503 (removed 2553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1391 ms. Remains : 1450/4003 places, 1950/4503 transitions.
RANDOM walk for 40000 steps (32 resets) in 778 ms. (51 steps per ms) remains 1/4 properties
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
// Phase 1: matrix 1950 rows 1450 cols
[2024-05-30 12:26:37] [INFO ] Computed 401 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1023 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1041 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1443/2484 variables, 1041/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2484 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 283/2767 variables, 98/1424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2767 variables, 19/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2767 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/2791 variables, 12/1455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2791 variables, 18/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2791 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/2793 variables, 1/1474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2793 variables, 2/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2793 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 238/3031 variables, 105/1581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3031 variables, 26/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3031 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/3045 variables, 7/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3045 variables, 14/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3045 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 156/3201 variables, 70/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3201 variables, 19/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3201 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/3209 variables, 4/1721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3209 variables, 8/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3209 variables, 0/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 104/3313 variables, 46/1775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3313 variables, 12/1787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3313 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 6/3319 variables, 3/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3319 variables, 6/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3319 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 60/3379 variables, 26/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3379 variables, 7/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3379 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 4/3383 variables, 2/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3383 variables, 4/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3383 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 17/3400 variables, 12/1847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3400 variables, 4/1851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3400 variables, 0/1851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/3400 variables, 0/1851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3400/3400 variables, and 1851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1291 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1450/1450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1023 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:38] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 69
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :69 after 250
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :250 after 1.7328e+10
Invariant property ShieldRVs-PT-100B-ReachabilityCardinality-2024-04 does not hold.
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.7328e+10 after 4.17975e+27
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-30 12:26:39] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:26:40] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1041 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:41] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1443/2484 variables, 1041/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:42] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 3 ms to minimize.
[2024-05-30 12:26:42] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 8 ms to minimize.
[2024-05-30 12:26:42] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 4 ms to minimize.
[2024-05-30 12:26:43] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-30 12:26:43] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-30 12:26:43] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-30 12:26:43] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 4 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-30 12:26:44] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:26:45] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-30 12:26:45] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 3 ms to minimize.
[2024-05-30 12:26:45] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:26:45] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:26:45] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2484 variables, 20/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-30 12:26:46] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 10 ms to minimize.
[2024-05-30 12:26:47] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2484 variables, 5/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2484 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 283/2767 variables, 98/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2767 variables, 19/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2767 variables, 1/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:47] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 12:26:48] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-30 12:26:48] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-30 12:26:48] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:26:48] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-30 12:26:48] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 2 ms to minimize.
[2024-05-30 12:26:49] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-30 12:26:49] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-30 12:26:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:26:49] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-30 12:26:49] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2024-05-30 12:26:50] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-30 12:26:50] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 12:26:50] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:26:50] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:26:51] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 2 ms to minimize.
[2024-05-30 12:26:51] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:26:51] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:26:51] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:26:51] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2767 variables, 20/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:52] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 3 ms to minimize.
[2024-05-30 12:26:52] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-30 12:26:52] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:26:52] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-30 12:26:52] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-05-30 12:26:53] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-30 12:26:53] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-30 12:26:53] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-30 12:26:53] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2024-05-30 12:26:53] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-30 12:26:54] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 2 ms to minimize.
[2024-05-30 12:26:54] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2024-05-30 12:26:54] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 2 ms to minimize.
[2024-05-30 12:26:54] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-30 12:26:55] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2024-05-30 12:26:55] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2024-05-30 12:26:55] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-30 12:26:55] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2024-05-30 12:26:55] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:26:56] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2767 variables, 20/1537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:26:56] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-05-30 12:26:56] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:26:56] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:26:56] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-30 12:26:57] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:26:58] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2024-05-30 12:26:58] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-30 12:26:58] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 2 ms to minimize.
[2024-05-30 12:27:02] [INFO ] Deduced a trap composed of 16 places in 3760 ms of which 2 ms to minimize.
[2024-05-30 12:27:02] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-05-30 12:27:02] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:27:02] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-30 12:27:03] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-30 12:27:03] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:27:03] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2767 variables, 20/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:03] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-05-30 12:27:03] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2024-05-30 12:27:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:05] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-30 12:27:05] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:27:05] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:05] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:27:05] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:27:06] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2767 variables, 20/1577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:07] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:27:07] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2024-05-30 12:27:07] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:27:07] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:27:07] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 3 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-05-30 12:27:08] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:09] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:27:10] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:27:10] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2767 variables, 20/1597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:10] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-30 12:27:10] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:10] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-30 12:27:11] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:12] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2767 variables, 20/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-30 12:27:13] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:14] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:27:15] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2767 variables, 20/1637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:27:16] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-30 12:27:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-30 12:27:18] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2767 variables, 20/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:19] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:27:20] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 3 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2767 variables, 20/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:21] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:27:22] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:27:22] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:27:22] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:27:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:27:22] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2767 variables, 6/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2767 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 24/2791 variables, 12/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2791 variables, 18/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2791 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/2793 variables, 1/1714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2793 variables, 2/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2793 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 238/3031 variables, 105/1821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3031 variables, 26/1847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:23] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 12:27:23] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 12:27:23] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3031/3400 variables, and 1850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 343/401 constraints, State Equation: 1264/1450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 242/242 constraints]
After SMT, in 46335ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1450/1450 places, 1950/1950 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 1450 transition count 1946
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1446 transition count 1946
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 1446 transition count 1943
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1443 transition count 1943
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 34 place count 1433 transition count 1933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1432 transition count 1932
Applied a total of 35 rules in 262 ms. Remains 1432 /1450 variables (removed 18) and now considering 1932/1950 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 1432/1450 places, 1932/1950 transitions.
RANDOM walk for 40000 steps (32 resets) in 707 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 110593 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 110593 steps, saw 58682 distinct states, run finished after 3005 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1932 rows 1432 cols
[2024-05-30 12:27:27] [INFO ] Computed 401 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 988/1011 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1011 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1029 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1431/2460 variables, 1029/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2460 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 280/2740 variables, 98/1412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2740 variables, 22/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2740 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/2758 variables, 9/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2758 variables, 18/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2758 variables, 0/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 237/2995 variables, 101/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2995 variables, 27/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2995 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/3009 variables, 7/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3009 variables, 14/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3009 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 156/3165 variables, 70/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3165 variables, 19/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3165 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/3173 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3173 variables, 8/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3173 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 104/3277 variables, 46/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3277 variables, 12/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3277 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/3283 variables, 3/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3283 variables, 6/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3283 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 60/3343 variables, 26/1804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3343 variables, 7/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3343 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/3347 variables, 2/1813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3347 variables, 4/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3347 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 17/3364 variables, 12/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3364 variables, 4/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3364 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/3364 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3364/3364 variables, and 1833 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1432/1432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 988/1011 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:28] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 3 ms to minimize.
[2024-05-30 12:27:28] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 12:27:29] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-05-30 12:27:29] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 3 ms to minimize.
[2024-05-30 12:27:29] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
[2024-05-30 12:27:29] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-30 12:27:29] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-30 12:27:30] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:27:30] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 4 ms to minimize.
[2024-05-30 12:27:30] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 6 ms to minimize.
[2024-05-30 12:27:30] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-05-30 12:27:30] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 4 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-05-30 12:27:31] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1011 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-30 12:27:32] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:27:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 12:27:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:27:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1011 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1029 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1431/2460 variables, 1029/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:34] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 3 ms to minimize.
[2024-05-30 12:27:34] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-30 12:27:35] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-30 12:27:35] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 4 ms to minimize.
[2024-05-30 12:27:35] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 2 ms to minimize.
[2024-05-30 12:27:35] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-30 12:27:35] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-05-30 12:27:36] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:27:36] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-30 12:27:36] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 12:27:36] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-30 12:27:36] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 3 ms to minimize.
[2024-05-30 12:27:37] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-05-30 12:27:37] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
[2024-05-30 12:27:37] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 12:27:37] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2460 variables, 20/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-05-30 12:27:38] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-05-30 12:27:39] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2024-05-30 12:27:39] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2024-05-30 12:27:39] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2460 variables, 5/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2460 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 280/2740 variables, 98/1477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2740 variables, 22/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2740 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:40] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 12:27:40] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:27:41] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 2 ms to minimize.
[2024-05-30 12:27:41] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 2 ms to minimize.
[2024-05-30 12:27:41] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 3 ms to minimize.
[2024-05-30 12:27:41] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-30 12:27:42] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 3 ms to minimize.
[2024-05-30 12:27:42] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-30 12:27:42] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-05-30 12:27:42] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:27:42] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-30 12:27:43] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-05-30 12:27:43] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 2 ms to minimize.
[2024-05-30 12:27:43] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-30 12:27:43] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:27:44] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-05-30 12:27:44] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-05-30 12:27:44] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 2 ms to minimize.
[2024-05-30 12:27:44] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-30 12:27:44] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2740 variables, 20/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:45] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-30 12:27:45] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:27:45] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:27:45] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:27:45] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:27:46] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-30 12:27:46] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-05-30 12:27:46] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-05-30 12:27:46] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-05-30 12:27:46] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:27:47] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:27:47] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-30 12:27:47] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:27:47] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2024-05-30 12:27:48] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:27:48] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-30 12:27:48] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:27:48] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:27:48] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:27:49] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2740 variables, 20/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:49] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:27:49] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-30 12:27:49] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2024-05-30 12:27:50] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:27:50] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:27:50] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-30 12:27:50] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2024-05-30 12:27:50] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2024-05-30 12:27:51] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-05-30 12:27:51] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2024-05-30 12:27:51] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:27:51] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:27:51] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 5 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:27:52] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-30 12:27:53] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2740 variables, 20/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:53] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:27:53] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-05-30 12:27:53] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:27:53] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:27:54] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-30 12:27:55] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-30 12:27:56] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:27:56] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 12:27:56] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-30 12:27:56] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2740 variables, 20/1580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:27:56] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:27:57] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:27:58] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:27:59] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2740 variables, 20/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 12:28:00] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-30 12:28:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:28:02] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2740 variables, 20/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:03] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2740 variables, 20/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:05] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-30 12:28:06] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:07] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2740 variables, 20/1660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:28:08] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:09] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:28:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2740 variables, 18/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2740 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/2758 variables, 9/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2758 variables, 18/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2758 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 237/2995 variables, 101/1806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2995 variables, 27/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 12:28:11] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-30 12:28:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-30 12:28:11] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:28:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:28:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:28:12] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2995 variables, 8/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2995 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 14/3009 variables, 7/1848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3009 variables, 14/1862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3009 variables, 0/1862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 156/3165 variables, 70/1932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3165 variables, 19/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:12] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/3165 variables, 1/1952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3165 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 8/3173 variables, 4/1956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3173 variables, 8/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3173 variables, 0/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 104/3277 variables, 46/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3277 variables, 12/2022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:13] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/3277 variables, 1/2023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3277 variables, 0/2023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 6/3283 variables, 3/2026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3283 variables, 6/2032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:13] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/3283 variables, 1/2033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3283 variables, 0/2033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 60/3343 variables, 26/2059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3343 variables, 7/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3343 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/3347 variables, 2/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3347 variables, 4/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:14] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/3347 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:14] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:28:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/3347 variables, 2/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:28:15] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:28:15] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-30 12:28:15] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/3347 variables, 3/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3347 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 17/3364 variables, 12/2090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3364 variables, 4/2094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/3364 variables, 0/2094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 0/3364 variables, 0/2094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3364/3364 variables, and 2094 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47610 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1432/1432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 260/260 constraints]
After SMT, in 48825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1375 ms.
Support contains 23 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 1932/1932 transitions.
Applied a total of 0 rules in 84 ms. Remains 1432 /1432 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1432/1432 places, 1932/1932 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 1932/1932 transitions.
Applied a total of 0 rules in 61 ms. Remains 1432 /1432 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2024-05-30 12:28:17] [INFO ] Invariant cache hit.
[2024-05-30 12:28:18] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-30 12:28:18] [INFO ] Invariant cache hit.
[2024-05-30 12:28:19] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2024-05-30 12:28:19] [INFO ] Redundant transitions in 272 ms returned []
Running 1926 sub problems to find dead transitions.
[2024-05-30 12:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1427/3364 variables, and 118 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 118/401 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-05-30 12:28:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 12:28:59] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:29:00] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:29:01] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1427 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:29:08] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:29:09] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-30 12:29:10] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:29:10] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:29:10] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:29:10] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:29:10] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1427 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:29:18] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:29:19] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-30 12:29:19] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-30 12:29:19] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-30 12:29:19] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-30 12:29:19] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:29:20] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1427 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-05-30 12:29:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
SMT process timed out in 61276ms, After SMT, problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 61297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63891 ms. Remains : 1432/1432 places, 1932/1932 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 12:29:21] [INFO ] Flatten gal took : 150 ms
[2024-05-30 12:29:21] [INFO ] Applying decomposition
[2024-05-30 12:29:21] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5521945687591476599.txt' '-o' '/tmp/graph5521945687591476599.bin' '-w' '/tmp/graph5521945687591476599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5521945687591476599.bin' '-l' '-1' '-v' '-w' '/tmp/graph5521945687591476599.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:29:22] [INFO ] Decomposing Gal with order
[2024-05-30 12:29:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:29:23] [INFO ] Removed a total of 3591 redundant transitions.
[2024-05-30 12:29:23] [INFO ] Flatten gal took : 310 ms
[2024-05-30 12:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2024-05-30 12:29:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17826791276325613869.gal : 41 ms
[2024-05-30 12:29:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality836259581171906606.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17826791276325613869.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality836259581171906606.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality836259581171906606.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 45325
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :45325 after 111877
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :111877 after 2.32476e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.07048e+11 after 4.75764e+52
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.14227e+220 after 1.14227e+220
ITS-tools command line returned an error code 137
[2024-05-30 12:42:38] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12810439941464864959
[2024-05-30 12:42:38] [INFO ] Too many transitions (1932) to apply POR reductions. Disabling POR matrices.
[2024-05-30 12:42:38] [INFO ] Applying decomposition
[2024-05-30 12:42:38] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12810439941464864959
Running compilation step : cd /tmp/ltsmin12810439941464864959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 12:42:38] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17729937270217054500.txt' '-o' '/tmp/graph17729937270217054500.bin' '-w' '/tmp/graph17729937270217054500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17729937270217054500.bin' '-l' '-1' '-v' '-w' '/tmp/graph17729937270217054500.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:42:38] [INFO ] Decomposing Gal with order
[2024-05-30 12:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:42:38] [INFO ] Removed a total of 2222 redundant transitions.
[2024-05-30 12:42:39] [INFO ] Flatten gal took : 101 ms
[2024-05-30 12:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2387 labels/synchronizations in 112 ms.
[2024-05-30 12:42:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5450940278878821587.gal : 13 ms
[2024-05-30 12:42:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2727851406930478122.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5450940278878821587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2727851406930478122.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2727851406930478122.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3 after 245
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :245 after 245
Compilation finished in 5449 ms.
Running link step : cd /tmp/ltsmin12810439941464864959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12810439941464864959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityCardinality202303==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :245 after 104984
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.34718e+10 after 3.34718e+10
Detected timeout of ITS tools.
[2024-05-30 13:08:04] [INFO ] Applying decomposition
[2024-05-30 13:08:04] [INFO ] Flatten gal took : 212 ms
[2024-05-30 13:08:04] [INFO ] Decomposing Gal with order
[2024-05-30 13:08:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:08:05] [INFO ] Removed a total of 2296 redundant transitions.
[2024-05-30 13:08:05] [INFO ] Flatten gal took : 246 ms
[2024-05-30 13:08:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 3497 labels/synchronizations in 449 ms.
[2024-05-30 13:08:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality217485878631555390.gal : 118 ms
[2024-05-30 13:08:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11367876862425184086.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality217485878631555390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11367876862425184086.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality11367876862425184086.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 83
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.36214e+07 after 4.49122e+08

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762000878"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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