About the Execution of LTSMin+red for BugTracking-PT-q3m032
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16188.855 | 164011.00 | 280297.00 | 235.00 | FF???FTTFTTTT?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399300353.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q3m032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717223413551
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:30:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:30:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:30:16] [INFO ] Load time of PNML (sax parser for PT used): 1319 ms
[2024-06-01 06:30:16] [INFO ] Transformed 754 places.
[2024-06-01 06:30:17] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:30:17] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1733 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Deduced a syphon composed of 514 places in 151 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 141 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-06-01 06:30:17] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:30:17] [INFO ] Computed 8 invariants in 45 ms
[2024-06-01 06:30:18] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-06-01 06:30:18] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:30:18] [INFO ] Invariant cache hit.
[2024-06-01 06:30:19] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:30:20] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:30:20] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:30:20] [INFO ] Invariant cache hit.
[2024-06-01 06:30:20] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 14 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 7 places in 454 ms of which 1 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 11 constraints, problems are : Problem set: 0 solved, 2748 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/2748 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2748 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 3/11 constraints. Problems are: Problem set: 9 solved, 2739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 11 constraints, problems are : Problem set: 9 solved, 2739 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 0/2748 constraints, Known Traps: 3/3 constraints]
After SMT, in 87837ms problems are : Problem set: 9 solved, 2739 unsolved
Search for dead transitions found 9 dead transitions in 87903ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2741/2769 transitions.
Reduce places removed 1 places and 29 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 235 transition count 2683
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 235 transition count 2683
Applied a total of 3 rules in 57 ms. Remains 235 /237 variables (removed 2) and now considering 2683/2741 (removed 58) transitions.
[2024-06-01 06:31:48] [INFO ] Flow matrix only has 2562 transitions (discarded 121 similar events)
// Phase 1: matrix 2562 rows 235 cols
[2024-06-01 06:31:48] [INFO ] Computed 8 invariants in 17 ms
[2024-06-01 06:31:54] [INFO ] Implicit Places using invariants in 5723 ms returned []
[2024-06-01 06:31:54] [INFO ] Flow matrix only has 2562 transitions (discarded 121 similar events)
[2024-06-01 06:31:54] [INFO ] Invariant cache hit.
[2024-06-01 06:31:55] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-06-01 06:31:56] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 7824 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/240 places, 2683/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98907 ms. Remains : 235/240 places, 2683/2769 transitions.
Support contains 20 out of 235 places after structural reductions.
[2024-06-01 06:31:57] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 06:31:57] [INFO ] Flatten gal took : 442 ms
[2024-06-01 06:31:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:31:57] [INFO ] Flatten gal took : 272 ms
[2024-06-01 06:31:58] [INFO ] Input system was already deterministic with 2683 transitions.
Support contains 10 out of 235 places (down from 20) after GAL structural reductions.
FORMULA BugTracking-PT-q3m032-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40018 steps (52 resets) in 3903 ms. (10 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 201 ms. (198 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (14 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
[2024-06-01 06:32:00] [INFO ] Flow matrix only has 2562 transitions (discarded 121 similar events)
[2024-06-01 06:32:00] [INFO ] Invariant cache hit.
[2024-06-01 06:32:00] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/61 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1160/1221 variables, 61/64 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1221 variables, 4/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1221 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 950/2171 variables, 65/133 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2171 variables, 154/287 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2171 variables, 0/287 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/2173 variables, 2/289 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2173 variables, 2/291 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2173 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 571/2744 variables, 77/368 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2744 variables, 1/369 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2744 variables, 67/436 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2744 variables, 0/436 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 4/2748 variables, 1/437 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2748 variables, 0/437 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 49/2797 variables, 30/467 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2797 variables, 1/468 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2797 variables, 7/475 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2797 variables, 0/475 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2797 variables, 0/475 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2797/2797 variables, and 475 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 462/495 variables, 33/35 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 4/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1647/2142 variables, 66/105 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2142 variables, 1/106 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2142 variables, 154/260 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 2/262 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 2/264 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2142 variables, 0/264 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 12 (OVERLAPS) 2/2144 variables, 2/266 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2144 variables, 2/268 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 06:32:03] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2144 variables, 1/269 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2144 variables, 0/269 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 600/2744 variables, 104/373 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2744 variables, 1/374 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2744 variables, 67/441 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2744 variables, 1/442 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 06:32:03] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 1 ms to minimize.
[2024-06-01 06:32:04] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2744 variables, 2/444 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2744 variables, 0/444 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2748 variables, 1/445 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2748 variables, 0/445 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/2797 variables, 30/475 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2797 variables, 1/476 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2797 variables, 7/483 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-01 06:32:05] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 4 ms to minimize.
[2024-06-01 06:32:05] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2797 variables, 2/485 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2797 variables, 0/485 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2797 variables, 0/485 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2797/2797 variables, and 485 constraints, problems are : Problem set: 5 solved, 2 unsolved in 3814 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 5694ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2683/2683 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 233 transition count 2686
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 233 transition count 2680
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 227 transition count 2680
Applied a total of 16 rules in 297 ms. Remains 227 /235 variables (removed 8) and now considering 2680/2683 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 227/235 places, 2680/2683 transitions.
RANDOM walk for 40076 steps (8 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153925 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153925 steps, saw 64416 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 06:32:09] [INFO ] Flow matrix only has 2554 transitions (discarded 126 similar events)
// Phase 1: matrix 2554 rows 227 cols
[2024-06-01 06:32:09] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 06:32:09] [INFO ] State equation strengthened by 233 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 433/465 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1672/2137 variables, 65/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2137 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2137 variables, 157/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2137 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 597/2734 variables, 103/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2734 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2734 variables, 67/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2734 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/2736 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2736 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 45/2781 variables, 27/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2781 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2781 variables, 7/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2781 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2781 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2781/2781 variables, and 468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 233/233 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 433/465 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1672/2137 variables, 65/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2137 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2137 variables, 157/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2137 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:32:12] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2137 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2137 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 597/2734 variables, 103/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2734 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2734 variables, 67/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2734 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2734 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/2736 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2736 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 45/2781 variables, 27/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2781 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2781 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:32:14] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 1 ms to minimize.
[2024-06-01 06:32:14] [INFO ] Deduced a trap composed of 43 places in 348 ms of which 3 ms to minimize.
[2024-06-01 06:32:14] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 13 ms to minimize.
[2024-06-01 06:32:16] [INFO ] Deduced a trap composed of 52 places in 1338 ms of which 9 ms to minimize.
[2024-06-01 06:32:16] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 1 ms to minimize.
[2024-06-01 06:32:16] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 2 ms to minimize.
[2024-06-01 06:32:17] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 1 ms to minimize.
[2024-06-01 06:32:17] [INFO ] Deduced a trap composed of 48 places in 527 ms of which 2 ms to minimize.
[2024-06-01 06:32:18] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 4 ms to minimize.
[2024-06-01 06:32:18] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 1 ms to minimize.
[2024-06-01 06:32:18] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 11 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2781 variables, 11/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2781 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2781 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2781/2781 variables, and 482 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8290 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 9639ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 245 ms.
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 2680/2680 transitions.
Applied a total of 0 rules in 69 ms. Remains 227 /227 variables (removed 0) and now considering 2680/2680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 227/227 places, 2680/2680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 2680/2680 transitions.
Applied a total of 0 rules in 193 ms. Remains 227 /227 variables (removed 0) and now considering 2680/2680 (removed 0) transitions.
[2024-06-01 06:32:19] [INFO ] Flow matrix only has 2554 transitions (discarded 126 similar events)
[2024-06-01 06:32:20] [INFO ] Invariant cache hit.
[2024-06-01 06:32:20] [INFO ] Implicit Places using invariants in 950 ms returned []
[2024-06-01 06:32:20] [INFO ] Flow matrix only has 2554 transitions (discarded 126 similar events)
[2024-06-01 06:32:20] [INFO ] Invariant cache hit.
[2024-06-01 06:32:21] [INFO ] State equation strengthened by 233 read => feed constraints.
[2024-06-01 06:32:23] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 3420 ms to find 0 implicit places.
[2024-06-01 06:32:23] [INFO ] Redundant transitions in 178 ms returned []
Running 2679 sub problems to find dead transitions.
[2024-06-01 06:32:23] [INFO ] Flow matrix only has 2554 transitions (discarded 126 similar events)
[2024-06-01 06:32:23] [INFO ] Invariant cache hit.
[2024-06-01 06:32:23] [INFO ] State equation strengthened by 233 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q3m032-CTLCardinality-2023-15
BK_STOP 1717223577562
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/644/ctl_0_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/644/ctl_1_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/644/ctl_2_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/644/ctl_3_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/644/ctl_4_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/644/ctl_5_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/644/ctl_6_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/644/ctl_7_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/644/ctl_8_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/644/ctl_9_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/644/ctl_10_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/644/ctl_11_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/644/ctl_12_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/644/ctl_13_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/644/ctl_14_
ctl formula name BugTracking-PT-q3m032-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/644/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="BugTracking-PT-q3m032"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BugTracking-PT-q3m032, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399300353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m032.tgz
mv BugTracking-PT-q3m032 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;