Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716700151.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 426K Mar 5 18:23 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 ShieldIIPs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679428298974

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:51:43] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-21 19:51:43] [INFO ] Transformed 1253 places.
[2023-03-21 19:51:43] [INFO ] Transformed 1203 transitions.
[2023-03-21 19:51:43] [INFO ] Found NUPN structural information;
[2023-03-21 19:51:43] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-21 19:51:44] [INFO ] Computed 451 place invariants in 20 ms
[2023-03-21 19:51:46] [INFO ] [Real]Absence check using 451 positive place invariants in 672 ms returned sat
[2023-03-21 19:51:46] [INFO ] After 1488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:51:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 382 ms returned sat
[2023-03-21 19:51:51] [INFO ] After 3997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:51:51] [INFO ] Deduced a trap composed of 11 places in 569 ms of which 22 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 1 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2023-03-21 19:51:53] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2023-03-21 19:51:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-21 19:51:53] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-21 19:51:53] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-21 19:51:54] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 0 ms to minimize.
[2023-03-21 19:51:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-21 19:51:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3581 ms
[2023-03-21 19:51:56] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2023-03-21 19:51:56] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2023-03-21 19:51:57] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 2 ms to minimize.
[2023-03-21 19:51:57] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2023-03-21 19:51:57] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-21 19:51:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:51:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1994 ms
[2023-03-21 19:51:58] [INFO ] After 11645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4219 ms.
[2023-03-21 19:52:02] [INFO ] After 16946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 682 ms.
Support contains 67 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 322 place count 1252 transition count 1202
Applied a total of 322 rules in 529 ms. Remains 1252 /1253 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 1252/1253 places, 1202/1203 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-21 19:52:04] [INFO ] Computed 451 place invariants in 74 ms
[2023-03-21 19:52:05] [INFO ] [Real]Absence check using 446 positive place invariants in 79 ms returned sat
[2023-03-21 19:52:05] [INFO ] [Real]Absence check using 446 positive and 5 generalized place invariants in 15 ms returned sat
[2023-03-21 19:52:05] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:52:05] [INFO ] [Nat]Absence check using 446 positive place invariants in 138 ms returned sat
[2023-03-21 19:52:05] [INFO ] [Nat]Absence check using 446 positive and 5 generalized place invariants in 26 ms returned sat
[2023-03-21 19:52:09] [INFO ] After 3648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:52:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:52:10] [INFO ] After 934ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 19:52:14] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-21 19:52:23] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 0 ms to minimize.
[2023-03-21 19:52:26] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-21 19:52:30] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 16242 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:52:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:52:30] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 414 ms.
Support contains 35 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 1252 transition count 1202
Applied a total of 15 rules in 82 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 127753 steps, run timeout after 3044 ms. (steps per millisecond=41 ) properties seen :{1=1}
Probabilistic random walk after 127753 steps, saw 100534 distinct states, run finished after 3046 ms. (steps per millisecond=41 ) properties seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-21 19:52:34] [INFO ] Computed 451 place invariants in 68 ms
[2023-03-21 19:52:35] [INFO ] [Real]Absence check using 445 positive place invariants in 109 ms returned sat
[2023-03-21 19:52:35] [INFO ] [Real]Absence check using 445 positive and 6 generalized place invariants in 53 ms returned sat
[2023-03-21 19:52:35] [INFO ] After 1498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:52:36] [INFO ] [Nat]Absence check using 445 positive place invariants in 115 ms returned sat
[2023-03-21 19:52:36] [INFO ] [Nat]Absence check using 445 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-21 19:52:40] [INFO ] After 3839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:52:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:52:40] [INFO ] After 144ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:52:41] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 15 ms to minimize.
[2023-03-21 19:52:44] [INFO ] Deduced a trap composed of 15 places in 764 ms of which 1 ms to minimize.
[2023-03-21 19:52:44] [INFO ] Deduced a trap composed of 9 places in 639 ms of which 0 ms to minimize.
[2023-03-21 19:52:45] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-21 19:52:45] [INFO ] Deduced a trap composed of 9 places in 521 ms of which 0 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 1 ms to minimize.
[2023-03-21 19:52:46] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 2 ms to minimize.
[2023-03-21 19:52:47] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2023-03-21 19:52:48] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 1 ms to minimize.
[2023-03-21 19:52:48] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 21 places in 638 ms of which 0 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 7 ms to minimize.
[2023-03-21 19:52:49] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 0 ms to minimize.
[2023-03-21 19:52:50] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:52:50] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2023-03-21 19:52:50] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 0 ms to minimize.
[2023-03-21 19:52:51] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 0 ms to minimize.
[2023-03-21 19:52:51] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-21 19:52:53] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2023-03-21 19:52:54] [INFO ] Deduced a trap composed of 9 places in 688 ms of which 1 ms to minimize.
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-21 19:52:55] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 0 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2023-03-21 19:52:56] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-21 19:52:57] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 13 ms to minimize.
[2023-03-21 19:52:57] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-21 19:52:58] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 15 ms to minimize.
[2023-03-21 19:52:58] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-21 19:52:58] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 0 ms to minimize.
[2023-03-21 19:52:59] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2023-03-21 19:52:59] [INFO ] Deduced a trap composed of 9 places in 447 ms of which 0 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 21 places in 475 ms of which 0 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-21 19:53:00] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 19616 ms
[2023-03-21 19:53:00] [INFO ] After 20568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-21 19:53:00] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 79 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 1252 transition count 1202
Applied a total of 13 rules in 64 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 183482 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183482 steps, saw 175819 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-21 19:53:04] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-21 19:53:04] [INFO ] [Real]Absence check using 450 positive place invariants in 138 ms returned sat
[2023-03-21 19:53:04] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 19:53:06] [INFO ] After 1919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:06] [INFO ] [Nat]Absence check using 450 positive place invariants in 103 ms returned sat
[2023-03-21 19:53:06] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 19:53:08] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:53:08] [INFO ] After 182ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:08] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-21 19:53:09] [INFO ] Deduced a trap composed of 9 places in 466 ms of which 1 ms to minimize.
[2023-03-21 19:53:09] [INFO ] Deduced a trap composed of 9 places in 489 ms of which 1 ms to minimize.
[2023-03-21 19:53:10] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 14 ms to minimize.
[2023-03-21 19:53:10] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 9 places in 442 ms of which 15 ms to minimize.
[2023-03-21 19:53:11] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2023-03-21 19:53:12] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
[2023-03-21 19:53:12] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 14 ms to minimize.
[2023-03-21 19:53:12] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 23 ms to minimize.
[2023-03-21 19:53:13] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 1 ms to minimize.
[2023-03-21 19:53:13] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 1 ms to minimize.
[2023-03-21 19:53:13] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-21 19:53:14] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-21 19:53:14] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2023-03-21 19:53:14] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-21 19:53:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6119 ms
[2023-03-21 19:53:14] [INFO ] After 6559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-21 19:53:14] [INFO ] After 8481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 34 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 33 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-21 19:53:14] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] Implicit Places using invariants in 1796 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1834 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 33 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1901 ms. Remains : 1251/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 172990 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172990 steps, saw 166006 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-21 19:53:20] [INFO ] Computed 450 place invariants in 8 ms
[2023-03-21 19:53:20] [INFO ] [Real]Absence check using 449 positive place invariants in 156 ms returned sat
[2023-03-21 19:53:20] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 19:53:21] [INFO ] After 1320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:21] [INFO ] [Nat]Absence check using 449 positive place invariants in 189 ms returned sat
[2023-03-21 19:53:21] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 39 ms returned sat
[2023-03-21 19:53:25] [INFO ] After 3597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:26] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2023-03-21 19:53:26] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-21 19:53:26] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 1 ms to minimize.
[2023-03-21 19:53:27] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2023-03-21 19:53:28] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-21 19:53:29] [INFO ] Deduced a trap composed of 9 places in 421 ms of which 1 ms to minimize.
[2023-03-21 19:53:30] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:53:30] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-21 19:53:30] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-21 19:53:31] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-21 19:53:31] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-21 19:53:31] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2023-03-21 19:53:31] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-21 19:53:31] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-21 19:53:32] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-21 19:53:32] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-21 19:53:32] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 0 ms to minimize.
[2023-03-21 19:53:32] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-21 19:53:33] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-21 19:53:33] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-21 19:53:33] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 19:53:34] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 0 ms to minimize.
[2023-03-21 19:53:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:53:34] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8599 ms
[2023-03-21 19:53:34] [INFO ] After 12540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-21 19:53:34] [INFO ] After 13300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-21 19:53:34] [INFO ] Invariant cache hit.
[2023-03-21 19:53:36] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2023-03-21 19:53:36] [INFO ] Invariant cache hit.
[2023-03-21 19:53:39] [INFO ] Implicit Places using invariants and state equation in 3463 ms returned []
Implicit Place search using SMT with State Equation took 4992 ms to find 0 implicit places.
[2023-03-21 19:53:39] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-21 19:53:39] [INFO ] Invariant cache hit.
[2023-03-21 19:53:41] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6521 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 19:53:41] [INFO ] Invariant cache hit.
[2023-03-21 19:53:41] [INFO ] [Real]Absence check using 449 positive place invariants in 87 ms returned sat
[2023-03-21 19:53:41] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-21 19:53:42] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:53:42] [INFO ] [Nat]Absence check using 449 positive place invariants in 144 ms returned sat
[2023-03-21 19:53:42] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-21 19:53:45] [INFO ] After 2117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:45] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-21 19:53:46] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2023-03-21 19:53:46] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2023-03-21 19:53:46] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-21 19:53:47] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 0 ms to minimize.
[2023-03-21 19:53:47] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-21 19:53:47] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 1 ms to minimize.
[2023-03-21 19:53:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-21 19:53:48] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-21 19:53:48] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-21 19:53:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3125 ms
[2023-03-21 19:53:48] [INFO ] After 5785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-21 19:53:49] [INFO ] After 6614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:53:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2023-03-21 19:53:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1251 places, 1202 transitions and 6137 arcs took 29 ms.
[2023-03-21 19:53:49] [INFO ] Flatten gal took : 252 ms
Total runtime 126783 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/857/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6517344 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096552 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-050A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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