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

About the Execution of GreatSPN+red for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12897.212 3600000.00 14005545.00 465.00 FTTTTF??F?T?TTFF 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-171683758900510.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 ShieldPPPs-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-171683758900510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716994415160

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 14:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 14:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:53:36] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-29 14:53:36] [INFO ] Transformed 3403 places.
[2024-05-29 14:53:36] [INFO ] Transformed 3153 transitions.
[2024-05-29 14:53:36] [INFO ] Found NUPN structural information;
[2024-05-29 14:53:36] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2409 ms. (16 steps per ms) remains 6/15 properties
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 983 ms. (40 steps per ms) remains 6/6 properties
// Phase 1: matrix 3153 rows 3403 cols
[2024-05-29 14:53:38] [INFO ] Computed 551 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1649/1736 variables, 261/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1736 variables, 1649/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1736 variables, 0/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1667/3403 variables, 290/2287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3403 variables, 1667/3954 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3403 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3153/6556 variables, 3403/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6556 variables, 0/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/6556 variables, 0/7357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6556/6556 variables, and 7357 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3599 ms.
Refiners :[Domain max(s): 3403/3403 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3403/3403 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1649/1736 variables, 261/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1736 variables, 1649/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:53:43] [INFO ] Deduced a trap composed of 24 places in 452 ms of which 55 ms to minimize.
[2024-05-29 14:53:43] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 19 ms to minimize.
[2024-05-29 14:53:43] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 7 ms to minimize.
[2024-05-29 14:53:44] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 5 ms to minimize.
[2024-05-29 14:53:44] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 5 ms to minimize.
[2024-05-29 14:53:44] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 5 ms to minimize.
[2024-05-29 14:53:45] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 5 ms to minimize.
[2024-05-29 14:53:45] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 5 ms to minimize.
[2024-05-29 14:53:45] [INFO ] Deduced a trap composed of 53 places in 258 ms of which 5 ms to minimize.
[2024-05-29 14:53:45] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 4 ms to minimize.
[2024-05-29 14:53:46] [INFO ] Deduced a trap composed of 84 places in 222 ms of which 5 ms to minimize.
[2024-05-29 14:53:46] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 5 ms to minimize.
[2024-05-29 14:53:46] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 5 ms to minimize.
[2024-05-29 14:53:46] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 4 ms to minimize.
[2024-05-29 14:53:47] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 5 ms to minimize.
SMT process timed out in 8916ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 3403 transition count 2836
Reduce places removed 317 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 326 rules applied. Total rules applied 643 place count 3086 transition count 2827
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 652 place count 3077 transition count 2827
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 652 place count 3077 transition count 2572
Deduced a syphon composed of 255 places in 8 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 3 with 510 rules applied. Total rules applied 1162 place count 2822 transition count 2572
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1492 place count 2492 transition count 2242
Iterating global reduction 3 with 330 rules applied. Total rules applied 1822 place count 2492 transition count 2242
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 1822 place count 2492 transition count 2112
Deduced a syphon composed of 130 places in 16 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 2082 place count 2362 transition count 2112
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 3 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 3502 place count 1652 transition count 1402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 418 times.
Drop transitions (Partial Free agglomeration) removed 418 transitions
Iterating global reduction 3 with 418 rules applied. Total rules applied 3920 place count 1652 transition count 1402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3921 place count 1651 transition count 1401
Applied a total of 3921 rules in 1635 ms. Remains 1651 /3403 variables (removed 1752) and now considering 1401/3153 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1649 ms. Remains : 1651/3403 places, 1401/3153 transitions.
RANDOM walk for 40000 steps (8 resets) in 884 ms. (45 steps per ms) remains 4/6 properties
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
// Phase 1: matrix 1401 rows 1651 cols
[2024-05-29 14:53:49] [INFO ] Computed 551 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 716/798 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 117/915 variables, 43/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 36/951 variables, 18/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 974/1925 variables, 951/1257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 524/2449 variables, 309/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2449 variables, 86/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2449 variables, 3/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2449 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/2463 variables, 14/1669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2463 variables, 12/1681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2463 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 12/2475 variables, 6/1687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2475 variables, 10/1697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2475 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/2483 variables, 4/1701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2483 variables, 4/1705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2483 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 334/2817 variables, 193/1898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2817 variables, 44/1942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2817 variables, 3/1945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2817 variables, 0/1945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 19/2836 variables, 24/1969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2836 variables, 19/1988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2836 variables, 0/1988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 20/2856 variables, 10/1998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2856 variables, 16/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2856 variables, 0/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 2/2858 variables, 1/2015 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2858 variables, 2/2017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2858 variables, 0/2017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 139/2997 variables, 92/2109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2997 variables, 29/2138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2997 variables, 1/2139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2997 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 2/2999 variables, 3/2142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2999 variables, 2/2144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2999 variables, 0/2144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/3001 variables, 1/2145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3001 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 43/3044 variables, 33/2178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3044 variables, 9/2187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3044 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 2/3046 variables, 4/2191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3046 variables, 2/2193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3046 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 6/3052 variables, 6/2199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3052 variables, 3/2202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3052 variables, 0/2202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 0/3052 variables, 0/2202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3052/3052 variables, and 2202 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3886 ms.
Refiners :[Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1651/1651 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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 716/798 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:53] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2024-05-29 14:53:53] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:53:53] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:53:54] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 5 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/798 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:53:55] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 117/915 variables, 43/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:56] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 3 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:57] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 36/951 variables, 18/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:58] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/951 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:58] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-29 14:53:58] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/951 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/951 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 974/1925 variables, 951/1301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1925 variables, 2/1303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:53:58] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-29 14:53:59] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:54:00] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1925 variables, 16/1319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1925 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 524/2449 variables, 309/1628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2449 variables, 86/1714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2449 variables, 3/1717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2449 variables, 2/1719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:04] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 4 ms to minimize.
[2024-05-29 14:54:04] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-05-29 14:54:04] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
[2024-05-29 14:54:04] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 3 ms to minimize.
[2024-05-29 14:54:05] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-29 14:54:05] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 3 ms to minimize.
[2024-05-29 14:54:05] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
[2024-05-29 14:54:05] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 3 ms to minimize.
[2024-05-29 14:54:05] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-05-29 14:54:06] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2449 variables, 20/1739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:07] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 14:54:08] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 14:54:09] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:54:09] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-29 14:54:09] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:54:09] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-29 14:54:09] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-29 14:54:10] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:54:10] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-29 14:54:10] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2449 variables, 15/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:11] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2449 variables, 1/1755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2449 variables, 0/1755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 14/2463 variables, 14/1769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2463 variables, 12/1781 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:11] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2024-05-29 14:54:12] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2024-05-29 14:54:12] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-05-29 14:54:12] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 3 ms to minimize.
[2024-05-29 14:54:12] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2463 variables, 5/1786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2463 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 12/2475 variables, 6/1792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2475 variables, 10/1802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2475 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 8/2483 variables, 4/1806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2483 variables, 4/1810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2483 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 334/2817 variables, 193/2003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2817 variables, 44/2047 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2817 variables, 3/2050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:14] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-29 14:54:14] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/2817 variables, 2/2052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2817 variables, 0/2052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 19/2836 variables, 24/2076 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2836 variables, 19/2095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:15] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2024-05-29 14:54:15] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-05-29 14:54:16] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-05-29 14:54:16] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-29 14:54:16] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/2836 variables, 5/2100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2836 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 20/2856 variables, 10/2110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2856 variables, 16/2126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2856 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/2858 variables, 1/2127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2858 variables, 2/2129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2858 variables, 0/2129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 139/2997 variables, 92/2221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2997 variables, 29/2250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2997 variables, 1/2251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:18] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2024-05-29 14:54:18] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 14:54:19] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-29 14:54:19] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-05-29 14:54:19] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-05-29 14:54:20] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/2997 variables, 6/2257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2997 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 2/2999 variables, 3/2260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2999 variables, 2/2262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2999 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 2/3001 variables, 1/2263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3001 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 43/3044 variables, 33/2296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3044 variables, 9/2305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:21] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2024-05-29 14:54:22] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-05-29 14:54:22] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/3044 variables, 3/2308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/3044 variables, 0/2308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 2/3046 variables, 4/2312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3046 variables, 2/2314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3046 variables, 0/2314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 6/3052 variables, 6/2320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3052 variables, 3/2323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3052 variables, 0/2323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 0/3052 variables, 0/2323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3052/3052 variables, and 2323 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31308 ms.
Refiners :[Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1651/1651 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 117/117 constraints]
After SMT, in 35270ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3283 ms.
Support contains 82 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1651 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1650 transition count 1400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1650 transition count 1399
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1649 transition count 1399
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1646 transition count 1396
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1646 transition count 1396
Applied a total of 12 rules in 193 ms. Remains 1646 /1651 variables (removed 5) and now considering 1396/1401 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 1646/1651 places, 1396/1401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1157 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 115831 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 4
Probabilistic random walk after 115831 steps, saw 107815 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1396 rows 1646 cols
[2024-05-29 14:54:32] [INFO ] Computed 551 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 713/795 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/795 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/920 variables, 47/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/950 variables, 15/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 973/1923 variables, 950/1256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1923 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 521/2444 variables, 308/1564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2444 variables, 86/1650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2444 variables, 3/1653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2444 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 12/2456 variables, 14/1667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2456 variables, 12/1679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2456 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 12/2468 variables, 6/1685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2468 variables, 10/1695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2468 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/2476 variables, 4/1699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2476 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2476 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 333/2809 variables, 192/1895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2809 variables, 45/1940 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2809 variables, 3/1943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2809 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 16/2825 variables, 22/1965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2825 variables, 16/1981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2825 variables, 0/1981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 18/2843 variables, 9/1990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2843 variables, 16/2006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2843 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 4/2847 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2847 variables, 2/2010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2847 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 1/2848 variables, 1/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2848 variables, 1/2012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2848 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 139/2987 variables, 92/2104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2987 variables, 29/2133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2987 variables, 1/2134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2987 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/2989 variables, 3/2137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2989 variables, 2/2139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2989 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 2/2991 variables, 1/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2991 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 43/3034 variables, 33/2173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3034 variables, 9/2182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3034 variables, 0/2182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/3036 variables, 4/2186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3036 variables, 2/2188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3036 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 6/3042 variables, 6/2194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3042 variables, 3/2197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 0/3042 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3042/3042 variables, and 2197 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3960 ms.
Refiners :[Positive P Invariants (semi-flows): 523/523 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1646/1646 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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 713/795 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 3 ms to minimize.
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 3 ms to minimize.
[2024-05-29 14:54:36] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 3 ms to minimize.
[2024-05-29 14:54:37] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/795 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 14:54:38] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 3 ms to minimize.
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/795 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 3 ms to minimize.
[2024-05-29 14:54:39] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 125/920 variables, 47/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 14:54:40] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/920 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 3 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 3 ms to minimize.
[2024-05-29 14:54:41] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/920 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/920 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/920 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/920 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/950 variables, 15/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:42] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-29 14:54:43] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/950 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:43] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 973/1923 variables, 950/1309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1923 variables, 2/1311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:43] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-05-29 14:54:43] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-05-29 14:54:44] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-29 14:54:45] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-29 14:54:46] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1923 variables, 20/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:47] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-29 14:54:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1923 variables, 2/1333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1923 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 521/2444 variables, 308/1641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2444 variables, 86/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2444 variables, 3/1730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2444 variables, 2/1732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:50] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-29 14:54:50] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-05-29 14:54:51] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-29 14:54:51] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-29 14:54:51] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-05-29 14:54:51] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 4 ms to minimize.
[2024-05-29 14:54:52] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-29 14:54:52] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 4 ms to minimize.
[2024-05-29 14:54:52] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-29 14:54:52] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 4 ms to minimize.
[2024-05-29 14:54:53] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-29 14:54:53] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-05-29 14:54:53] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 2 ms to minimize.
[2024-05-29 14:54:53] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-29 14:54:53] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 2 ms to minimize.
[2024-05-29 14:54:54] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-05-29 14:54:54] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-29 14:54:54] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:54:54] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-29 14:54:55] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2444 variables, 20/1752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:56] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 2 ms to minimize.
[2024-05-29 14:54:56] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-05-29 14:54:56] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-05-29 14:54:56] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 3 ms to minimize.
[2024-05-29 14:54:56] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 4 ms to minimize.
[2024-05-29 14:54:57] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 4 ms to minimize.
[2024-05-29 14:54:57] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-29 14:54:57] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-29 14:54:57] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2444 variables, 9/1761 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:58] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2444 variables, 1/1762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:58] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
[2024-05-29 14:54:59] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2444 variables, 2/1764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:54:59] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2444 variables, 1/1765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2444 variables, 0/1765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 12/2456 variables, 14/1779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2456 variables, 12/1791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2456 variables, 0/1791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 12/2468 variables, 6/1797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2468 variables, 10/1807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:01] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2468 variables, 1/1808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2468 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 8/2476 variables, 4/1812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2476 variables, 4/1816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2476 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 333/2809 variables, 192/2008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2809 variables, 45/2053 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2809 variables, 3/2056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:03] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 14:55:03] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 3 ms to minimize.
[2024-05-29 14:55:03] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-29 14:55:04] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2809 variables, 4/2060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2809 variables, 0/2060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 16/2825 variables, 22/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2825 variables, 16/2098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:05] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-29 14:55:05] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2024-05-29 14:55:05] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2825 variables, 3/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:06] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 4 ms to minimize.
[2024-05-29 14:55:06] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-05-29 14:55:07] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-29 14:55:07] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2024-05-29 14:55:07] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:55:07] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 3 ms to minimize.
[2024-05-29 14:55:08] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 3 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/2825 variables, 7/2108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2825 variables, 0/2108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 18/2843 variables, 9/2117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2843 variables, 16/2133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2843 variables, 0/2133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 4/2847 variables, 2/2135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2847 variables, 2/2137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2847 variables, 0/2137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 1/2848 variables, 1/2138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2848 variables, 1/2139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:10] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/2848 variables, 1/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2848 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 139/2987 variables, 92/2232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2987 variables, 29/2261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2987 variables, 1/2262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:12] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2024-05-29 14:55:12] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-05-29 14:55:12] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-29 14:55:12] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 2 ms to minimize.
[2024-05-29 14:55:12] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-05-29 14:55:13] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-05-29 14:55:13] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 2 ms to minimize.
[2024-05-29 14:55:13] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 3 ms to minimize.
[2024-05-29 14:55:13] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/2987 variables, 9/2271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2987 variables, 0/2271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 2/2989 variables, 3/2274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2989 variables, 2/2276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:14] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 3 ms to minimize.
[2024-05-29 14:55:15] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/2989 variables, 2/2278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2989 variables, 0/2278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 2/2991 variables, 1/2279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2991 variables, 0/2279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 43/3034 variables, 33/2312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3034 variables, 9/2321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3034 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 2/3036 variables, 4/2325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3036 variables, 2/2327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:17] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-29 14:55:17] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-05-29 14:55:18] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 3 ms to minimize.
[2024-05-29 14:55:18] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 14:55:18] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:55:18] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-29 14:55:18] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-29 14:55:19] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 3 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/3036 variables, 8/2335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/3036 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 6/3042 variables, 6/2341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3042 variables, 3/2344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:55:20] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 14:55:20] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-29 14:55:20] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 3 ms to minimize.
[2024-05-29 14:55:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-29 14:55:20] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 3 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/3042 variables, 5/2349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3042 variables, 0/2349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 0/3042 variables, 0/2349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3042/3042 variables, and 2349 constraints, problems are : Problem set: 0 solved, 4 unsolved in 46539 ms.
Refiners :[Positive P Invariants (semi-flows): 523/523 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1646/1646 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 148/148 constraints]
After SMT, in 50568ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5836 ms.
Support contains 82 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 50 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1646/1646 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 1396/1396 transitions.
Applied a total of 0 rules in 48 ms. Remains 1646 /1646 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2024-05-29 14:55:28] [INFO ] Invariant cache hit.
[2024-05-29 14:55:29] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-29 14:55:29] [INFO ] Invariant cache hit.
[2024-05-29 14:55:31] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
[2024-05-29 14:55:31] [INFO ] Redundant transitions in 63 ms returned []
Running 1371 sub problems to find dead transitions.
[2024-05-29 14:55:31] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1623 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 30367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33222 ms. Remains : 1646/1646 places, 1396/1396 transitions.
[2024-05-29 14:56:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-29 14:56:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1646 places, 1396 transitions and 6083 arcs took 12 ms.
[2024-05-29 14:56:02] [INFO ] Flatten gal took : 203 ms
Total runtime 145866 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-050B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1646
TRANSITIONS: 1396
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.005s]


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


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

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

Process ID: 1424
MODEL NAME: /home/mcc/execution/414/model
1646 places, 1396 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldPPPs-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 ShieldPPPs-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-171683758900510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;