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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717082639137

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:24:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 15:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:24:00] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-30 15:24:00] [INFO ] Transformed 1503 places.
[2024-05-30 15:24:00] [INFO ] Transformed 1503 transitions.
[2024-05-30 15:24:00] [INFO ] Found NUPN structural information;
[2024-05-30 15:24:00] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 254 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 (8 resets) in 1200 ms. (33 steps per ms) remains 13/16 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 13/13 properties
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-30 15:24:01] [INFO ] Computed 121 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1301/1503 variables, 121/323 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1301/1624 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3216 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1301/1503 variables, 121/323 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1301/1624 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-30 15:24:06] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 53 ms to minimize.
[2024-05-30 15:24:06] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 6 ms to minimize.
[2024-05-30 15:24:06] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 6 ms to minimize.
[2024-05-30 15:24:07] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 19 ms to minimize.
[2024-05-30 15:24:07] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 4 ms to minimize.
[2024-05-30 15:24:07] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 5 ms to minimize.
[2024-05-30 15:24:08] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 4 ms to minimize.
[2024-05-30 15:24:08] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 5 ms to minimize.
[2024-05-30 15:24:08] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 5 ms to minimize.
[2024-05-30 15:24:08] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 5 ms to minimize.
[2024-05-30 15:24:09] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 4 ms to minimize.
[2024-05-30 15:24:09] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 5 ms to minimize.
[2024-05-30 15:24:09] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 4 ms to minimize.
[2024-05-30 15:24:09] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 4 ms to minimize.
[2024-05-30 15:24:10] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 4 ms to minimize.
SMT process timed out in 8491ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 202 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 1503 transition count 1207
Reduce places removed 296 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 1 with 363 rules applied. Total rules applied 659 place count 1207 transition count 1140
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 726 place count 1140 transition count 1140
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 726 place count 1140 transition count 1025
Deduced a syphon composed of 115 places in 3 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 956 place count 1025 transition count 1025
Discarding 160 places :
Symmetric choice reduction at 3 with 160 rule applications. Total rules 1116 place count 865 transition count 865
Iterating global reduction 3 with 160 rules applied. Total rules applied 1276 place count 865 transition count 865
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1276 place count 865 transition count 807
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1392 place count 807 transition count 807
Performed 214 Post agglomeration using F-continuation condition.Transition count delta: 214
Deduced a syphon composed of 214 places in 2 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1820 place count 593 transition count 593
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1920 place count 543 transition count 618
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1921 place count 543 transition count 617
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1927 place count 543 transition count 611
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1933 place count 537 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1934 place count 537 transition count 610
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1936 place count 537 transition count 610
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1938 place count 537 transition count 610
Applied a total of 1938 rules in 391 ms. Remains 537 /1503 variables (removed 966) and now considering 610/1503 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 537/1503 places, 610/1503 transitions.
RANDOM walk for 40000 steps (14 resets) in 569 ms. (70 steps per ms) remains 9/13 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (9 resets) in 159 ms. (250 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
// Phase 1: matrix 610 rows 537 cols
[2024-05-30 15:24:11] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 15:24:11] [INFO ] State equation strengthened by 114 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 404/537 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 610/1147 variables, 537/658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 114/772 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1147 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1147 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 772 constraints, problems are : Problem set: 0 solved, 6 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 537/537 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 404/537 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 17 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 3 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-30 15:24:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:24:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:24:14] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:15] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 610/1147 variables, 537/705 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1147 variables, 114/819 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1147 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:16] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-30 15:24:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-30 15:24:16] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:24:16] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-30 15:24:17] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1147 variables, 5/830 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1147 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1147 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 831 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6788 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 537/537 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 53/53 constraints]
After SMT, in 7602ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4067 ms.
Support contains 133 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 610/610 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 537 transition count 595
Reduce places removed 15 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 23 rules applied. Total rules applied 38 place count 522 transition count 587
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 46 place count 514 transition count 587
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 46 place count 514 transition count 569
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 82 place count 496 transition count 569
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 86 place count 492 transition count 565
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 492 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 90 place count 492 transition count 563
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 490 transition count 563
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 172 place count 451 transition count 524
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 188 place count 443 transition count 533
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 443 transition count 530
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 194 place count 440 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 440 transition count 529
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 440 transition count 529
Applied a total of 196 rules in 101 ms. Remains 440 /537 variables (removed 97) and now considering 529/610 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 440/537 places, 529/610 transitions.
RANDOM walk for 40000 steps (14 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 236520 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 6
Probabilistic random walk after 236520 steps, saw 144478 distinct states, run finished after 3013 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 529 rows 440 cols
[2024-05-30 15:24:26] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 15:24:26] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 307/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 529/969 variables, 440/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/969 variables, 147/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/969 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/969 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 708 constraints, problems are : Problem set: 0 solved, 6 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 307/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:24:27] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:24:28] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 529/969 variables, 440/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 147/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/969 variables, 6/745 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:24:29] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-30 15:24:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/969 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 969/969 variables, and 747 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 5026ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7454 ms.
Support contains 133 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 529/529 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 529/529 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-30 15:24:38] [INFO ] Invariant cache hit.
[2024-05-30 15:24:39] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-30 15:24:39] [INFO ] Invariant cache hit.
[2024-05-30 15:24:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 15:24:39] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2024-05-30 15:24:39] [INFO ] Redundant transitions in 30 ms returned []
Running 528 sub problems to find dead transitions.
[2024-05-30 15:24:39] [INFO ] Invariant cache hit.
[2024-05-30 15:24:39] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-05-30 15:24:46] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 15:24:47] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:24:48] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:24:49] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 15:24:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:24:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 15:24:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-05-30 15:24:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:24:51] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:24:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 15:24:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-30 15:24:52] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-30 15:24:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (OVERLAPS) 529/969 variables, 440/587 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 147/734 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 969/969 variables, and 734 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 528 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 26/147 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 529/969 variables, 440/587 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/969 variables, 147/734 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 528/1262 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-05-30 15:25:25] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:25:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:25:26] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-30 15:25:28] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-30 15:25:31] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-30 15:25:32] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-30 15:25:34] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:25:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-30 15:25:37] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 969/969 variables, and 1271 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 35/35 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 528 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61097 ms. Remains : 440/440 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 48 edges and 440 vertex of which 2 / 440 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 439 transition count 511
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 30 place count 439 transition count 511
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 439 transition count 505
Applied a total of 36 rules in 47 ms. Remains 439 /440 variables (removed 1) and now considering 505/529 (removed 24) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 505 rows 439 cols
[2024-05-30 15:25:40] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 15:25:40] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-30 15:25:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2024-05-30 15:25:40] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-30 15:25:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 15:25:41] [INFO ] After 286ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 435 ms
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:25:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2024-05-30 15:25:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
TRAPS : Iteration 1
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 309 ms
[2024-05-30 15:25:42] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-30 15:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
TRAPS : Iteration 2
[2024-05-30 15:25:43] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:25:43] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:25:43] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:25:43] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:25:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 339 ms
[2024-05-30 15:25:43] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 3
[2024-05-30 15:25:44] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
TRAPS : Iteration 4
[2024-05-30 15:25:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:25:44] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:25:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2024-05-30 15:25:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 5
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:25:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
TRAPS : Iteration 6
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
TRAPS : Iteration 7
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:25:45] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:25:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
TRAPS : Iteration 8
[2024-05-30 15:25:46] [INFO ] After 5919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-30 15:25:46] [INFO ] After 6773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 6954 ms.
[2024-05-30 15:25:46] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-30 15:25:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 440 places, 529 transitions and 2196 arcs took 6 ms.
[2024-05-30 15:25:47] [INFO ] Flatten gal took : 72 ms
Total runtime 106953 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-030B

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: 440
TRANSITIONS: 529
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1097
MODEL NAME: /home/mcc/execution/412/model
440 places, 529 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...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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-171683760001007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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