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-171683759700863.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700863
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717066401113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:53:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 10:53:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:53:22] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-30 10:53:22] [INFO ] Transformed 2003 places.
[2024-05-30 10:53:22] [INFO ] Transformed 2253 transitions.
[2024-05-30 10:53:22] [INFO ] Found NUPN structural information;
[2024-05-30 10:53:22] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 1764 ms. (22 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 930 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
// Phase 1: matrix 2253 rows 2003 cols
[2024-05-30 10:53:23] [INFO ] Computed 201 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldRVs-PT-050B-ReachabilityFireability-2024-03 is UNSAT
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1805/1963 variables, 196/354 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1963 variables, 1805/2159 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1963 variables, 0/2159 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/2003 variables, 5/2164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 40/2204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2204 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2253/4256 variables, 2003/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4256 variables, 0/4207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4256/4256 variables, and 4207 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2573 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1809/1951 variables, 195/337 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1951 variables, 1809/2146 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 10:53:27] [INFO ] Deduced a trap composed of 22 places in 596 ms of which 72 ms to minimize.
[2024-05-30 10:53:28] [INFO ] Deduced a trap composed of 37 places in 553 ms of which 9 ms to minimize.
[2024-05-30 10:53:28] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 8 ms to minimize.
[2024-05-30 10:53:29] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 7 ms to minimize.
[2024-05-30 10:53:29] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 8 ms to minimize.
[2024-05-30 10:53:30] [INFO ] Deduced a trap composed of 18 places in 442 ms of which 7 ms to minimize.
[2024-05-30 10:53:30] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 8 ms to minimize.
[2024-05-30 10:53:31] [INFO ] Deduced a trap composed of 57 places in 463 ms of which 7 ms to minimize.
[2024-05-30 10:53:31] [INFO ] Deduced a trap composed of 35 places in 463 ms of which 7 ms to minimize.
SMT process timed out in 7830ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 142 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 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 2003 transition count 2081
Reduce places removed 172 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 181 rules applied. Total rules applied 353 place count 1831 transition count 2072
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 362 place count 1822 transition count 2072
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 243 Pre rules applied. Total rules applied 362 place count 1822 transition count 1829
Deduced a syphon composed of 243 places in 5 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 848 place count 1579 transition count 1829
Discarding 317 places :
Symmetric choice reduction at 3 with 317 rule applications. Total rules 1165 place count 1262 transition count 1512
Iterating global reduction 3 with 317 rules applied. Total rules applied 1482 place count 1262 transition count 1512
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 1482 place count 1262 transition count 1407
Deduced a syphon composed of 105 places in 6 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 1692 place count 1157 transition count 1407
Performed 324 Post agglomeration using F-continuation condition.Transition count delta: 324
Deduced a syphon composed of 324 places in 2 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 3 with 648 rules applied. Total rules applied 2340 place count 833 transition count 1083
Partial Free-agglomeration rule applied 85 times.
Drop transitions (Partial Free agglomeration) removed 85 transitions
Iterating global reduction 3 with 85 rules applied. Total rules applied 2425 place count 833 transition count 1083
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2426 place count 832 transition count 1082
Applied a total of 2426 rules in 548 ms. Remains 832 /2003 variables (removed 1171) and now considering 1082/2253 (removed 1171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 832/2003 places, 1082/2253 transitions.
RANDOM walk for 40000 steps (48 resets) in 674 ms. (59 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
// Phase 1: matrix 1082 rows 832 cols
[2024-05-30 10:53:32] [INFO ] Computed 201 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 716/808 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/823 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1074/1897 variables, 823/1021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1897 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/1914 variables, 9/1030 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1914 variables, 3/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1914 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1914 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1914/1914 variables, and 1033 constraints, problems are : Problem set: 0 solved, 3 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 716/808 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:33] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-30 10:53:33] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:53:34] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:53:35] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 3 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:53:36] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-30 10:53:37] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/808 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:53:38] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 5 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:53:39] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:53:40] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-30 10:53:41] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:53:42] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:53:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/823 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1074/1897 variables, 823/1112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1897 variables, 2/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:44] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:53:44] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:53:44] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:53:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:53:45] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1897 variables, 15/1129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:53:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1897 variables, 3/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1897 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:47] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:53:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:53:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1897 variables, 3/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1897 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 17/1914 variables, 9/1145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1914 variables, 3/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1914 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:48] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:53:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1914 variables, 2/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:48] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1914 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1914 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1914 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1914/1914 variables, and 1152 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16162 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 116/116 constraints]
After SMT, in 16966ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1025 ms.
Support contains 92 out of 832 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 832/832 places, 1082/1082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 832 transition count 1079
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 829 transition count 1079
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 6 place count 829 transition count 1067
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 817 transition count 1067
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 88 place count 788 transition count 1038
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 788 transition count 1038
Applied a total of 95 rules in 127 ms. Remains 788 /832 variables (removed 44) and now considering 1038/1082 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 788/832 places, 1038/1082 transitions.
RANDOM walk for 40000 steps (53 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 170794 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 3
Probabilistic random walk after 170794 steps, saw 44414 distinct states, run finished after 3009 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1038 rows 788 cols
[2024-05-30 10:53:54] [INFO ] Computed 201 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 673/765 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/779 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/779 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1030/1809 variables, 779/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/1826 variables, 9/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1826 variables, 3/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1826 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1826 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1826/1826 variables, and 989 constraints, problems are : Problem set: 0 solved, 3 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 788/788 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 673/765 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 2 ms to minimize.
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:53:55] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:53:56] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:53:57] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:53:58] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:53:59] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:54:00] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:54:01] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14/779 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:54:02] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:54:03] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:54:03] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-30 10:54:03] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:03] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:03] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1030/1809 variables, 779/1054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1809 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-30 10:54:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:54:05] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:54:06] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:54:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:54:06] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1809 variables, 18/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:06] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:54:06] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1809 variables, 2/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1809 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 17/1826 variables, 9/1085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1826 variables, 3/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1826 variables, 1/1089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:54:07] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:54:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1826 variables, 14/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:09] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:09] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1826 variables, 2/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:54:09] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:54:09] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-30 10:54:10] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1826 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 10:54:10] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1826 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1826 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/1826 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1826/1826 variables, and 1110 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16384 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 788/788 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 118/118 constraints]
After SMT, in 17129ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2514 ms.
Support contains 92 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1038/1038 transitions.
Applied a total of 0 rules in 30 ms. Remains 788 /788 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 788/788 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1038/1038 transitions.
Applied a total of 0 rules in 22 ms. Remains 788 /788 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-05-30 10:54:13] [INFO ] Invariant cache hit.
[2024-05-30 10:54:14] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-30 10:54:14] [INFO ] Invariant cache hit.
[2024-05-30 10:54:15] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2024-05-30 10:54:15] [INFO ] Redundant transitions in 139 ms returned []
Running 1036 sub problems to find dead transitions.
[2024-05-30 10:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/787 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 10:54:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 10:54:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:54:37] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/787 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/1826 variables, and 8 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/201 constraints, State Equation: 0/788 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/787 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/787 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/787 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (OVERLAPS) 1/788 variables, 197/205 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:54:58] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:54:59] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:55:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:55:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:55:02] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:55:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:55:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:55:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:55:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:55:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 10:55:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-30 10:55:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-30 10:55:09] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:55:09] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:09] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
[2024-05-30 10:55:10] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 10:55:11] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/788 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-30 10:55:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-30 10:55:14] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-30 10:55:15] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 60591ms, After SMT, problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60602ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61987 ms. Remains : 788/788 places, 1038/1038 transitions.
[2024-05-30 10:55:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-30 10:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 788 places, 1038 transitions and 4948 arcs took 10 ms.
[2024-05-30 10:55:16] [INFO ] Flatten gal took : 150 ms
Total runtime 113831 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/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 788
TRANSITIONS: 1038
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 1808
MODEL NAME: /home/mcc/execution/412/model
788 places, 1038 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-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717067083275

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759700863"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;