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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.6K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:10 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 61K 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-005B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717041092111

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-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 03:51:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 03:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:51:33] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-30 03:51:33] [INFO ] Transformed 203 places.
[2024-05-30 03:51:33] [INFO ] Transformed 228 transitions.
[2024-05-30 03:51:33] [INFO ] Found NUPN structural information;
[2024-05-30 03:51:33] [INFO ] Parsed PT model containing 203 places and 228 transitions and 720 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (169 resets) in 1123 ms. (35 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (23 resets) in 346 ms. (115 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 695 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 110 ms. (360 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 102 ms. (388 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-005B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 228 rows 203 cols
[2024-05-30 03:51:34] [INFO ] Computed 21 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 137/200 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 137/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/203 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 228/431 variables, 203/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/431 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 137/200 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 137/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 13 ms to minimize.
[2024-05-30 03:51:34] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/203 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:51:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-30 03:51:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 228/431 variables, 203/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:35] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/431 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1069 ms.
Refiners :[Domain max(s): 203/203 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 63 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 228/228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 203 transition count 220
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 195 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 193 transition count 218
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 20 place count 193 transition count 202
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 52 place count 177 transition count 202
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 70 place count 159 transition count 184
Iterating global reduction 3 with 18 rules applied. Total rules applied 88 place count 159 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 159 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 158 transition count 183
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 144 place count 131 transition count 156
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 131 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 130 transition count 155
Applied a total of 151 rules in 68 ms. Remains 130 /203 variables (removed 73) and now considering 155/228 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 130/203 places, 155/228 transitions.
RANDOM walk for 40000 steps (237 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2222809 steps, run timeout after 3001 ms. (steps per millisecond=740 ) properties seen :0 out of 1
Probabilistic random walk after 2222809 steps, saw 351576 distinct states, run finished after 3004 ms. (steps per millisecond=739 ) properties seen :0
// Phase 1: matrix 155 rows 130 cols
[2024-05-30 03:51:39] [INFO ] Computed 21 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/128 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/283 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/128 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/283 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/285 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
[2024-05-30 03:51:39] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 63 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 155/155 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 130/130 places, 155/155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 155/155 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2024-05-30 03:51:40] [INFO ] Invariant cache hit.
[2024-05-30 03:51:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 03:51:40] [INFO ] Invariant cache hit.
[2024-05-30 03:51:40] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-30 03:51:40] [INFO ] Redundant transitions in 4 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-30 03:51:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 7/130 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 3 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 03:51:41] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 14 ms to minimize.
[2024-05-30 03:51:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
[2024-05-30 03:51:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 8 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:51:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 3 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:51:45] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 03:51:46] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 03:51:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 03:51:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:51:49] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:51:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:51:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:52] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:53] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:51:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:51:53] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-30 03:51:54] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 03:51:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:51:56] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 11/183 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-30 03:51:57] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-30 03:51:58] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/130 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 20 (OVERLAPS) 155/285 variables, 130/321 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 03:51:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-30 03:52:00] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/285 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:52:02] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:03] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:52:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 03:52:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/285 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 03:52:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 03:52:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 03:52:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/285 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-30 03:52:05] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 03:52:06] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 03:52:06] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/285 variables, 9/366 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:06] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 03:52:06] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-30 03:52:06] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-30 03:52:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/285 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:09] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 03:52:09] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-30 03:52:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:52:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-30 03:52:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/285 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:52:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/285 variables, and 377 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 226/226 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 7/130 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 218/247 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-30 03:52:11] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2024-05-30 03:52:11] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:11] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:52:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
[2024-05-30 03:52:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 155/285 variables, 130/384 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 148/532 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-30 03:52:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 03:52:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:19] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:52:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
[2024-05-30 03:52:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 03:52:22] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-30 03:52:22] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 03:52:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 11/546 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:26] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2024-05-30 03:52:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 03:52:27] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 03:52:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 03:52:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-30 03:52:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 03:52:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-30 03:52:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-30 03:52:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-30 03:52:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 03:52:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-30 03:52:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 03:52:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-30 03:52:38] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 03:52:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-30 03:52:39] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 03:52:39] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 564 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 265/265 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60309 ms. Remains : 130/130 places, 155/155 transitions.
[2024-05-30 03:52:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-30 03:52:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 155 transitions and 575 arcs took 4 ms.
[2024-05-30 03:52:40] [INFO ] Flatten gal took : 98 ms
Total runtime 67459 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-005B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 1401
MODEL NAME: /home/mcc/execution/417/model
130 places, 155 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-005B-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717041163632

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-005B"
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-005B, 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-171683759500783"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-005B.tgz
mv ShieldRVs-PT-005B 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 ;