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

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

=== Now, execution of the tool begins

BK_START 1716975703056

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 09:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 09:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:41:44] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-29 09:41:44] [INFO ] Transformed 1363 places.
[2024-05-29 09:41:44] [INFO ] Transformed 1263 transitions.
[2024-05-29 09:41:44] [INFO ] Found NUPN structural information;
[2024-05-29 09:41:44] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 2392 ms. (16 steps per ms) remains 4/15 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 480 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
// Phase 1: matrix 1263 rows 1363 cols
[2024-05-29 09:41:45] [INFO ] Computed 221 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1232/1315 variables, 213/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1315 variables, 1232/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1315 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 48/1363 variables, 8/1536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 48/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1263/2626 variables, 1363/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2626/2626 variables, and 2947 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1941 ms.
Refiners :[Domain max(s): 1363/1363 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1363/1363 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/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1232/1315 variables, 213/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1315 variables, 1232/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 49 ms to minimize.
[2024-05-29 09:41:49] [INFO ] Deduced a trap composed of 23 places in 459 ms of which 17 ms to minimize.
[2024-05-29 09:41:49] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 6 ms to minimize.
[2024-05-29 09:41:49] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 5 ms to minimize.
[2024-05-29 09:41:50] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 5 ms to minimize.
[2024-05-29 09:41:50] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 5 ms to minimize.
[2024-05-29 09:41:50] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 5 ms to minimize.
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 5 ms to minimize.
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 5 ms to minimize.
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 4 ms to minimize.
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 5 ms to minimize.
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 4 ms to minimize.
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 4 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1315/2626 variables, and 1543 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 1315/1363 constraints, Positive P Invariants (semi-flows): 213/221 constraints, State Equation: 0/1363 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 7125ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 1363 transition count 1150
Reduce places removed 113 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 123 rules applied. Total rules applied 236 place count 1250 transition count 1140
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 246 place count 1240 transition count 1140
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 246 place count 1240 transition count 1043
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 440 place count 1143 transition count 1043
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 565 place count 1018 transition count 918
Iterating global reduction 3 with 125 rules applied. Total rules applied 690 place count 1018 transition count 918
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 690 place count 1018 transition count 877
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 772 place count 977 transition count 877
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 263
Deduced a syphon composed of 263 places in 1 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 1298 place count 714 transition count 614
Partial Free-agglomeration rule applied 142 times.
Drop transitions (Partial Free agglomeration) removed 142 transitions
Iterating global reduction 3 with 142 rules applied. Total rules applied 1440 place count 714 transition count 614
Applied a total of 1440 rules in 540 ms. Remains 714 /1363 variables (removed 649) and now considering 614/1263 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 714/1363 places, 614/1263 transitions.
RANDOM walk for 40000 steps (14 resets) in 1005 ms. (39 steps per ms) remains 3/4 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
// Phase 1: matrix 614 rows 714 cols
[2024-05-29 09:41:54] [INFO ] Computed 221 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 626/676 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/698 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/698 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/714 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 614/1328 variables, 714/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1328 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1328 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 935 constraints, problems are : Problem set: 0 solved, 2 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 626/676 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:54] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:41:54] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:54] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/698 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/714 variables, 8/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 614/1328 variables, 714/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1328 variables, 2/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 3 ms to minimize.
[2024-05-29 09:41:58] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1328 variables, 14/987 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1328 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1328 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 987 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5506 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 50/50 constraints]
After SMT, in 6069ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 576 ms.
Support contains 50 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 614/614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 714 transition count 608
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 708 transition count 608
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 708 transition count 602
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 702 transition count 602
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 72 place count 678 transition count 578
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 678 transition count 578
Applied a total of 80 rules in 68 ms. Remains 678 /714 variables (removed 36) and now considering 578/614 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 678/714 places, 578/614 transitions.
RANDOM walk for 40000 steps (16 resets) in 455 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 238876 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 238876 steps, saw 91966 distinct states, run finished after 3007 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 578 rows 678 cols
[2024-05-29 09:42:04] [INFO ] Computed 221 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 590/640 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/662 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/678 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 578/1256 variables, 678/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1256 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1256 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1256/1256 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 678/678 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 590/640 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:42:05] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:06] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:07] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/662 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/678 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:42:08] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 578/1256 variables, 678/944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:42:09] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:42:09] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:42:09] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-29 09:42:09] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:10] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:10] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:42:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 8/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1256 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1256/1256 variables, and 954 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6182 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 678/678 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 53/53 constraints]
After SMT, in 6903ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1259 ms.
Support contains 50 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 578/578 transitions.
Applied a total of 0 rules in 21 ms. Remains 678 /678 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 678/678 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 578/578 transitions.
Applied a total of 0 rules in 18 ms. Remains 678 /678 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-29 09:42:12] [INFO ] Invariant cache hit.
[2024-05-29 09:42:12] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-29 09:42:12] [INFO ] Invariant cache hit.
[2024-05-29 09:42:13] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-29 09:42:13] [INFO ] Redundant transitions in 35 ms returned []
Running 577 sub problems to find dead transitions.
[2024-05-29 09:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/677 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/677 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/678 variables, 213/221 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:42:24] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 09:42:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:31] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:42:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:42:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 09:42:31] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:33] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:42:34] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:42:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:35] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:42:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 5 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:42:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:42:37] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:42:37] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:42:37] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 09:42:37] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-29 09:42:38] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 09:42:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:42:38] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1256 variables, and 301 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/678 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/677 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/677 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/678 variables, 213/221 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 80/301 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:42:51] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:42:52] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:42:53] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:42:57] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-29 09:42:59] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:43:00] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 09:43:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:43:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:43:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
[2024-05-29 09:43:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 5 ms to minimize.
[2024-05-29 09:43:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-29 09:43:04] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:43:07] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:43:07] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:43:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:08] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:43:08] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:43:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:43:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:43:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/1256 variables, and 369 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/678 constraints, PredecessorRefiner: 0/577 constraints, Known Traps: 148/148 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61188 ms. Remains : 678/678 places, 578/578 transitions.
[2024-05-29 09:43:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-29 09:43:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 678 places, 578 transitions and 2505 arcs took 10 ms.
[2024-05-29 09:43:13] [INFO ] Flatten gal took : 88 ms
Total runtime 89488 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/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 678
TRANSITIONS: 578
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.000s]


SAVING FILE /home/mcc/execution/407/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: 1371
MODEL NAME: /home/mcc/execution/407/model
678 places, 578 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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