About the Execution of LTSMin+red for DLCround-PT-11b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
935.035 | 31478.00 | 68189.00 | 624.30 | TFFFFTFTTTFTTTFT | normal |
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.r484-smll-171624275600254.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 DLCround-PT-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275600254
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 DLCround-PT-11b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717233592925
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:19:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:19:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:19:56] [INFO ] Load time of PNML (sax parser for PT used): 1412 ms
[2024-06-01 09:19:57] [INFO ] Transformed 4375 places.
[2024-06-01 09:19:57] [INFO ] Transformed 6991 transitions.
[2024-06-01 09:19:57] [INFO ] Found NUPN structural information;
[2024-06-01 09:19:57] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 1966 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2576 ms. (15 steps per ms) remains 7/13 properties
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 923 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1660 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
// Phase 1: matrix 6991 rows 4375 cols
[2024-06-01 09:20:00] [INFO ] Computed 244 invariants in 109 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 4148/4305 variables, 237/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4305 variables, 4148/4542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4305 variables, 0/4542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 70/4375 variables, 7/4549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4375 variables, 70/4619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4375/11366 variables, and 4619 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5091 ms.
Refiners :[Domain max(s): 4375/4375 constraints, Positive P Invariants (semi-flows): 244/244 constraints, State Equation: 0/4375 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 4148/4305 variables, 237/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4305 variables, 4148/4542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:20:09] [INFO ] Deduced a trap composed of 241 places in 792 ms of which 92 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4305/11366 variables, and 4543 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5044 ms.
Refiners :[Domain max(s): 4305/4375 constraints, Positive P Invariants (semi-flows): 237/244 constraints, State Equation: 0/4375 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 10654ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3735 edges and 4375 vertex of which 493 / 4375 are part of one of the 50 SCC in 27 ms
Free SCC test removed 443 places
Drop transitions (Empty/Sink Transition effects.) removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1539 transitions
Trivial Post-agglo rules discarded 1539 transitions
Performed 1539 trivial Post agglomeration. Transition count delta: 1539
Iterating post reduction 0 with 1539 rules applied. Total rules applied 1540 place count 3932 transition count 4949
Reduce places removed 1539 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 1613 rules applied. Total rules applied 3153 place count 2393 transition count 4875
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 37 rules applied. Total rules applied 3190 place count 2361 transition count 4870
Reduce places removed 2 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 3 with 64 rules applied. Total rules applied 3254 place count 2359 transition count 4808
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 64 rules applied. Total rules applied 3318 place count 2297 transition count 4806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3319 place count 2296 transition count 4806
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 3319 place count 2296 transition count 4768
Deduced a syphon composed of 38 places in 42 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 3395 place count 2258 transition count 4768
Discarding 508 places :
Symmetric choice reduction at 6 with 508 rule applications. Total rules 3903 place count 1750 transition count 4260
Iterating global reduction 6 with 508 rules applied. Total rules applied 4411 place count 1750 transition count 4260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 4413 place count 1750 transition count 4258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4414 place count 1749 transition count 4258
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 195 Pre rules applied. Total rules applied 4414 place count 1749 transition count 4063
Deduced a syphon composed of 195 places in 94 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 8 with 390 rules applied. Total rules applied 4804 place count 1554 transition count 4063
Discarding 45 places :
Symmetric choice reduction at 8 with 45 rule applications. Total rules 4849 place count 1509 transition count 3403
Iterating global reduction 8 with 45 rules applied. Total rules applied 4894 place count 1509 transition count 3403
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 4904 place count 1509 transition count 3393
Performed 380 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 380 places in 3 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 9 with 760 rules applied. Total rules applied 5664 place count 1129 transition count 3007
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 5666 place count 1129 transition count 3005
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 5677 place count 1118 transition count 2840
Iterating global reduction 10 with 11 rules applied. Total rules applied 5688 place count 1118 transition count 2840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5689 place count 1118 transition count 2839
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -947
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 11 with 194 rules applied. Total rules applied 5883 place count 1021 transition count 3786
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 11 with 153 rules applied. Total rules applied 6036 place count 1021 transition count 3633
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 6045 place count 1012 transition count 3326
Iterating global reduction 12 with 9 rules applied. Total rules applied 6054 place count 1012 transition count 3326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 6057 place count 1012 transition count 3323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6059 place count 1011 transition count 3335
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 6061 place count 1011 transition count 3333
Drop transitions (Redundant composition of simpler transitions.) removed 171 transitions
Redundant transition composition rules discarded 171 transitions
Iterating global reduction 14 with 171 rules applied. Total rules applied 6232 place count 1011 transition count 3162
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 6238 place count 1005 transition count 3045
Iterating global reduction 14 with 6 rules applied. Total rules applied 6244 place count 1005 transition count 3045
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 6250 place count 1005 transition count 3039
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 6251 place count 1005 transition count 3038
Free-agglomeration rule applied 379 times with reduction of 123 identical transitions.
Iterating global reduction 15 with 379 rules applied. Total rules applied 6630 place count 1005 transition count 2536
Reduce places removed 379 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 473 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 492 transitions.
Iterating post reduction 15 with 871 rules applied. Total rules applied 7501 place count 626 transition count 2044
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 7507 place count 620 transition count 2015
Iterating global reduction 16 with 6 rules applied. Total rules applied 7513 place count 620 transition count 2015
Drop transitions (Redundant composition of simpler transitions.) removed 185 transitions
Redundant transition composition rules discarded 185 transitions
Iterating global reduction 16 with 185 rules applied. Total rules applied 7698 place count 620 transition count 1830
Discarding 31 places :
Symmetric choice reduction at 16 with 31 rule applications. Total rules 7729 place count 589 transition count 1728
Iterating global reduction 16 with 31 rules applied. Total rules applied 7760 place count 589 transition count 1728
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 7762 place count 588 transition count 1729
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 7763 place count 588 transition count 1728
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 7775 place count 587 transition count 1717
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 7778 place count 587 transition count 1778
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 17 with 37 rules applied. Total rules applied 7815 place count 584 transition count 1744
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 18 with 29 rules applied. Total rules applied 7844 place count 584 transition count 1715
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 18 with 17 rules applied. Total rules applied 7861 place count 584 transition count 1715
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 7865 place count 584 transition count 1711
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 7866 place count 584 transition count 1711
Applied a total of 7866 rules in 2419 ms. Remains 584 /4375 variables (removed 3791) and now considering 1711/6991 (removed 5280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2439 ms. Remains : 584/4375 places, 1711/6991 transitions.
RANDOM walk for 40000 steps (8 resets) in 1025 ms. (38 steps per ms) remains 3/7 properties
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 3/3 properties
[2024-06-01 09:20:13] [INFO ] Flow matrix only has 1033 transitions (discarded 678 similar events)
// Phase 1: matrix 1033 rows 584 cols
[2024-06-01 09:20:13] [INFO ] Computed 208 invariants in 12 ms
[2024-06-01 09:20:13] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 469/568 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/584 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1033/1617 variables, 584/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1617 variables, 192/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1617 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1617/1617 variables, and 984 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 208/208 constraints, State Equation: 584/584 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 469/568 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/584 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1033/1617 variables, 584/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1617 variables, 192/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 3/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1617 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1617 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1617/1617 variables, and 987 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2429 ms.
Refiners :[Positive P Invariants (semi-flows): 208/208 constraints, State Equation: 584/584 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3832ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1495 ms.
Support contains 43 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1711/1711 transitions.
Graph (trivial) has 278 edges and 584 vertex of which 42 / 584 are part of one of the 12 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 554 transition count 1604
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 531 transition count 1602
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 530 transition count 1601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 529 transition count 1601
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 52 place count 529 transition count 1575
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 104 place count 503 transition count 1575
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 115 place count 492 transition count 1532
Iterating global reduction 4 with 11 rules applied. Total rules applied 126 place count 492 transition count 1532
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 212 place count 449 transition count 1488
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 4 with 121 rules applied. Total rules applied 333 place count 449 transition count 1367
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 365 place count 417 transition count 1252
Iterating global reduction 5 with 32 rules applied. Total rules applied 397 place count 417 transition count 1252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 398 place count 417 transition count 1251
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 426 place count 403 transition count 1320
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 477 place count 403 transition count 1269
Drop transitions (Redundant composition of simpler transitions.) removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 7 with 93 rules applied. Total rules applied 570 place count 403 transition count 1176
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 574 place count 399 transition count 1128
Iterating global reduction 7 with 4 rules applied. Total rules applied 578 place count 399 transition count 1128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 581 place count 399 transition count 1125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 585 place count 397 transition count 1123
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 599 place count 397 transition count 1109
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 610 place count 386 transition count 1068
Iterating global reduction 9 with 11 rules applied. Total rules applied 621 place count 386 transition count 1068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 622 place count 386 transition count 1067
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 624 place count 385 transition count 1078
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 636 place count 385 transition count 1066
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 637 place count 385 transition count 1065
Free-agglomeration rule applied 31 times with reduction of 1 identical transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 668 place count 385 transition count 1033
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 1161 edges and 354 vertex of which 333 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 11 with 113 rules applied. Total rules applied 781 place count 333 transition count 948
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 12 with 42 rules applied. Total rules applied 823 place count 333 transition count 906
Discarding 15 places :
Symmetric choice reduction at 13 with 15 rule applications. Total rules 838 place count 318 transition count 880
Iterating global reduction 13 with 15 rules applied. Total rules applied 853 place count 318 transition count 880
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 855 place count 317 transition count 882
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 864 place count 317 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 864 place count 317 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 866 place count 316 transition count 872
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 868 place count 316 transition count 870
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 870 place count 314 transition count 863
Iterating global reduction 14 with 2 rules applied. Total rules applied 872 place count 314 transition count 863
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 879 place count 314 transition count 863
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 880 place count 314 transition count 862
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 882 place count 313 transition count 861
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 888 place count 313 transition count 855
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 900 place count 307 transition count 849
Applied a total of 900 rules in 466 ms. Remains 307 /584 variables (removed 277) and now considering 849/1711 (removed 862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 307/584 places, 849/1711 transitions.
RANDOM walk for 40000 steps (8 resets) in 651 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 413338 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 413338 steps, saw 330332 distinct states, run finished after 3007 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-01 09:20:23] [INFO ] Flow matrix only has 486 transitions (discarded 363 similar events)
// Phase 1: matrix 486 rows 307 cols
[2024-06-01 09:20:23] [INFO ] Computed 139 invariants in 6 ms
[2024-06-01 09:20:23] [INFO ] State equation strengthened by 135 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/300 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/307 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/793 variables, 307/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 135/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/793 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 581 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 307/307 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/300 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/307 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/793 variables, 307/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 135/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/793 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 793/793 variables, and 582 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 307/307 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1277ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 29058 ms.
ITS solved all properties within timeout
BK_STOP 1717233624403
--------------------
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
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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DLCround-PT-11b, 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 r484-smll-171624275600254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11b.tgz
mv DLCround-PT-11b 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 '
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 ;