About the Execution of GreatSPN+red for ShieldRVs-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1804.520 | 108937.00 | 209834.00 | 323.20 | TTFTFTFTFFFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759700862.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-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700862
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 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 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 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 625K 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-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2023-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717066281176
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-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:51:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 10:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:51:22] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-30 10:51:22] [INFO ] Transformed 2003 places.
[2024-05-30 10:51:22] [INFO ] Transformed 2253 transitions.
[2024-05-30 10:51:22] [INFO ] Found NUPN structural information;
[2024-05-30 10:51:22] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 1570 ms. (25 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 498 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
// Phase 1: matrix 2253 rows 2003 cols
[2024-05-30 10:51:23] [INFO ] Computed 201 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1202/1253 variables, 118/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1202/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 750/2003 variables, 83/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 750/2204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2253/4256 variables, 2003/4207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4256/4256 variables, and 4207 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2109 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2003/2003 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/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1202/1253 variables, 118/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1202/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 10:51:26] [INFO ] Deduced a trap composed of 30 places in 448 ms of which 53 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 28 places in 443 ms of which 17 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 6 ms to minimize.
[2024-05-30 10:51:27] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 5 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 5 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 53 places in 269 ms of which 5 ms to minimize.
[2024-05-30 10:51:28] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 5 ms to minimize.
[2024-05-30 10:51:29] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 5 ms to minimize.
[2024-05-30 10:51:29] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 4 ms to minimize.
[2024-05-30 10:51:29] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 5 ms to minimize.
[2024-05-30 10:51:30] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 4 ms to minimize.
[2024-05-30 10:51:30] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 5 ms to minimize.
[2024-05-30 10:51:30] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 4 ms to minimize.
[2024-05-30 10:51:30] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 5 ms to minimize.
[2024-05-30 10:51:31] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 7414ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 2003 transition count 2065
Reduce places removed 188 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 192 rules applied. Total rules applied 380 place count 1815 transition count 2061
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 384 place count 1811 transition count 2061
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 384 place count 1811 transition count 1813
Deduced a syphon composed of 248 places in 10 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 880 place count 1563 transition count 1813
Discarding 326 places :
Symmetric choice reduction at 3 with 326 rule applications. Total rules 1206 place count 1237 transition count 1487
Iterating global reduction 3 with 326 rules applied. Total rules applied 1532 place count 1237 transition count 1487
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 1532 place count 1237 transition count 1352
Deduced a syphon composed of 135 places in 6 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1802 place count 1102 transition count 1352
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 5 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 3 with 688 rules applied. Total rules applied 2490 place count 758 transition count 1008
Partial Free-agglomeration rule applied 98 times.
Drop transitions (Partial Free agglomeration) removed 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 2588 place count 758 transition count 1008
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2589 place count 757 transition count 1007
Applied a total of 2589 rules in 596 ms. Remains 757 /2003 variables (removed 1246) and now considering 1007/2253 (removed 1246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 757/2003 places, 1007/2253 transitions.
RANDOM walk for 40000 steps (60 resets) in 519 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1007 rows 757 cols
[2024-05-30 10:51:32] [INFO ] Computed 201 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/101 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem ShieldRVs-PT-050B-ReachabilityCardinality-2024-09 is UNSAT
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 299/400 variables, 82/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:51:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 3 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:51:33] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 16/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 591/991 variables, 400/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:34] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:51:34] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:51:34] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 3/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 324/1315 variables, 124/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1315 variables, 25/674 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1315 variables, 0/674 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/1336 variables, 12/686 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 17/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1336 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1344 variables, 3/706 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1344 variables, 5/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1344 variables, 0/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 191/1535 variables, 98/809 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1535 variables, 23/832 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1535 variables, 0/832 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/1544 variables, 5/837 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1544 variables, 9/846 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1544 variables, 0/846 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 95/1639 variables, 38/884 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1639 variables, 10/894 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1639 variables, 0/894 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1645 variables, 3/897 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1645 variables, 6/903 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1645 variables, 0/903 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 89/1734 variables, 36/939 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1734 variables, 6/945 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1734 variables, 0/945 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/1744 variables, 6/951 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1744 variables, 8/959 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1744 variables, 0/959 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1746 variables, 1/960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1746 variables, 1/961 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1746 variables, 0/961 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 18/1764 variables, 15/976 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1764 variables, 4/980 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1764 variables, 0/980 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1764 variables, 0/980 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1764/1764 variables, and 980 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 757/757 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/28 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 330/358 variables, 90/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 20/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:34] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 8/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 518/876 variables, 358/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:51:35] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/876 variables, 8/489 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/876 variables, 0/489 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 248/1124 variables, 88/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 14/591 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 1/592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 21 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1124 variables, 3/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/1145 variables, 12/607 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1145 variables, 17/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1145 variables, 1/625 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1145 variables, 0/625 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1153 variables, 3/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1153 variables, 5/633 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1153 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 179/1332 variables, 88/721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1332 variables, 19/740 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1332 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/1344 variables, 6/746 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1344 variables, 10/756 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1344 variables, 0/756 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/1346 variables, 1/757 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1346 variables, 2/759 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1346 variables, 2/761 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1346 variables, 0/761 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 60/1406 variables, 30/791 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1406 variables, 7/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1406 variables, 0/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 4/1410 variables, 2/800 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1410 variables, 2/802 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:51:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1410 variables, 2/804 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1410 variables, 0/804 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 35/1445 variables, 16/820 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1445 variables, 3/823 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:37] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1445 variables, 1/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1445 variables, 0/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 3/1448 variables, 2/826 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1448 variables, 3/829 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1448 variables, 0/829 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 31/1479 variables, 12/841 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1479 variables, 3/844 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1479 variables, 0/844 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 2/1481 variables, 1/845 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1481 variables, 2/847 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1481 variables, 0/847 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 32/1513 variables, 12/859 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1513 variables, 3/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1513 variables, 0/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 3/1516 variables, 1/863 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1516 variables, 3/866 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1516 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 31/1547 variables, 12/878 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1547 variables, 3/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1547 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/1549 variables, 1/882 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1549 variables, 2/884 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 10:51:37] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:51:37] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:51:37] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:51:37] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/1549 variables, 4/888 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1549 variables, 0/888 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 33/1582 variables, 12/900 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1582 variables, 2/902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1582 variables, 0/902 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/1586 variables, 2/904 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1586 variables, 4/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1586 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 34/1620 variables, 12/920 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1620 variables, 2/922 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1620 variables, 0/922 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 6/1626 variables, 2/924 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1626 variables, 4/928 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1626 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 33/1659 variables, 14/942 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1659 variables, 3/945 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1659 variables, 0/945 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/1662 variables, 1/946 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1662 variables, 3/949 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1662 variables, 0/949 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 31/1693 variables, 12/961 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1693 variables, 3/964 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1693 variables, 0/964 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/1695 variables, 1/965 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1695 variables, 2/967 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1695 variables, 0/967 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 31/1726 variables, 12/979 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1726 variables, 3/982 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1726 variables, 0/982 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 2/1728 variables, 1/983 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1728 variables, 2/985 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1728 variables, 0/985 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 29/1757 variables, 12/997 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1757 variables, 2/999 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1757 variables, 0/999 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1761 variables, 2/1001 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1761 variables, 2/1003 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1761 variables, 0/1003 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 2/1763 variables, 1/1004 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1763 variables, 1/1005 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1763 variables, 0/1005 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 1/1764 variables, 3/1008 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1764 variables, 0/1008 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/1764 variables, 0/1008 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1764/1764 variables, and 1008 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3606 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 757/757 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 49/49 constraints]
After SMT, in 6233ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 5 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 1007/1007 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 757 transition count 1000
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 750 transition count 1000
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 750 transition count 998
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 748 transition count 998
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 86 place count 714 transition count 964
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 714 transition count 964
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 707 transition count 957
Applied a total of 97 rules in 214 ms. Remains 707 /757 variables (removed 50) and now considering 957/1007 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 707/757 places, 957/1007 transitions.
RANDOM walk for 40000 steps (65 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 515328 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 515328 steps, saw 506316 distinct states, run finished after 3005 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 957 rows 707 cols
[2024-05-30 10:51:41] [INFO ] Computed 201 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/121 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 271/392 variables, 98/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/402 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 236/638 variables, 106/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/650 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/650 variables, 12/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/650 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 151/801 variables, 64/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/801 variables, 17/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/809 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 8/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/809 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 126/935 variables, 50/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/935 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/935 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/935 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 8/943 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/943 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/943 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 104/1047 variables, 46/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1047 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1047 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 6/1053 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1053 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1053 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 64/1117 variables, 26/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1117 variables, 7/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:51:42] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1117 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1117 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/1121 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1121 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1121 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 62/1183 variables, 24/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1183 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1183 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 4/1187 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1187 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1187 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 62/1249 variables, 24/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1249 variables, 6/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1249 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/1253 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1253 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1253 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 62/1315 variables, 24/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1315 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1315 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 4/1319 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1319 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1319 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 62/1381 variables, 24/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1381 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1381 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 4/1385 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1385 variables, 4/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1385 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 62/1447 variables, 24/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1447 variables, 6/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1447 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 4/1451 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1451 variables, 4/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1451 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 62/1513 variables, 24/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1513 variables, 6/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:43] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1513 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1513 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/1517 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1517 variables, 4/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1517 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 57/1574 variables, 23/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1574 variables, 6/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1574 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1578 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1578 variables, 4/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1578 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 33/1611 variables, 14/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1611 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1611 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 2/1613 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1613 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1613 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 31/1644 variables, 12/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1644 variables, 3/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
At refinement iteration 97 (INCLUDED_ONLY) 0/1644 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1644 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1646 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1646 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1646 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 18/1664 variables, 12/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1664 variables, 4/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1664 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 0/1664 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1664/1664 variables, and 915 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2261 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/121 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 271/392 variables, 98/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/402 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 10/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 236/638 variables, 106/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/638 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/638 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/650 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/650 variables, 12/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/650 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 151/801 variables, 64/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/801 variables, 17/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/801 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 8/809 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/809 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 126/935 variables, 50/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/935 variables, 13/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/935 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/935 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 8/943 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/943 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/943 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 104/1047 variables, 46/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1047 variables, 12/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1047 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1047 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 6/1053 variables, 3/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1053 variables, 6/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1053 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 64/1117 variables, 26/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1117 variables, 7/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:44] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1117 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1117 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/1121 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1121 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1121 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 62/1183 variables, 24/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1183 variables, 6/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1183 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/1187 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1187 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1187 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 62/1249 variables, 24/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1249 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1249 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 4/1253 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1253 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1253 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 62/1315 variables, 24/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1315 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1315 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 4/1319 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1319 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1319 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 62/1381 variables, 24/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1381 variables, 6/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1381 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1381 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 4/1385 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1385 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1385 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 62/1447 variables, 24/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1447 variables, 6/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1447 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1447 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 4/1451 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1451 variables, 4/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 62/1513 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1513 variables, 6/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1513 variables, 1/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 85 (INCLUDED_ONLY) 0/1513 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1513 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 4/1517 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1517 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1517 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 57/1574 variables, 23/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1574 variables, 6/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 92 (INCLUDED_ONLY) 0/1574 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1574 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1578 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1578 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1578 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 33/1611 variables, 14/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1611 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:45] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
At refinement iteration 99 (INCLUDED_ONLY) 0/1611 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1611 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 2/1613 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1613 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1613 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 31/1644 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1644 variables, 3/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1644 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:51:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1644 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1644 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 2/1646 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1646 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1646 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 18/1664 variables, 12/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1664 variables, 4/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1664 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 0/1664 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1664/1664 variables, and 926 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 4320ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 160 ms.
Support contains 5 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 25 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 707/707 places, 957/957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 23 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
[2024-05-30 10:51:46] [INFO ] Invariant cache hit.
[2024-05-30 10:51:46] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-30 10:51:46] [INFO ] Invariant cache hit.
[2024-05-30 10:51:47] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-30 10:51:47] [INFO ] Redundant transitions in 127 ms returned []
Running 954 sub problems to find dead transitions.
[2024-05-30 10:51:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:51:58] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:51:59] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:00] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:01] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:03] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:13] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-30 10:52:13] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:52:13] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:52:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:52:13] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:14] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:15] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:52:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:52:17] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 10:52:18] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 705/1664 variables, and 297 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 197/201 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 100/297 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:52:19] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:52:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:52:20] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 6 ms to minimize.
[2024-05-30 10:52:21] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:52:22] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:52:23] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:52:24] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:52:25] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:26] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 2 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 2 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-05-30 10:52:27] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:52:28] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:52:29] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:52:30] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:52:31] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 4 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:52:32] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:52:33] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:33] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:52:34] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:52:35] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:52:36] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:52:37] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:52:38] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:52:39] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:52:40] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:52:41] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:52:42] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:52:43] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:52:44] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-30 10:52:45] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2024-05-30 10:52:46] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-30 10:52:47] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:52:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/1664 variables, and 477 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 197/201 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 280/280 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61846 ms. Remains : 707/707 places, 957/957 transitions.
[2024-05-30 10:52:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-30 10:52:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 707 places, 957 transitions and 4614 arcs took 11 ms.
[2024-05-30 10:52:48] [INFO ] Flatten gal took : 124 ms
Total runtime 86379 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVs-PT-050B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 707
TRANSITIONS: 957
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.001s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1660
MODEL NAME: /home/mcc/execution/408/model
707 places, 957 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-2023-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717066390113
--------------------
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
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-050B"
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-050B, 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-171683759700862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 '
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 ;