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.r106-tall-167814482200069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CloudReconfiguration-PT-309, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482200069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-309-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678314179892

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-309
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 22:23:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 22:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:23:01] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-08 22:23:01] [INFO ] Transformed 2585 places.
[2023-03-08 22:23:01] [INFO ] Transformed 3095 transitions.
[2023-03-08 22:23:01] [INFO ] Found NUPN structural information;
[2023-03-08 22:23:01] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA CloudReconfiguration-PT-309-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-08 22:23:01] [INFO ] Computed 4 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :3
FORMULA CloudReconfiguration-PT-309-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-309-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
[2023-03-08 22:23:01] [INFO ] Invariant cache hit.
[2023-03-08 22:23:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 22:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:03] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-08 22:23:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 22:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:05] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2023-03-08 22:23:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 157 ms.
[2023-03-08 22:23:09] [INFO ] Added : 120 causal constraints over 24 iterations in 3258 ms. Result :unknown
[2023-03-08 22:23:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:10] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2023-03-08 22:23:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 22:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:12] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2023-03-08 22:23:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-08 22:23:15] [INFO ] Added : 140 causal constraints over 28 iterations in 3466 ms. Result :unknown
[2023-03-08 22:23:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:17] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-08 22:23:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 22:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:18] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2023-03-08 22:23:19] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-08 22:23:22] [INFO ] Added : 130 causal constraints over 26 iterations in 3310 ms. Result :unknown
[2023-03-08 22:23:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:23] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-08 22:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-08 22:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:25] [INFO ] [Nat]Absence check using state equation in 1200 ms returned sat
[2023-03-08 22:23:25] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-08 22:23:29] [INFO ] Added : 135 causal constraints over 27 iterations in 3343 ms. Result :unknown
[2023-03-08 22:23:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:30] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2023-03-08 22:23:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:32] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2023-03-08 22:23:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-08 22:23:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 22:23:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 22:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:37] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-08 22:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:38] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2023-03-08 22:23:39] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-08 22:23:42] [INFO ] Added : 140 causal constraints over 28 iterations in 3501 ms. Result :unknown
[2023-03-08 22:23:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:43] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-08 22:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:45] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2023-03-08 22:23:45] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-08 22:23:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 22:23:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:50] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2023-03-08 22:23:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 22:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:52] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2023-03-08 22:23:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 124 ms.
[2023-03-08 22:23:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 22:23:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:57] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2023-03-08 22:23:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:23:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:23:58] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2023-03-08 22:23:58] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-08 22:24:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 22:24:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:24:03] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2023-03-08 22:24:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:24:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:24:05] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2023-03-08 22:24:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-08 22:24:08] [INFO ] Added : 125 causal constraints over 25 iterations in 3499 ms. Result :unknown
[2023-03-08 22:24:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:24:10] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2023-03-08 22:24:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:24:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:24:11] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2023-03-08 22:24:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-08 22:24:15] [INFO ] Added : 145 causal constraints over 29 iterations in 3536 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-309-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2938 edges and 2585 vertex of which 847 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 784 places
Drop transitions removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Graph (complete) has 2418 edges and 1801 vertex of which 1787 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1203 transitions
Trivial Post-agglo rules discarded 1203 transitions
Performed 1203 trivial Post agglomeration. Transition count delta: 1203
Iterating post reduction 0 with 1212 rules applied. Total rules applied 1214 place count 1787 transition count 917
Reduce places removed 1203 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1341 rules applied. Total rules applied 2555 place count 584 transition count 779
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 71 rules applied. Total rules applied 2626 place count 522 transition count 770
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 2635 place count 519 transition count 764
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 2643 place count 515 transition count 760
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 2653 place count 513 transition count 752
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2663 place count 505 transition count 750
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2663 place count 505 transition count 728
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2707 place count 483 transition count 728
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2786 place count 404 transition count 649
Iterating global reduction 7 with 79 rules applied. Total rules applied 2865 place count 404 transition count 649
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2865 place count 404 transition count 640
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2883 place count 395 transition count 640
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2943 place count 335 transition count 580
Iterating global reduction 7 with 60 rules applied. Total rules applied 3003 place count 335 transition count 580
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 35 rules applied. Total rules applied 3038 place count 335 transition count 545
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3065 place count 318 transition count 535
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 3071 place count 313 transition count 534
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3073 place count 312 transition count 533
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3094 place count 291 transition count 500
Iterating global reduction 11 with 21 rules applied. Total rules applied 3115 place count 291 transition count 500
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3124 place count 291 transition count 491
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3133 place count 282 transition count 473
Iterating global reduction 12 with 9 rules applied. Total rules applied 3142 place count 282 transition count 473
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3145 place count 279 transition count 467
Iterating global reduction 12 with 3 rules applied. Total rules applied 3148 place count 279 transition count 467
Performed 151 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 12 with 302 rules applied. Total rules applied 3450 place count 128 transition count 237
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3453 place count 128 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3459 place count 125 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3465 place count 125 transition count 225
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3471 place count 122 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3477 place count 122 transition count 216
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 15 with 68 rules applied. Total rules applied 3545 place count 88 transition count 256
Drop transitions removed 21 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 15 with 47 rules applied. Total rules applied 3592 place count 88 transition count 209
Discarding 22 places :
Symmetric choice reduction at 16 with 22 rule applications. Total rules 3614 place count 66 transition count 180
Iterating global reduction 16 with 22 rules applied. Total rules applied 3636 place count 66 transition count 180
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 3648 place count 66 transition count 168
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 3653 place count 61 transition count 158
Iterating global reduction 17 with 5 rules applied. Total rules applied 3658 place count 61 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 3663 place count 61 transition count 153
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 18 with 25 rules applied. Total rules applied 3688 place count 61 transition count 128
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3689 place count 60 transition count 125
Iterating global reduction 18 with 1 rules applied. Total rules applied 3690 place count 60 transition count 125
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3691 place count 59 transition count 124
Iterating global reduction 18 with 1 rules applied. Total rules applied 3692 place count 59 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3693 place count 59 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 3695 place count 58 transition count 122
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3696 place count 58 transition count 121
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 3700 place count 58 transition count 117
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 3705 place count 54 transition count 116
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3706 place count 54 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3707 place count 53 transition count 115
Applied a total of 3707 rules in 260 ms. Remains 53 /2585 variables (removed 2532) and now considering 115/3095 (removed 2980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 53/2585 places, 115/3095 transitions.
Normalized transition count is 110 out of 115 initially.
// Phase 1: matrix 110 rows 53 cols
[2023-03-08 22:24:16] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 14958 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 7) seen :7
FORMULA CloudReconfiguration-PT-309-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 75530 ms.
ITS solved all properties within timeout

BK_STOP 1678314257746

--------------------
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 UpperBounds -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="CloudReconfiguration-PT-309"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CloudReconfiguration-PT-309, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482200069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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