Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759700878.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700878
=====================================================================

--------------------
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 1717071078984

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:11:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 12:11:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:11:20] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2024-05-30 12:11:20] [INFO ] Transformed 4003 places.
[2024-05-30 12:11:20] [INFO ] Transformed 4503 transitions.
[2024-05-30 12:11:20] [INFO ] Found NUPN structural information;
[2024-05-30 12:11:20] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 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 1914 ms. (20 steps per ms) remains 3/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-04 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 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
// Phase 1: matrix 4503 rows 4003 cols
[2024-05-30 12:11:21] [INFO ] Computed 401 invariants in 59 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2858/2890 variables, 285/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2890 variables, 2858/3175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2890 variables, 0/3175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1113/4003 variables, 116/3291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4003 variables, 1113/4404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4003 variables, 0/4404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4503/8506 variables, 4003/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8506/8506 variables, and 8407 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3389 ms.
Refiners :[Domain max(s): 4003/4003 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 4003/4003 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2858/2890 variables, 285/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2890 variables, 2858/3175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 12:11:27] [INFO ] Deduced a trap composed of 29 places in 1109 ms of which 123 ms to minimize.
[2024-05-30 12:11:28] [INFO ] Deduced a trap composed of 27 places in 1007 ms of which 14 ms to minimize.
[2024-05-30 12:11:29] [INFO ] Deduced a trap composed of 63 places in 954 ms of which 14 ms to minimize.
[2024-05-30 12:11:30] [INFO ] Deduced a trap composed of 58 places in 942 ms of which 13 ms to minimize.
[2024-05-30 12:11:31] [INFO ] Deduced a trap composed of 55 places in 991 ms of which 14 ms to minimize.
SMT process timed out in 9724ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 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 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 4003 transition count 4112
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 3612 transition count 4112
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 496 Pre rules applied. Total rules applied 782 place count 3612 transition count 3616
Deduced a syphon composed of 496 places in 14 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1774 place count 3116 transition count 3616
Discarding 691 places :
Symmetric choice reduction at 2 with 691 rule applications. Total rules 2465 place count 2425 transition count 2925
Iterating global reduction 2 with 691 rules applied. Total rules applied 3156 place count 2425 transition count 2925
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 3156 place count 2425 transition count 2638
Deduced a syphon composed of 287 places in 8 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 3730 place count 2138 transition count 2638
Performed 694 Post agglomeration using F-continuation condition.Transition count delta: 694
Deduced a syphon composed of 694 places in 6 ms
Reduce places removed 694 places and 0 transitions.
Iterating global reduction 2 with 1388 rules applied. Total rules applied 5118 place count 1444 transition count 1944
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 2 with 201 rules applied. Total rules applied 5319 place count 1444 transition count 1944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5320 place count 1443 transition count 1943
Applied a total of 5320 rules in 1615 ms. Remains 1443 /4003 variables (removed 2560) and now considering 1943/4503 (removed 2560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1632 ms. Remains : 1443/4003 places, 1943/4503 transitions.
RANDOM walk for 40000 steps (32 resets) in 745 ms. (53 steps per ms) remains 1/3 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
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
// Phase 1: matrix 1943 rows 1443 cols
[2024-05-30 12:11:33] [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) 993/1016 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1016 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1034 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1436/2470 variables, 1034/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2470 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 283/2753 variables, 98/1417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2753 variables, 19/1436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2753 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/2777 variables, 12/1448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2777 variables, 18/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2777 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/2779 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2779 variables, 2/1469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2779 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 238/3017 variables, 105/1574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3017 variables, 26/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3017 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/3031 variables, 7/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3031 variables, 14/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3031 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 156/3187 variables, 70/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3187 variables, 19/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3187 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/3195 variables, 4/1714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3195 variables, 8/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3195 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 104/3299 variables, 46/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3299 variables, 12/1780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3299 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 6/3305 variables, 3/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3305 variables, 6/1789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3305 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 60/3365 variables, 26/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3365 variables, 7/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3365 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 4/3369 variables, 2/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3369 variables, 4/1828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3369 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 17/3386 variables, 12/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3386 variables, 4/1844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3386 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/3386 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3386/3386 variables, and 1844 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1443/1443 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) 993/1016 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:34] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 3 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 2 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-05-30 12:11:35] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-30 12:11:36] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 6 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1016 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:37] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 12:11:38] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1016 variables, 16/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1034 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1436/2470 variables, 1034/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:39] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-30 12:11:40] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:11:41] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-05-30 12:11:41] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-05-30 12:11:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-30 12:11:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:11:41] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:11:42] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:11:42] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-30 12:11:42] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2470 variables, 15/1370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2470 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 283/2753 variables, 98/1468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2753 variables, 19/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2753 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:43] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 3 ms to minimize.
[2024-05-30 12:11:43] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 4 ms to minimize.
[2024-05-30 12:11:43] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 4 ms to minimize.
[2024-05-30 12:11:43] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 3 ms to minimize.
[2024-05-30 12:11:44] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 3 ms to minimize.
[2024-05-30 12:11:44] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 4 ms to minimize.
[2024-05-30 12:11:44] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-05-30 12:11:45] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 4 ms to minimize.
[2024-05-30 12:11:45] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-05-30 12:11:45] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 4 ms to minimize.
[2024-05-30 12:11:45] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 3 ms to minimize.
[2024-05-30 12:11:46] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-05-30 12:11:46] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 3 ms to minimize.
[2024-05-30 12:11:46] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 3 ms to minimize.
[2024-05-30 12:11:47] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 3 ms to minimize.
[2024-05-30 12:11:47] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
[2024-05-30 12:11:47] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2024-05-30 12:11:48] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 4 ms to minimize.
[2024-05-30 12:11:48] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 3 ms to minimize.
[2024-05-30 12:11:48] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2753 variables, 20/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:48] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2024-05-30 12:11:49] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 3 ms to minimize.
[2024-05-30 12:11:49] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 3 ms to minimize.
[2024-05-30 12:11:49] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 3 ms to minimize.
[2024-05-30 12:11:49] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-30 12:11:50] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-30 12:11:50] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-30 12:11:50] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-05-30 12:11:50] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-30 12:11:51] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-05-30 12:11:51] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-30 12:11:51] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-30 12:11:51] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 3 ms to minimize.
[2024-05-30 12:11:52] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-05-30 12:11:52] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:11:52] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 12:11:52] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-30 12:11:52] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 2 ms to minimize.
[2024-05-30 12:11:53] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-30 12:11:53] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2753 variables, 20/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:53] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-05-30 12:11:53] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-05-30 12:11:53] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-30 12:11:54] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:11:54] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-30 12:11:54] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 2 ms to minimize.
[2024-05-30 12:11:54] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-05-30 12:11:55] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 3 ms to minimize.
[2024-05-30 12:11:55] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 2 ms to minimize.
[2024-05-30 12:11:55] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-30 12:11:55] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 3 ms to minimize.
[2024-05-30 12:11:56] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-05-30 12:11:56] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-30 12:11:56] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:11:56] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-30 12:11:56] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 2 ms to minimize.
[2024-05-30 12:11:57] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:11:57] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:11:57] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-05-30 12:11:57] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2753 variables, 20/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:11:57] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-30 12:11:58] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-30 12:11:58] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-30 12:11:58] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-30 12:11:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-30 12:11:58] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 4 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-30 12:11:59] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-30 12:12:00] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:12:00] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-05-30 12:12:00] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-30 12:12:00] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:12:01] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:12:01] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-30 12:12:01] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-30 12:12:01] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2753 variables, 20/1568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:01] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:12:02] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-30 12:12:02] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-30 12:12:02] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:02] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-05-30 12:12:02] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-30 12:12:03] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-05-30 12:12:04] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:04] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:04] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:12:04] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-30 12:12:04] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 3 ms to minimize.
[2024-05-30 12:12:05] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-30 12:12:05] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-30 12:12:05] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2753 variables, 20/1588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:05] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:12:06] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-30 12:12:06] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2753 variables, 3/1591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:06] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-30 12:12:06] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-30 12:12:06] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-30 12:12:07] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-05-30 12:12:07] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2753 variables, 5/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:07] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-30 12:12:07] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-30 12:12:07] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2753 variables, 3/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2753 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/2777 variables, 12/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2777 variables, 18/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2777 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/2779 variables, 1/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2779 variables, 2/1632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2779 variables, 0/1632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 238/3017 variables, 105/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3017 variables, 26/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:08] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-30 12:12:08] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/3017 variables, 2/1765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3017 variables, 0/1765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 14/3031 variables, 7/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3031 variables, 14/1786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3031 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 156/3187 variables, 70/1856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3187 variables, 19/1875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:09] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/3187 variables, 6/1881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3187 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/3195 variables, 4/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3195 variables, 8/1893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3195 variables, 0/1893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 104/3299 variables, 46/1939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3299 variables, 12/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3299 variables, 0/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 6/3305 variables, 3/1954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3305 variables, 6/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3305 variables, 0/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 60/3365 variables, 26/1986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3365 variables, 7/1993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3365 variables, 0/1993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/3369 variables, 2/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3369 variables, 4/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3369 variables, 0/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 17/3386 variables, 12/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3386 variables, 4/2015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3386 variables, 0/2015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 0/3386 variables, 0/2015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3386/3386 variables, and 2015 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36473 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1443/1443 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 170/170 constraints]
After SMT, in 37801ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1365 ms.
Support contains 23 out of 1443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1443/1443 places, 1943/1943 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1443 transition count 1940
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1440 transition count 1940
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1440 transition count 1937
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1437 transition count 1937
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 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 21 place count 1432 transition count 1932
Applied a total of 21 rules in 214 ms. Remains 1432 /1443 variables (removed 11) and now considering 1932/1943 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1432/1443 places, 1932/1943 transitions.
RANDOM walk for 40000 steps (32 resets) in 688 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 110372 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 110372 steps, saw 58476 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:12:16] [INFO ] Computed 401 invariants in 8 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 1421 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:12:17] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 12:12:18] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 2 ms to minimize.
[2024-05-30 12:12:18] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 3 ms to minimize.
[2024-05-30 12:12:18] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-30 12:12:18] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-30 12:12:18] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-30 12:12:19] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-30 12:12:20] [INFO ] Deduced a trap composed of 20 places in 107 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:12:20] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 12:12:21] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1011 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1029 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:22] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1431/2460 variables, 1029/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:23] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 3 ms to minimize.
[2024-05-30 12:12:23] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-05-30 12:12:23] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-05-30 12:12:23] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 12:12:23] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-30 12:12:24] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 12:12:24] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 12:12:24] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 12:12:24] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 2 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 3 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-30 12:12:25] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-30 12:12:26] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-30 12:12:26] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-05-30 12:12:26] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-30 12:12:26] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2460 variables, 19/1373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2460 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 280/2740 variables, 98/1471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2740 variables, 22/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2740 variables, 1/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:27] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 3 ms to minimize.
[2024-05-30 12:12:27] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 3 ms to minimize.
[2024-05-30 12:12:27] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 2 ms to minimize.
[2024-05-30 12:12:28] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 3 ms to minimize.
[2024-05-30 12:12:28] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 2 ms to minimize.
[2024-05-30 12:12:28] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-05-30 12:12:28] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2024-05-30 12:12:29] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 3 ms to minimize.
[2024-05-30 12:12:29] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-05-30 12:12:29] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-30 12:12:29] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-05-30 12:12:30] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 3 ms to minimize.
[2024-05-30 12:12:30] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 3 ms to minimize.
[2024-05-30 12:12:30] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 3 ms to minimize.
[2024-05-30 12:12:30] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-05-30 12:12:31] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2024-05-30 12:12:31] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-05-30 12:12:31] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
[2024-05-30 12:12:31] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-05-30 12:12:32] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2740 variables, 20/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:32] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-30 12:12:32] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-30 12:12:32] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-05-30 12:12:33] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-05-30 12:12:33] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:12:33] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-30 12:12:33] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:33] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-05-30 12:12:34] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:12:34] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-30 12:12:34] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-30 12:12:34] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-30 12:12:34] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-30 12:12:35] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-30 12:12:35] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:12:35] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:12:35] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-30 12:12:35] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2740 variables, 20/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:37] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-30 12:12:37] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-05-30 12:12:37] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:12:37] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:12:37] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-30 12:12:38] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-30 12:12:38] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-30 12:12:38] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-05-30 12:12:38] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-30 12:12:38] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
[2024-05-30 12:12:39] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-30 12:12:39] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-30 12:12:39] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-30 12:12:39] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2740 variables, 20/1554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-30 12:12:40] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-30 12:12:41] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2024-05-30 12:12:42] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2740 variables, 20/1574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:43] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-05-30 12:12:44] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-30 12:12:45] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:12:46] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2740 variables, 20/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-30 12:12:47] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:12:48] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2024-05-30 12:12:49] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-30 12:12:49] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-30 12:12:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-30 12:12:49] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-30 12:12:49] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2740 variables, 18/1612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2740 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/2758 variables, 9/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2758 variables, 18/1639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2758 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 237/2995 variables, 101/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2995 variables, 27/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:50] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2995 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2995 variables, 1/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2995 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 14/3009 variables, 7/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3009 variables, 14/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3009 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 156/3165 variables, 70/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3165 variables, 19/1879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:51] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/3165 variables, 1/1880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3165 variables, 0/1880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 8/3173 variables, 4/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3173 variables, 8/1892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3173 variables, 0/1892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 104/3277 variables, 46/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3277 variables, 12/1950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:51] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/3277 variables, 1/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3277 variables, 0/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/3283 variables, 3/1954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3283 variables, 6/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:51] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/3283 variables, 1/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:52] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/3283 variables, 1/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3283 variables, 0/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 60/3343 variables, 26/1988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3343 variables, 7/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3343 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/3347 variables, 2/1997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3347 variables, 4/2001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3347 variables, 0/2001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 17/3364 variables, 12/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3364 variables, 4/2017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 12:12:52] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/3364 variables, 1/2018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/3364 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 0/3364 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3364/3364 variables, and 2018 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35622 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1432/1432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 184/184 constraints]
After SMT, in 37081ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1183 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 64 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 64 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 52 ms. Remains 1432 /1432 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2024-05-30 12:12:54] [INFO ] Invariant cache hit.
[2024-05-30 12:12:55] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-30 12:12:55] [INFO ] Invariant cache hit.
[2024-05-30 12:12:57] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2024-05-30 12:12:57] [INFO ] Redundant transitions in 274 ms returned []
Running 1926 sub problems to find dead transitions.
[2024-05-30 12:12:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30046 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:13:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-30 12:13:36] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 12:13:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1427/3364 variables, and 126 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 118/401 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 8/8 constraints]
After SMT, in 61230ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 61251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64107 ms. Remains : 1432/1432 places, 1932/1932 transitions.
[2024-05-30 12:13:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-05-30 12:13:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1432 places, 1932 transitions and 9534 arcs took 19 ms.
[2024-05-30 12:13:59] [INFO ] Flatten gal took : 268 ms
Total runtime 158966 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-100B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1691
MODEL NAME: /home/mcc/execution/411/model
1432 places, 1932 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-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 r355-tall-171683759700878"
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 ;