fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r345-tall-167889216600073
Last Updated
May 14, 2023

About the Execution of Smart+red for RERS17pb114-PT-6

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5273.928 1800000.00 1981801.00 3608.40 [undef] Time out reached

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.r345-tall-167889216600073.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 smartxred
Input is RERS17pb114-PT-6, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r345-tall-167889216600073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 04:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679126550437

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb114-PT-6
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 08:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 08:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:02:34] [INFO ] Load time of PNML (sax parser for PT used): 1891 ms
[2023-03-18 08:02:34] [INFO ] Transformed 1446 places.
[2023-03-18 08:02:34] [INFO ] Transformed 151085 transitions.
[2023-03-18 08:02:34] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2435 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1985 ms. (steps per millisecond=5 ) properties (out of 1446) seen :939
Running SMT prover for 507 properties.
[2023-03-18 08:02:38] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 08:02:39] [INFO ] Computed 35 place invariants in 425 ms
[2023-03-18 08:02:53] [INFO ] After 14433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:507
[2023-03-18 08:03:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 36 ms returned sat
[2023-03-18 08:03:05] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 23 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 08:03:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 08:03:18] [INFO ] After 25152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:507
Fused 507 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 507 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3209 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3223 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 196135 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 491
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=160 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=164 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=190 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=194 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 08:04:00] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 08:04:01] [INFO ] Computed 18 place invariants in 396 ms
[2023-03-18 08:04:01] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 08:04:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 08:04:38] [INFO ] After 36029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 08:04:39] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:05:03] [INFO ] After 23432ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-18 08:05:14] [INFO ] Deduced a trap composed of 64 places in 10075 ms of which 19 ms to minimize.
[2023-03-18 08:05:26] [INFO ] Deduced a trap composed of 40 places in 10603 ms of which 2 ms to minimize.
[2023-03-18 08:05:37] [INFO ] Deduced a trap composed of 64 places in 9989 ms of which 2 ms to minimize.
[2023-03-18 08:05:47] [INFO ] Deduced a trap composed of 64 places in 9094 ms of which 4 ms to minimize.
[2023-03-18 08:05:57] [INFO ] Deduced a trap composed of 40 places in 8182 ms of which 2 ms to minimize.
[2023-03-18 08:06:06] [INFO ] Deduced a trap composed of 64 places in 8335 ms of which 1 ms to minimize.
[2023-03-18 08:06:15] [INFO ] Deduced a trap composed of 64 places in 7669 ms of which 1 ms to minimize.
[2023-03-18 08:06:23] [INFO ] Deduced a trap composed of 96 places in 7282 ms of which 2 ms to minimize.
[2023-03-18 08:06:31] [INFO ] Deduced a trap composed of 96 places in 6734 ms of which 1 ms to minimize.
[2023-03-18 08:06:39] [INFO ] Deduced a trap composed of 96 places in 6531 ms of which 0 ms to minimize.
[2023-03-18 08:06:45] [INFO ] Deduced a trap composed of 128 places in 5594 ms of which 12 ms to minimize.
[2023-03-18 08:06:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 106936 ms
[2023-03-18 08:07:46] [INFO ] After 186825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 08:07:46] [INFO ] After 225059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1341 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1342 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 196652 steps, including 0 resets, run timeout after 30017 ms. (steps per millisecond=6 ) properties seen 7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4739 ms. (steps per millisecond=211 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4430 ms. (steps per millisecond=225 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4476 ms. (steps per millisecond=223 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4574 ms. (steps per millisecond=218 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4378 ms. (steps per millisecond=228 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4247 ms. (steps per millisecond=235 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-18 08:08:45] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:08:45] [INFO ] Invariant cache hit.
[2023-03-18 08:08:45] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 08:08:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:09:11] [INFO ] After 25558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 08:09:12] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:09:24] [INFO ] After 11706ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 08:09:37] [INFO ] Deduced a trap composed of 40 places in 12369 ms of which 4 ms to minimize.
[2023-03-18 08:09:49] [INFO ] Deduced a trap composed of 64 places in 10908 ms of which 2 ms to minimize.
[2023-03-18 08:10:01] [INFO ] Deduced a trap composed of 40 places in 10508 ms of which 2 ms to minimize.
[2023-03-18 08:10:12] [INFO ] Deduced a trap composed of 96 places in 10556 ms of which 2 ms to minimize.
[2023-03-18 08:10:23] [INFO ] Deduced a trap composed of 64 places in 9376 ms of which 1 ms to minimize.
[2023-03-18 08:10:33] [INFO ] Deduced a trap composed of 64 places in 8568 ms of which 1 ms to minimize.
[2023-03-18 08:10:42] [INFO ] Deduced a trap composed of 96 places in 8485 ms of which 1 ms to minimize.
[2023-03-18 08:10:52] [INFO ] Deduced a trap composed of 64 places in 8102 ms of which 1 ms to minimize.
[2023-03-18 08:11:01] [INFO ] Deduced a trap composed of 128 places in 8042 ms of which 0 ms to minimize.
[2023-03-18 08:11:09] [INFO ] Deduced a trap composed of 96 places in 6837 ms of which 1 ms to minimize.
[2023-03-18 08:11:15] [INFO ] Deduced a trap composed of 96 places in 5572 ms of which 1 ms to minimize.
[2023-03-18 08:11:21] [INFO ] Deduced a trap composed of 64 places in 4866 ms of which 0 ms to minimize.
[2023-03-18 08:11:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 122393 ms
[2023-03-18 08:11:43] [INFO ] After 151506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5250 ms.
[2023-03-18 08:11:49] [INFO ] After 183458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1242 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 306026 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3941 ms. (steps per millisecond=253 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3643 ms. (steps per millisecond=274 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 08:12:28] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:12:28] [INFO ] Invariant cache hit.
[2023-03-18 08:12:28] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 08:12:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2023-03-18 08:12:51] [INFO ] After 22811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 08:12:52] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:13:01] [INFO ] After 8540ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 08:13:14] [INFO ] Deduced a trap composed of 40 places in 12004 ms of which 2 ms to minimize.
[2023-03-18 08:13:26] [INFO ] Deduced a trap composed of 64 places in 11068 ms of which 2 ms to minimize.
[2023-03-18 08:13:38] [INFO ] Deduced a trap composed of 96 places in 10527 ms of which 1 ms to minimize.
[2023-03-18 08:13:48] [INFO ] Deduced a trap composed of 64 places in 9406 ms of which 1 ms to minimize.
[2023-03-18 08:13:58] [INFO ] Deduced a trap composed of 64 places in 8967 ms of which 1 ms to minimize.
[2023-03-18 08:14:08] [INFO ] Deduced a trap composed of 40 places in 8679 ms of which 4 ms to minimize.
[2023-03-18 08:14:17] [INFO ] Deduced a trap composed of 128 places in 8210 ms of which 1 ms to minimize.
[2023-03-18 08:14:26] [INFO ] Deduced a trap composed of 64 places in 7674 ms of which 1 ms to minimize.
[2023-03-18 08:14:35] [INFO ] Deduced a trap composed of 96 places in 7122 ms of which 2 ms to minimize.
[2023-03-18 08:14:41] [INFO ] Deduced a trap composed of 64 places in 5716 ms of which 13 ms to minimize.
[2023-03-18 08:14:48] [INFO ] Deduced a trap composed of 96 places in 5622 ms of which 2 ms to minimize.
[2023-03-18 08:14:54] [INFO ] Deduced a trap composed of 64 places in 5045 ms of which 0 ms to minimize.
[2023-03-18 08:15:00] [INFO ] Deduced a trap composed of 96 places in 4776 ms of which 0 ms to minimize.
[2023-03-18 08:15:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 124297 ms
[2023-03-18 08:15:11] [INFO ] After 139173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2425 ms.
[2023-03-18 08:15:14] [INFO ] After 165445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1537 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1538 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 264631 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3198 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:15:49] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:15:49] [INFO ] Invariant cache hit.
[2023-03-18 08:15:49] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:15:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:16:12] [INFO ] After 22663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:16:13] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:16:21] [INFO ] After 8164ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:16:35] [INFO ] Deduced a trap composed of 64 places in 12959 ms of which 3 ms to minimize.
[2023-03-18 08:16:48] [INFO ] Deduced a trap composed of 40 places in 11068 ms of which 5 ms to minimize.
[2023-03-18 08:17:00] [INFO ] Deduced a trap composed of 64 places in 10792 ms of which 1 ms to minimize.
[2023-03-18 08:17:12] [INFO ] Deduced a trap composed of 96 places in 11466 ms of which 2 ms to minimize.
[2023-03-18 08:17:24] [INFO ] Deduced a trap composed of 96 places in 10086 ms of which 2 ms to minimize.
[2023-03-18 08:17:34] [INFO ] Deduced a trap composed of 40 places in 8886 ms of which 2 ms to minimize.
[2023-03-18 08:17:44] [INFO ] Deduced a trap composed of 64 places in 8604 ms of which 2 ms to minimize.
[2023-03-18 08:17:53] [INFO ] Deduced a trap composed of 96 places in 8521 ms of which 1 ms to minimize.
[2023-03-18 08:18:02] [INFO ] Deduced a trap composed of 64 places in 7890 ms of which 1 ms to minimize.
[2023-03-18 08:18:11] [INFO ] Deduced a trap composed of 96 places in 7324 ms of which 0 ms to minimize.
[2023-03-18 08:18:19] [INFO ] Deduced a trap composed of 128 places in 6542 ms of which 0 ms to minimize.
[2023-03-18 08:18:26] [INFO ] Deduced a trap composed of 128 places in 5462 ms of which 1 ms to minimize.
[2023-03-18 08:18:31] [INFO ] Deduced a trap composed of 64 places in 4057 ms of which 1 ms to minimize.
[2023-03-18 08:18:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 133971 ms
[2023-03-18 08:18:36] [INFO ] After 142902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1307 ms.
[2023-03-18 08:18:37] [INFO ] After 168163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1224 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1224 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 287372 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3494 ms. (steps per millisecond=286 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 163640 steps, run timeout after 99001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 163640 steps, saw 151727 distinct states, run finished after 99003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:20:52] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:20:52] [INFO ] Invariant cache hit.
[2023-03-18 08:20:52] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:20:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2023-03-18 08:21:15] [INFO ] After 22953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:21:16] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:21:25] [INFO ] After 8494ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:21:38] [INFO ] Deduced a trap composed of 64 places in 12405 ms of which 2 ms to minimize.
[2023-03-18 08:21:50] [INFO ] Deduced a trap composed of 40 places in 11025 ms of which 2 ms to minimize.
[2023-03-18 08:22:03] [INFO ] Deduced a trap composed of 64 places in 11217 ms of which 2 ms to minimize.
[2023-03-18 08:22:14] [INFO ] Deduced a trap composed of 96 places in 10123 ms of which 2 ms to minimize.
[2023-03-18 08:22:25] [INFO ] Deduced a trap composed of 96 places in 9340 ms of which 17 ms to minimize.
[2023-03-18 08:22:34] [INFO ] Deduced a trap composed of 40 places in 8432 ms of which 1 ms to minimize.
[2023-03-18 08:22:44] [INFO ] Deduced a trap composed of 64 places in 8388 ms of which 1 ms to minimize.
[2023-03-18 08:22:53] [INFO ] Deduced a trap composed of 96 places in 7744 ms of which 1 ms to minimize.
[2023-03-18 08:23:01] [INFO ] Deduced a trap composed of 64 places in 7460 ms of which 1 ms to minimize.
[2023-03-18 08:23:09] [INFO ] Deduced a trap composed of 96 places in 6945 ms of which 0 ms to minimize.
[2023-03-18 08:23:17] [INFO ] Deduced a trap composed of 128 places in 6283 ms of which 2 ms to minimize.
[2023-03-18 08:23:24] [INFO ] Deduced a trap composed of 128 places in 5497 ms of which 3 ms to minimize.
[2023-03-18 08:23:29] [INFO ] Deduced a trap composed of 64 places in 3999 ms of which 0 ms to minimize.
[2023-03-18 08:23:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 128623 ms
[2023-03-18 08:23:34] [INFO ] After 137885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1216 ms.
[2023-03-18 08:23:35] [INFO ] After 163497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1200 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1202 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1183 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 08:23:38] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:23:38] [INFO ] Invariant cache hit.
[2023-03-18 08:23:46] [INFO ] Implicit Places using invariants in 8522 ms returned []
Implicit Place search using SMT only with invariants took 8524 ms to find 0 implicit places.
[2023-03-18 08:23:46] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:23:46] [INFO ] Invariant cache hit.
[2023-03-18 08:24:16] [INFO ] Performed 88844/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 08:24:37] [INFO ] Dead Transitions using invariants and state equation in 51289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61019 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 13830 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:24:52] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:24:52] [INFO ] Invariant cache hit.
[2023-03-18 08:24:52] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-18 08:25:14] [INFO ] After 22130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 08:25:16] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:25:22] [INFO ] After 6910ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 08:25:38] [INFO ] Deduced a trap composed of 64 places in 13258 ms of which 5 ms to minimize.
[2023-03-18 08:25:50] [INFO ] Deduced a trap composed of 40 places in 10955 ms of which 2 ms to minimize.
[2023-03-18 08:26:02] [INFO ] Deduced a trap composed of 64 places in 10695 ms of which 2 ms to minimize.
[2023-03-18 08:26:14] [INFO ] Deduced a trap composed of 96 places in 11361 ms of which 2 ms to minimize.
[2023-03-18 08:26:25] [INFO ] Deduced a trap composed of 96 places in 9589 ms of which 2 ms to minimize.
[2023-03-18 08:26:35] [INFO ] Deduced a trap composed of 40 places in 8835 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 08:26:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 08:26:35] [INFO ] After 103105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 295596 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3456 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174509 steps, run timeout after 99008 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 174509 steps, saw 161795 distinct states, run finished after 99009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:28:48] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:28:48] [INFO ] Invariant cache hit.
[2023-03-18 08:28:48] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:28:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-18 08:29:10] [INFO ] After 21846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:29:11] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:29:17] [INFO ] After 6561ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:29:32] [INFO ] Deduced a trap composed of 64 places in 13343 ms of which 3 ms to minimize.
[2023-03-18 08:29:44] [INFO ] Deduced a trap composed of 40 places in 11538 ms of which 2 ms to minimize.
[2023-03-18 08:29:57] [INFO ] Deduced a trap composed of 64 places in 11585 ms of which 3 ms to minimize.
[2023-03-18 08:30:09] [INFO ] Deduced a trap composed of 96 places in 10164 ms of which 2 ms to minimize.
[2023-03-18 08:30:19] [INFO ] Deduced a trap composed of 96 places in 9547 ms of which 1 ms to minimize.
[2023-03-18 08:30:30] [INFO ] Deduced a trap composed of 40 places in 9101 ms of which 2 ms to minimize.
[2023-03-18 08:30:40] [INFO ] Deduced a trap composed of 64 places in 8660 ms of which 10 ms to minimize.
[2023-03-18 08:30:49] [INFO ] Deduced a trap composed of 96 places in 8339 ms of which 1 ms to minimize.
[2023-03-18 08:30:59] [INFO ] Deduced a trap composed of 64 places in 8132 ms of which 2 ms to minimize.
[2023-03-18 08:31:07] [INFO ] Deduced a trap composed of 96 places in 7522 ms of which 1 ms to minimize.
[2023-03-18 08:31:15] [INFO ] Deduced a trap composed of 128 places in 6516 ms of which 0 ms to minimize.
[2023-03-18 08:31:22] [INFO ] Deduced a trap composed of 128 places in 5743 ms of which 1 ms to minimize.
[2023-03-18 08:31:27] [INFO ] Deduced a trap composed of 64 places in 4149 ms of which 1 ms to minimize.
[2023-03-18 08:31:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 135031 ms
[2023-03-18 08:31:33] [INFO ] After 142369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1314 ms.
[2023-03-18 08:31:34] [INFO ] After 166399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1432 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1444 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 08:31:37] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:31:37] [INFO ] Invariant cache hit.
[2023-03-18 08:31:46] [INFO ] Implicit Places using invariants in 8973 ms returned []
Implicit Place search using SMT only with invariants took 8974 ms to find 0 implicit places.
[2023-03-18 08:31:46] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:31:46] [INFO ] Invariant cache hit.
[2023-03-18 08:32:16] [INFO ] Performed 86292/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15041084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16042720 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 StableMarking -timeout 180 -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="RERS17pb114-PT-6"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is RERS17pb114-PT-6, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r345-tall-167889216600073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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