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.r498-tall-171640618000513.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 ltsminxred
Input is HealthRecord-PT-16, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 125K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717194113227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:54] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-31 22:21:54] [INFO ] Transformed 453 places.
[2024-05-31 22:21:54] [INFO ] Transformed 594 transitions.
[2024-05-31 22:21:54] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:54] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 197 ms.
Graph (trivial) has 535 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 11 ms
Free SCC test removed 32 places
Structural test allowed to assert that 201 places are NOT stable. Took 28 ms.
Ensure Unique test removed 35 transitions
Reduce redundant transitions removed 35 transitions.
RANDOM walk for 40000 steps (401 resets) in 2652 ms. (15 steps per ms) remains 212/252 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
[2024-05-31 22:21:55] [INFO ] Flow matrix only has 543 transitions (discarded 16 similar events)
// Phase 1: matrix 543 rows 421 cols
[2024-05-31 22:21:55] [INFO ] Computed 14 invariants in 11 ms
[2024-05-31 22:21:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 61/273 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 61/281 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 148/421 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 148/435 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/964 variables, and 435 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5051 ms.
Refiners :[Domain max(s): 421/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 61/273 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 61/281 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 22:22:01] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 15 ms to minimize.
[2024-05-31 22:22:01] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 107 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 107 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 113 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 19/300 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/964 variables, and 303 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5010 ms.
Refiners :[Domain max(s): 273/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/212 constraints, Known Traps: 22/22 constraints]
After SMT, in 10161ms problems are : Problem set: 0 solved, 212 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 559/559 transitions.
Graph (complete) has 820 edges and 421 vertex of which 414 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 414 transition count 425
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 133 rules applied. Total rules applied 261 place count 297 transition count 409
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 269 place count 289 transition count 409
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 269 place count 289 transition count 400
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 287 place count 280 transition count 400
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 278 transition count 397
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 278 transition count 397
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 319 place count 264 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 264 transition count 382
Performed 5 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 330 place count 259 transition count 414
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 336 place count 259 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 353 place count 259 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 355 place count 258 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 258 transition count 407
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 368 place count 258 transition count 395
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 380 place count 246 transition count 395
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 392 place count 246 transition count 395
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 396 place count 246 transition count 395
Applied a total of 396 rules in 101 ms. Remains 246 /421 variables (removed 175) and now considering 395/559 (removed 164) transitions.
Running 379 sub problems to find dead transitions.
// Phase 1: matrix 395 rows 246 cols
[2024-05-31 22:22:05] [INFO ] Computed 7 invariants in 3 ms
[2024-05-31 22:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 2/246 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 4 (OVERLAPS) 395/641 variables, 246/253 constraints. Problems are: Problem set: 5 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 1/254 constraints. Problems are: Problem set: 5 solved, 374 unsolved
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 2 ms to minimize.
Problem TDEAD386 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 12/266 constraints. Problems are: Problem set: 6 solved, 373 unsolved
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 4 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 8/274 constraints. Problems are: Problem set: 6 solved, 373 unsolved
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 3/277 constraints. Problems are: Problem set: 6 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 277 constraints, problems are : Problem set: 6 solved, 373 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 6 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 2/245 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 4/5 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 1/246 variables, 6/11 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 19/30 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 395/641 variables, 246/276 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 1/277 constraints. Problems are: Problem set: 6 solved, 373 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 373/650 constraints. Problems are: Problem set: 6 solved, 373 unsolved
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 20/670 constraints. Problems are: Problem set: 6 solved, 373 unsolved
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
SMT process timed out in 40162ms, After SMT, problems are : Problem set: 6 solved, 373 unsolved
Search for dead transitions found 6 dead transitions in 40168ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 246/421 places, 389/559 transitions.
Graph (complete) has 583 edges and 246 vertex of which 245 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 243 transition count 387
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 243 transition count 387
Applied a total of 9 rules in 16 ms. Remains 243 /246 variables (removed 3) and now considering 387/389 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40300 ms. Remains : 243/421 places, 387/559 transitions.
RANDOM walk for 4000000 steps (381039 resets) in 20273 ms. (197 steps per ms) remains 3/212 properties
BEST_FIRST walk for 4000003 steps (65008 resets) in 1695 ms. (2358 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (64953 resets) in 1577 ms. (2534 steps per ms) remains 2/2 properties
// Phase 1: matrix 387 rows 243 cols
[2024-05-31 22:22:52] [INFO ] Computed 7 invariants in 7 ms
[2024-05-31 22:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 110/165 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 295/460 variables, 165/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/597 variables, 52/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/629 variables, 25/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/630 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/630 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 243/243 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 110/165 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 295/460 variables, 165/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 137/597 variables, 52/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/629 variables, 25/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/630 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 243/243 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 425ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 387/387 transitions.
Graph (complete) has 575 edges and 243 vertex of which 226 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 185 rules applied. Total rules applied 186 place count 226 transition count 193
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 115 rules applied. Total rules applied 301 place count 126 transition count 178
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 306 place count 121 transition count 178
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 306 place count 121 transition count 164
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 334 place count 107 transition count 164
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 383 place count 58 transition count 101
Iterating global reduction 3 with 49 rules applied. Total rules applied 432 place count 58 transition count 101
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 442 place count 48 transition count 91
Iterating global reduction 3 with 10 rules applied. Total rules applied 452 place count 48 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 456 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 459 place count 45 transition count 84
Iterating global reduction 4 with 3 rules applied. Total rules applied 462 place count 45 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 465 place count 45 transition count 81
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 471 place count 39 transition count 73
Iterating global reduction 5 with 6 rules applied. Total rules applied 477 place count 39 transition count 73
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 489 place count 39 transition count 61
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 491 place count 37 transition count 59
Iterating global reduction 6 with 2 rules applied. Total rules applied 493 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 495 place count 37 transition count 57
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 509 place count 30 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 515 place count 27 transition count 54
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 517 place count 27 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 520 place count 27 transition count 51
Applied a total of 520 rules in 26 ms. Remains 27 /243 variables (removed 216) and now considering 51/387 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 27/243 places, 51/387 transitions.
RANDOM walk for 464 steps (50 resets) in 12 ms. (35 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 254 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 59200 ms.
ITS solved all properties within timeout

BK_STOP 1717194173621

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is HealthRecord-PT-16, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r498-tall-171640618000513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;