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-171683758800463.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758800463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 349K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716975755170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 09:42:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 09:42:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:42:36] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-29 09:42:36] [INFO ] Transformed 1363 places.
[2024-05-29 09:42:36] [INFO ] Transformed 1263 transitions.
[2024-05-29 09:42:36] [INFO ] Found NUPN structural information;
[2024-05-29 09:42:36] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 2069 ms. (19 steps per ms) remains 7/16 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 909 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
// Phase 1: matrix 1263 rows 1363 cols
[2024-05-29 09:42:38] [INFO ] Computed 221 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1088/1317 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1317 variables, 1088/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 46/1363 variables, 11/1538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 46/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1263/2626 variables, 1363/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2626/2626 variables, and 2947 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2245 ms.
Refiners :[Domain max(s): 1363/1363 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1363/1363 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1088/1317 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1317 variables, 1088/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 09:42:41] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 54 ms to minimize.
[2024-05-29 09:42:41] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 5 ms to minimize.
[2024-05-29 09:42:41] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 5 ms to minimize.
[2024-05-29 09:42:42] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 7 ms to minimize.
[2024-05-29 09:42:42] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 4 ms to minimize.
[2024-05-29 09:42:42] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 4 ms to minimize.
[2024-05-29 09:42:42] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-29 09:42:42] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 4 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 6 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-29 09:42:43] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 3 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 20/1547 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 09:42:44] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 5 ms to minimize.
[2024-05-29 09:42:45] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 5 ms to minimize.
[2024-05-29 09:42:45] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 5 ms to minimize.
[2024-05-29 09:42:45] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 5 ms to minimize.
[2024-05-29 09:42:45] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 4 ms to minimize.
SMT process timed out in 7730ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1363 transition count 1169
Reduce places removed 94 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 108 rules applied. Total rules applied 202 place count 1269 transition count 1155
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 216 place count 1255 transition count 1155
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 216 place count 1255 transition count 1067
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 392 place count 1167 transition count 1067
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 482 place count 1077 transition count 977
Iterating global reduction 3 with 90 rules applied. Total rules applied 572 place count 1077 transition count 977
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 572 place count 1077 transition count 956
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 614 place count 1056 transition count 956
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1062 place count 832 transition count 732
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 3 with 117 rules applied. Total rules applied 1179 place count 832 transition count 732
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1180 place count 831 transition count 731
Applied a total of 1180 rules in 412 ms. Remains 831 /1363 variables (removed 532) and now considering 731/1263 (removed 532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 831/1363 places, 731/1263 transitions.
RANDOM walk for 40000 steps (12 resets) in 762 ms. (52 steps per ms) remains 6/7 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
// Phase 1: matrix 731 rows 831 cols
[2024-05-29 09:42:46] [INFO ] Computed 221 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 555/768 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 24/792 variables, 9/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/794 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 715/1509 variables, 794/1001 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1509 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 38/1547 variables, 24/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 7/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/1551 variables, 3/1035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1551 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1551 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/1555 variables, 2/1039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1555 variables, 4/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1555 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 7/1562 variables, 7/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1562 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1562 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1562 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 1052 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2283 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 831/831 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/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 555/768 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 4 ms to minimize.
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 3 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:42:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 3 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 3 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-29 09:42:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 13/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 24/792 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:42:55] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/794 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/794 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 715/1509 variables, 794/1081 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1509 variables, 3/1084 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1509 variables, 9/1093 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1509 variables, 5/1098 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1509 variables, 9/1107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:03] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1509 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1509 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 38/1547 variables, 24/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1547 variables, 7/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1547 variables, 3/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:43:05] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:43:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:43:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1547 variables, 9/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1547 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 4/1551 variables, 3/1154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1551 variables, 2/1156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:43:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1551 variables, 2/1158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1551 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 4/1555 variables, 2/1160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1555 variables, 4/1164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1555 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 7/1562 variables, 7/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1562 variables, 2/1173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:11] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:43:11] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1562 variables, 2/1175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:12] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:12] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:43:12] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:43:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1562 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:43:13] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:43:13] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:43:13] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1562 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1562 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:43:15] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 38 (OVERLAPS) 0/1562 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1562 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 0/1562 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 27640 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 831/831 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 126/126 constraints]
After SMT, in 30058ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5495 ms.
Support contains 213 out of 831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 831/831 places, 731/731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 727
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 827 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 827 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 825 transition count 725
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 812 transition count 712
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 812 transition count 712
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 810 transition count 710
Applied a total of 44 rules in 131 ms. Remains 810 /831 variables (removed 21) and now considering 710/731 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 810/831 places, 710/731 transitions.
RANDOM walk for 40000 steps (13 resets) in 469 ms. (85 steps per ms) remains 5/6 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
// Phase 1: matrix 710 rows 810 cols
[2024-05-29 09:43:22] [INFO ] Computed 221 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 556/740 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/752 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/754 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 685/1439 variables, 754/953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 63/1502 variables, 39/992 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1502 variables, 12/1004 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1502 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1505 variables, 3/1007 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1505 variables, 3/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1505 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/1511 variables, 3/1013 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1511 variables, 6/1019 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1511 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 9/1520 variables, 8/1027 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1520 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1520 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1520 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1520/1520 variables, and 1031 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 556/740 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:24] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-29 09:43:24] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 3 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 3 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:43:25] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:26] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:43:27] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:43:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 16/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 12/752 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:29] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/754 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 685/1439 variables, 754/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1439 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:43:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:43:31] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1439 variables, 15/1029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1439 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 63/1502 variables, 39/1068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1502 variables, 12/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1502 variables, 3/1083 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:33] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-29 09:43:33] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
[2024-05-29 09:43:33] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-29 09:43:33] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 3 ms to minimize.
[2024-05-29 09:43:33] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 3 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 09:43:34] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:43:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1502 variables, 20/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:36] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1502 variables, 2/1105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:43:37] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:43:38] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1502 variables, 5/1110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:39] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:43:39] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:43:39] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:43:39] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-29 09:43:39] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:43:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:43:40] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:43:40] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:43:40] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:43:40] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:43:41] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:43:41] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:43:41] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1502 variables, 14/1124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1502 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 3/1505 variables, 3/1127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1505 variables, 3/1130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:43] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1505 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1505 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 6/1511 variables, 3/1134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1511 variables, 6/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1511 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 9/1520 variables, 8/1148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1520 variables, 4/1152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:46] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:43:46] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1520 variables, 2/1154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 09:43:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1520 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1520 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 0/1520 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1520/1520 variables, and 1155 constraints, problems are : Problem set: 0 solved, 5 unsolved in 24797 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 119/119 constraints]
After SMT, in 26422ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6427 ms.
Support contains 173 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 810 transition count 706
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 806 transition count 706
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 806 transition count 703
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 803 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 802 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 802 transition count 702
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 60 place count 780 transition count 680
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 780 transition count 680
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 779 transition count 679
Applied a total of 68 rules in 137 ms. Remains 779 /810 variables (removed 31) and now considering 679/710 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 779/810 places, 679/710 transitions.
RANDOM walk for 40000 steps (13 resets) in 399 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 164933 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 4
Probabilistic random walk after 164933 steps, saw 152208 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 679 rows 779 cols
[2024-05-29 09:43:59] [INFO ] Computed 221 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 533/706 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/717 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/723 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 654/1377 variables, 723/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 63/1440 variables, 39/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1440 variables, 12/973 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1440 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/1443 variables, 3/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1443 variables, 3/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1443 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/1449 variables, 3/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1449 variables, 6/988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1449 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 9/1458 variables, 8/996 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1458 variables, 4/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1458 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1458 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1458/1458 variables, and 1000 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 533/706 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:00] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:44:00] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:44:01] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 5 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:44:02] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/706 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/706 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/717 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/723 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 654/1377 variables, 723/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1377 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-29 09:44:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:44:04] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1377 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1377 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 63/1440 variables, 39/1003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1440 variables, 12/1015 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1440 variables, 3/1018 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:05] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:44:05] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:44:05] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:44:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:44:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1440 variables, 5/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:44:06] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:44:06] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:44:06] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:44:06] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:44:07] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:44:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:44:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:44:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1440 variables, 8/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1440 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1443 variables, 3/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1443 variables, 3/1037 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1443 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 6/1449 variables, 3/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1449 variables, 6/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1449 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 9/1458 variables, 8/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1458 variables, 4/1058 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1458 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/1458 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1458/1458 variables, and 1058 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9460 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 54/54 constraints]
After SMT, in 10844ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2655 ms.
Support contains 173 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 679/679 transitions.
Applied a total of 0 rules in 20 ms. Remains 779 /779 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 779/779 places, 679/679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 679/679 transitions.
Applied a total of 0 rules in 24 ms. Remains 779 /779 variables (removed 0) and now considering 679/679 (removed 0) transitions.
[2024-05-29 09:44:12] [INFO ] Invariant cache hit.
[2024-05-29 09:44:13] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-29 09:44:13] [INFO ] Invariant cache hit.
[2024-05-29 09:44:13] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2024-05-29 09:44:13] [INFO ] Redundant transitions in 37 ms returned []
Running 672 sub problems to find dead transitions.
[2024-05-29 09:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/773 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/773 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-29 09:44:21] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 09:44:27] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/773 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/773 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 30160ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31265 ms. Remains : 779/779 places, 679/679 transitions.
[2024-05-29 09:44:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2024-05-29 09:44:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 779 places, 679 transitions and 2594 arcs took 11 ms.
[2024-05-29 09:44:44] [INFO ] Flatten gal took : 87 ms
Total runtime 128047 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-020B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 779
TRANSITIONS: 679
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 1566
MODEL NAME: /home/mcc/execution/410/model
779 places, 679 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 16777216 at unique_table.cc, line 313
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="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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-171683758800463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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