Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000303.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 364K 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 ShieldRVt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679309787461

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=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:56:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:56:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:56:29] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-20 10:56:29] [INFO ] Transformed 1503 places.
[2023-03-20 10:56:29] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:56:29] [INFO ] Found NUPN structural information;
[2023-03-20 10:56:29] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-03 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-20 10:56:30] [INFO ] Computed 121 place invariants in 27 ms
[2023-03-20 10:56:30] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 10:56:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2023-03-20 10:56:33] [INFO ] After 1666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 10:56:33] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 6 ms to minimize.
[2023-03-20 10:56:34] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 2 ms to minimize.
[2023-03-20 10:56:35] [INFO ] Deduced a trap composed of 24 places in 1480 ms of which 2 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 2 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 1 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2023-03-20 10:56:37] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 2 ms to minimize.
[2023-03-20 10:56:37] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 1 ms to minimize.
[2023-03-20 10:56:37] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 1 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 40 places in 404 ms of which 1 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 0 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 0 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 0 ms to minimize.
[2023-03-20 10:56:40] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 2 ms to minimize.
[2023-03-20 10:56:40] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 0 ms to minimize.
[2023-03-20 10:56:40] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 1 ms to minimize.
[2023-03-20 10:56:41] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 1 ms to minimize.
[2023-03-20 10:56:41] [INFO ] Deduced a trap composed of 60 places in 269 ms of which 1 ms to minimize.
[2023-03-20 10:56:41] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 1 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 1 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 1 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 0 ms to minimize.
[2023-03-20 10:56:43] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 25 ms to minimize.
[2023-03-20 10:56:43] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:56:43] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 1 ms to minimize.
[2023-03-20 10:56:43] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10308 ms
[2023-03-20 10:56:43] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-20 10:56:44] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 1 ms to minimize.
[2023-03-20 10:56:44] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2023-03-20 10:56:44] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2023-03-20 10:56:44] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-03-20 10:56:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1166 ms
[2023-03-20 10:56:45] [INFO ] Deduced a trap composed of 44 places in 663 ms of which 2 ms to minimize.
[2023-03-20 10:56:46] [INFO ] Deduced a trap composed of 30 places in 658 ms of which 2 ms to minimize.
[2023-03-20 10:56:46] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 3 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 36 places in 441 ms of which 1 ms to minimize.
[2023-03-20 10:56:48] [INFO ] Deduced a trap composed of 30 places in 427 ms of which 1 ms to minimize.
[2023-03-20 10:56:48] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 1 ms to minimize.
[2023-03-20 10:56:49] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 29 places in 401 ms of which 1 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 1 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 1 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 1 ms to minimize.
[2023-03-20 10:56:51] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 0 ms to minimize.
[2023-03-20 10:56:51] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2023-03-20 10:56:52] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 1 ms to minimize.
[2023-03-20 10:56:52] [INFO ] Deduced a trap composed of 43 places in 320 ms of which 0 ms to minimize.
[2023-03-20 10:56:53] [INFO ] Deduced a trap composed of 56 places in 284 ms of which 1 ms to minimize.
[2023-03-20 10:56:53] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 1 ms to minimize.
[2023-03-20 10:56:53] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 1 ms to minimize.
[2023-03-20 10:56:54] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 1 ms to minimize.
[2023-03-20 10:56:54] [INFO ] Deduced a trap composed of 28 places in 567 ms of which 1 ms to minimize.
[2023-03-20 10:56:55] [INFO ] Deduced a trap composed of 67 places in 529 ms of which 2 ms to minimize.
[2023-03-20 10:56:56] [INFO ] Deduced a trap composed of 45 places in 546 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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-20 10:56:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 10:56:56] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 548 ms.
Support contains 158 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1503 transition count 1175
Reduce places removed 328 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 1 with 375 rules applied. Total rules applied 703 place count 1175 transition count 1128
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 750 place count 1128 transition count 1128
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 750 place count 1128 transition count 1004
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 998 place count 1004 transition count 1004
Discarding 171 places :
Symmetric choice reduction at 3 with 171 rule applications. Total rules 1169 place count 833 transition count 833
Iterating global reduction 3 with 171 rules applied. Total rules applied 1340 place count 833 transition count 833
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1340 place count 833 transition count 780
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1446 place count 780 transition count 780
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 236
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1918 place count 544 transition count 544
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 2026 place count 490 transition count 567
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 2037 place count 490 transition count 556
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 2048 place count 479 transition count 556
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2049 place count 479 transition count 555
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 2054 place count 479 transition count 555
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2055 place count 479 transition count 555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2056 place count 478 transition count 554
Applied a total of 2056 rules in 592 ms. Remains 478 /1503 variables (removed 1025) and now considering 554/1503 (removed 949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 478/1503 places, 554/1503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 554 rows 478 cols
[2023-03-20 10:56:58] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:58] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:56:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-20 10:56:58] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 10:56:59] [INFO ] After 326ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 5 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-20 10:56:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 717 ms
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2023-03-20 10:57:00] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-20 10:57:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-20 10:57:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 542 ms
[2023-03-20 10:57:01] [INFO ] After 2206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-20 10:57:01] [INFO ] After 3233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 98 ms.
Support contains 157 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 554/554 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 477 transition count 553
Applied a total of 2 rules in 28 ms. Remains 477 /478 variables (removed 1) and now considering 553/554 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 477/478 places, 553/554 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 192777 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192777 steps, saw 108101 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 553 rows 477 cols
[2023-03-20 10:57:05] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 10:57:05] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:57:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 10:57:06] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:57:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 10:57:06] [INFO ] After 406ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:57:06] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 3 ms to minimize.
[2023-03-20 10:57:06] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-20 10:57:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-20 10:57:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-20 10:57:06] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 645 ms
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 15 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 609 ms
[2023-03-20 10:57:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-20 10:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-20 10:57:08] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-20 10:57:08] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-20 10:57:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-20 10:57:08] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2023-03-20 10:57:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-20 10:57:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-03-20 10:57:08] [INFO ] After 2488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-20 10:57:08] [INFO ] After 3442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 90 ms.
Support contains 157 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 553/553 transitions.
Applied a total of 0 rules in 17 ms. Remains 477 /477 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 477/477 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 553/553 transitions.
Applied a total of 0 rules in 13 ms. Remains 477 /477 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2023-03-20 10:57:08] [INFO ] Invariant cache hit.
[2023-03-20 10:57:09] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-20 10:57:09] [INFO ] Invariant cache hit.
[2023-03-20 10:57:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 10:57:09] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-20 10:57:09] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 10:57:09] [INFO ] Invariant cache hit.
[2023-03-20 10:57:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1022 ms. Remains : 477/477 places, 553/553 transitions.
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 477 transition count 538
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 27 place count 477 transition count 538
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 477 transition count 533
Applied a total of 32 rules in 41 ms. Remains 477 /477 variables (removed 0) and now considering 533/553 (removed 20) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 533 rows 477 cols
[2023-03-20 10:57:09] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 10:57:10] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:57:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 10:57:10] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:57:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-20 10:57:10] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-20 10:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-03-20 10:57:10] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-20 10:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-20 10:57:11] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2023-03-20 10:57:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 989 ms
[2023-03-20 10:57:12] [INFO ] After 2391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 363 ms.
[2023-03-20 10:57:12] [INFO ] After 2879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:57:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 10:57:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 477 places, 553 transitions and 2076 arcs took 5 ms.
[2023-03-20 10:57:13] [INFO ] Flatten gal took : 76 ms
Total runtime 44396 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/821/inv_0_ --invariant=/tmp/821/inv_1_ --invariant=/tmp/821/inv_2_ --invariant=/tmp/821/inv_3_ --invariant=/tmp/821/inv_4_ --inv-par
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679309835109

--------------------
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.202303021504.jar
+ 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
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/821/inv_0_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/821/inv_1_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/821/inv_2_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/821/inv_3_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/821/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 477 places, 553 transitions and 2076 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_030B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 553->404 groups
pnml2lts-sym: Regrouping took 0.130 real 0.130 user 0.000 sys
pnml2lts-sym: state vector length is 477; there are 404 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/821/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/821/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/821/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/821/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 164827 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.150 real 4.600 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 1.94050755828241e+62 states, 9005 nodes
pnml2lts-sym: group_next: 4548 nodes total
pnml2lts-sym: group_explored: 3616 nodes, 5480 short vectors total
pnml2lts-sym: max token count: 1

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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r425-tajo-167905978000303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B 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 ;