Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602600061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FlexibleBarrier-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 374K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716420215177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 23:23:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:23:36] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-22 23:23:36] [INFO ] Transformed 1402 places.
[2024-05-22 23:23:36] [INFO ] Transformed 1613 transitions.
[2024-05-22 23:23:36] [INFO ] Found NUPN structural information;
[2024-05-22 23:23:36] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1613 rows 1402 cols
[2024-05-22 23:23:36] [INFO ] Computed 12 invariants in 62 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (134 resets) in 52 ms. (188 steps per ms)
FORMULA FlexibleBarrier-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130013 steps (192 resets) in 131 ms. (984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 23:23:36] [INFO ] Invariant cache hit.
[2024-05-22 23:23:37] [INFO ] [Real]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:23:37] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-22 23:23:38] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 31 ms to minimize.
[2024-05-22 23:23:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:23:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 29 ms returned sat
[2024-05-22 23:23:39] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-22 23:23:39] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 4 ms to minimize.
[2024-05-22 23:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-05-22 23:23:39] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 113 ms.
[2024-05-22 23:23:43] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:23:43] [INFO ] [Real]Absence check using 12 positive place invariants in 39 ms returned sat
[2024-05-22 23:23:44] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-22 23:23:44] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 99 ms.
[2024-05-22 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:23:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:23:45] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-05-22 23:23:45] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 75 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2024-05-22 23:23:49] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:23:50] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-22 23:23:50] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 78 ms.
[2024-05-22 23:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:23:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 28 ms returned sat
[2024-05-22 23:23:51] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2024-05-22 23:23:51] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 81 ms.
[2024-05-22 23:23:55] [INFO ] Added : 290 causal constraints over 58 iterations in 4279 ms. Result :unknown
[2024-05-22 23:23:55] [INFO ] [Real]Absence check using 12 positive place invariants in 26 ms returned sat
[2024-05-22 23:23:56] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-05-22 23:23:56] [INFO ] Deduced a trap composed of 115 places in 375 ms of which 8 ms to minimize.
[2024-05-22 23:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:23:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:23:57] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-05-22 23:23:57] [INFO ] Deduced a trap composed of 115 places in 363 ms of which 6 ms to minimize.
[2024-05-22 23:23:58] [INFO ] Deduced a trap composed of 485 places in 353 ms of which 10 ms to minimize.
[2024-05-22 23:23:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 868 ms
[2024-05-22 23:23:58] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:24:02] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-22 23:24:02] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-22 23:24:02] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 3 ms to minimize.
[2024-05-22 23:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:03] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-22 23:24:03] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 2 ms to minimize.
[2024-05-22 23:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-22 23:24:03] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 77 ms.
[2024-05-22 23:24:07] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:24:08] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:08] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-05-22 23:24:08] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 7 ms to minimize.
[2024-05-22 23:24:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:09] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-05-22 23:24:10] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 7 ms to minimize.
[2024-05-22 23:24:10] [INFO ] Deduced a trap composed of 199 places in 291 ms of which 6 ms to minimize.
[2024-05-22 23:24:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 836 ms
[2024-05-22 23:24:10] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 74 ms.
[2024-05-22 23:24:14] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:24:14] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:14] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-22 23:24:15] [INFO ] Deduced a trap composed of 489 places in 410 ms of which 7 ms to minimize.
[2024-05-22 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:16] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-22 23:24:16] [INFO ] Deduced a trap composed of 489 places in 430 ms of which 6 ms to minimize.
[2024-05-22 23:24:16] [INFO ] Deduced a trap composed of 63 places in 418 ms of which 6 ms to minimize.
[2024-05-22 23:24:17] [INFO ] Deduced a trap composed of 473 places in 372 ms of which 6 ms to minimize.
[2024-05-22 23:24:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1427 ms
[2024-05-22 23:24:17] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 74 ms.
[2024-05-22 23:24:20] [INFO ] Added : 205 causal constraints over 41 iterations in 2929 ms. Result :unknown
[2024-05-22 23:24:20] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:21] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-22 23:24:21] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-22 23:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned sat
[2024-05-22 23:24:21] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-22 23:24:22] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-22 23:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-22 23:24:22] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 78 ms.
[2024-05-22 23:24:25] [INFO ] Added : 255 causal constraints over 51 iterations in 3804 ms. Result :sat
Minimization took 354 ms.
[2024-05-22 23:24:26] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2024-05-22 23:24:26] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-05-22 23:24:27] [INFO ] Deduced a trap composed of 488 places in 384 ms of which 7 ms to minimize.
[2024-05-22 23:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:28] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2024-05-22 23:24:28] [INFO ] Deduced a trap composed of 488 places in 362 ms of which 6 ms to minimize.
[2024-05-22 23:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2024-05-22 23:24:28] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 82 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 23:24:32] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2024-05-22 23:24:33] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-22 23:24:33] [INFO ] Deduced a trap composed of 62 places in 370 ms of which 6 ms to minimize.
[2024-05-22 23:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:34] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2024-05-22 23:24:34] [INFO ] Deduced a trap composed of 62 places in 395 ms of which 7 ms to minimize.
[2024-05-22 23:24:35] [INFO ] Deduced a trap composed of 450 places in 288 ms of which 5 ms to minimize.
[2024-05-22 23:24:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 814 ms
[2024-05-22 23:24:35] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 23:24:39] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:39] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-22 23:24:39] [INFO ] Deduced a trap composed of 96 places in 413 ms of which 7 ms to minimize.
[2024-05-22 23:24:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2024-05-22 23:24:40] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-05-22 23:24:41] [INFO ] Deduced a trap composed of 96 places in 382 ms of which 6 ms to minimize.
[2024-05-22 23:24:41] [INFO ] Deduced a trap composed of 486 places in 329 ms of which 5 ms to minimize.
[2024-05-22 23:24:41] [INFO ] Deduced a trap composed of 445 places in 304 ms of which 5 ms to minimize.
[2024-05-22 23:24:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1209 ms
[2024-05-22 23:24:42] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 77 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:24:45] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2024-05-22 23:24:45] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-22 23:24:45] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 72 ms.
[2024-05-22 23:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:46] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-22 23:24:46] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 84 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-22 23:24:51] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2024-05-22 23:24:51] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-22 23:24:51] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:24:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-22 23:24:52] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-22 23:24:52] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-22 23:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-22 23:24:52] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 71 ms.
Maximisation of solution failed !
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1352 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 18 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 352 place count 1350 transition count 1199
Reduce places removed 351 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 354 rules applied. Total rules applied 706 place count 999 transition count 1196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 709 place count 996 transition count 1196
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 709 place count 996 transition count 1110
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 881 place count 910 transition count 1110
Discarding 503 places :
Symmetric choice reduction at 3 with 503 rule applications. Total rules 1384 place count 407 transition count 607
Iterating global reduction 3 with 503 rules applied. Total rules applied 1887 place count 407 transition count 607
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1887 place count 407 transition count 599
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1903 place count 399 transition count 599
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 1980 place count 322 transition count 522
Iterating global reduction 3 with 77 rules applied. Total rules applied 2057 place count 322 transition count 522
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 3 with 74 rules applied. Total rules applied 2131 place count 322 transition count 448
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 2237 place count 269 transition count 395
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2257 place count 269 transition count 375
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2267 place count 259 transition count 365
Iterating global reduction 5 with 10 rules applied. Total rules applied 2277 place count 259 transition count 365
Free-agglomeration rule applied 189 times.
Iterating global reduction 5 with 189 rules applied. Total rules applied 2466 place count 259 transition count 176
Reduce places removed 189 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 268 rules applied. Total rules applied 2734 place count 70 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2735 place count 70 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2736 place count 69 transition count 96
Applied a total of 2736 rules in 287 ms. Remains 69 /1402 variables (removed 1333) and now considering 96/1613 (removed 1517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 69/1402 places, 96/1613 transitions.
// Phase 1: matrix 96 rows 69 cols
[2024-05-22 23:24:57] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1438 ms. (694 steps per ms)
FORMULA FlexibleBarrier-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 344 ms. (2898 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-22 23:24:59] [INFO ] Flatten gal took : 30 ms
[2024-05-22 23:24:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:24:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7457087620359991903.gal : 7 ms
[2024-05-22 23:24:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11744112145330726377.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7457087620359991903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11744112145330726377.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

ITS tools runner thread asked to quit. Dying gracefully.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 83344 ms.

BK_STOP 1716420299732

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10b, 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 r180-tall-171640602600061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b 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 ;