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.r233-tall-167856419000534.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 ltsminxred
Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679549682526

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 05:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 05:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:34:44] [INFO ] Load time of PNML (sax parser for PT used): 551 ms
[2023-03-23 05:34:44] [INFO ] Transformed 21462 places.
[2023-03-23 05:34:45] [INFO ] Transformed 21129 transitions.
[2023-03-23 05:34:45] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 725 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 386 resets, run finished after 866 ms. (steps per millisecond=11 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-23 05:34:49] [INFO ] Computed 333 place invariants in 2787 ms
[2023-03-23 05:34:55] [INFO ] After 5636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 05:35:00] [INFO ] [Nat]Absence check using 67 positive place invariants in 70 ms returned sat
[2023-03-23 05:35:01] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 1016 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 05:35:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 05:35:20] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 226 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 12053 are kept as prefixes of interest. Removing 9409 places using SCC suffix rule.44 ms
Discarding 9409 places :
Also discarding 3267 output transitions
Drop transitions removed 3267 transitions
Drop transitions removed 1936 transitions
Reduce isomorphic transitions removed 1936 transitions.
Drop transitions removed 3371 transitions
Trivial Post-agglo rules discarded 3371 transitions
Performed 3371 trivial Post agglomeration. Transition count delta: 3371
Iterating post reduction 0 with 5307 rules applied. Total rules applied 5308 place count 12053 transition count 12555
Reduce places removed 3372 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 3414 rules applied. Total rules applied 8722 place count 8681 transition count 12513
Reduce places removed 42 places and 0 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 2 with 145 rules applied. Total rules applied 8867 place count 8639 transition count 12410
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 3 with 103 rules applied. Total rules applied 8970 place count 8536 transition count 12410
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 8970 place count 8536 transition count 12292
Deduced a syphon composed of 118 places in 8 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 9206 place count 8418 transition count 12292
Discarding 2128 places :
Symmetric choice reduction at 4 with 2128 rule applications. Total rules 11334 place count 6290 transition count 10164
Iterating global reduction 4 with 2128 rules applied. Total rules applied 13462 place count 6290 transition count 10164
Discarding 1954 places :
Symmetric choice reduction at 4 with 1954 rule applications. Total rules 15416 place count 4336 transition count 8210
Iterating global reduction 4 with 1954 rules applied. Total rules applied 17370 place count 4336 transition count 8210
Free-agglomeration rule (complex) applied 67 times.
Iterating global reduction 4 with 67 rules applied. Total rules applied 17437 place count 4336 transition count 8143
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 17504 place count 4269 transition count 8143
Partial Free-agglomeration rule applied 1033 times.
Drop transitions removed 1033 transitions
Iterating global reduction 5 with 1033 rules applied. Total rules applied 18537 place count 4269 transition count 8143
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 5 with 12 rules applied. Total rules applied 18549 place count 4257 transition count 8143
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 18559 place count 4257 transition count 8133
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 18569 place count 4247 transition count 8133
Applied a total of 18569 rules in 6439 ms. Remains 4247 /21462 variables (removed 17215) and now considering 8133/21129 (removed 12996) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6441 ms. Remains : 4247/21462 places, 8133/21129 transitions.
Incomplete random walk after 10000 steps, including 776 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 5) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:35:27] [INFO ] Flow matrix only has 7566 transitions (discarded 567 similar events)
// Phase 1: matrix 7566 rows 4247 cols
[2023-03-23 05:35:27] [INFO ] Computed 102 place invariants in 144 ms
[2023-03-23 05:35:28] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:35:28] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 48 ms returned sat
[2023-03-23 05:35:33] [INFO ] After 4726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:35:35] [INFO ] After 6401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1252 ms.
[2023-03-23 05:35:36] [INFO ] After 8404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 131 out of 4247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4247/4247 places, 8133/8133 transitions.
Graph (complete) has 19094 edges and 4247 vertex of which 3741 are kept as prefixes of interest. Removing 506 places using SCC suffix rule.3 ms
Discarding 506 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 457 transitions
Reduce isomorphic transitions removed 457 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 472 rules applied. Total rules applied 473 place count 3741 transition count 7639
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 488 place count 3726 transition count 7639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 488 place count 3726 transition count 7638
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 490 place count 3725 transition count 7638
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 509 place count 3706 transition count 7619
Iterating global reduction 2 with 19 rules applied. Total rules applied 528 place count 3706 transition count 7619
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 529 place count 3705 transition count 7618
Iterating global reduction 2 with 1 rules applied. Total rules applied 530 place count 3705 transition count 7618
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 532 place count 3705 transition count 7616
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 534 place count 3703 transition count 7616
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 3 with 206 rules applied. Total rules applied 740 place count 3703 transition count 7616
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 3 with 9 rules applied. Total rules applied 749 place count 3694 transition count 7616
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 765 place count 3678 transition count 7600
Iterating global reduction 4 with 16 rules applied. Total rules applied 781 place count 3678 transition count 7600
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 787 place count 3678 transition count 7594
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 793 place count 3672 transition count 7594
Applied a total of 793 rules in 3231 ms. Remains 3672 /4247 variables (removed 575) and now considering 7594/8133 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3232 ms. Remains : 3672/4247 places, 7594/8133 transitions.
Incomplete random walk after 10000 steps, including 790 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 05:35:40] [INFO ] Flow matrix only has 6580 transitions (discarded 1014 similar events)
// Phase 1: matrix 6580 rows 3672 cols
[2023-03-23 05:35:40] [INFO ] Computed 100 place invariants in 79 ms
[2023-03-23 05:35:40] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 05:35:41] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 47 ms returned sat
[2023-03-23 05:35:45] [INFO ] After 3654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 05:35:46] [INFO ] After 4860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1128 ms.
[2023-03-23 05:35:47] [INFO ] After 6613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 124 out of 3672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3672/3672 places, 7594/7594 transitions.
Graph (complete) has 17066 edges and 3672 vertex of which 3606 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.3 ms
Discarding 66 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 3606 transition count 7527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 3605 transition count 7527
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 3603 transition count 7525
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 3603 transition count 7525
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 3603 transition count 7525
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 3602 transition count 7525
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 3599 transition count 7522
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 3599 transition count 7522
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 3599 transition count 7521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 3598 transition count 7521
Applied a total of 84 rules in 2119 ms. Remains 3598 /3672 variables (removed 74) and now considering 7521/7594 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2119 ms. Remains : 3598/3672 places, 7521/7594 transitions.
Incomplete random walk after 10000 steps, including 787 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20682 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20682 steps, saw 11001 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 05:35:52] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
// Phase 1: matrix 6443 rows 3598 cols
[2023-03-23 05:35:53] [INFO ] Computed 100 place invariants in 60 ms
[2023-03-23 05:35:53] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 05:35:54] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 37 ms returned sat
[2023-03-23 05:35:57] [INFO ] After 3674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 05:35:59] [INFO ] After 4950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 909 ms.
[2023-03-23 05:35:59] [INFO ] After 6405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 124 out of 3598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 412 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 3598/3598 places, 7521/7521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 441 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
[2023-03-23 05:36:00] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
[2023-03-23 05:36:00] [INFO ] Invariant cache hit.
[2023-03-23 05:36:03] [INFO ] Implicit Places using invariants in 2691 ms returned [38, 2789]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2703 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3596/3598 places, 7521/7521 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3595 transition count 7520
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3595 transition count 7520
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 130 place count 3531 transition count 7456
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 3531 transition count 7455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 132 place count 3530 transition count 7455
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 161 place count 3530 transition count 7455
Applied a total of 161 rules in 2064 ms. Remains 3530 /3596 variables (removed 66) and now considering 7455/7521 (removed 66) transitions.
[2023-03-23 05:36:05] [INFO ] Flow matrix only has 6377 transitions (discarded 1078 similar events)
// Phase 1: matrix 6377 rows 3530 cols
[2023-03-23 05:36:05] [INFO ] Computed 98 place invariants in 52 ms
[2023-03-23 05:36:09] [INFO ] Implicit Places using invariants in 3455 ms returned [76, 112, 220, 331, 367, 473, 511, 548, 623, 692, 731, 839, 875, 944, 980, 1054, 1161, 1270, 1308, 1381, 1566, 1677, 1711, 1747, 1780, 1852, 1927, 2000, 2071, 2074, 2107, 2145, 2183, 2217, 2220, 2254, 2257, 2290, 2297, 2330, 2408, 2411, 2445, 2483, 2519, 2552, 2623, 2665, 2738, 2771, 2810, 2815, 2848, 2884, 2917, 2953, 2986, 3060, 3100, 3134, 3172, 3245, 3249, 3282, 3318, 3351, 3354, 3389, 3427, 3462]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 3463 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3460/3598 places, 7455/7521 transitions.
Discarding 1897 places :
Symmetric choice reduction at 0 with 1897 rule applications. Total rules 1897 place count 1563 transition count 5558
Iterating global reduction 0 with 1897 rules applied. Total rules applied 3794 place count 1563 transition count 5558
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3832 place count 1525 transition count 5520
Iterating global reduction 0 with 38 rules applied. Total rules applied 3870 place count 1525 transition count 5520
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 3924 place count 1471 transition count 5466
Iterating global reduction 0 with 54 rules applied. Total rules applied 3978 place count 1471 transition count 5466
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 4070 place count 1425 transition count 5420
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 4101 place count 1425 transition count 5389
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 4132 place count 1394 transition count 5389
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4133 place count 1394 transition count 5389
Applied a total of 4133 rules in 921 ms. Remains 1394 /3460 variables (removed 2066) and now considering 5389/7455 (removed 2066) transitions.
[2023-03-23 05:36:10] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
// Phase 1: matrix 3115 rows 1394 cols
[2023-03-23 05:36:10] [INFO ] Computed 28 place invariants in 25 ms
[2023-03-23 05:36:10] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-23 05:36:10] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
[2023-03-23 05:36:10] [INFO ] Invariant cache hit.
[2023-03-23 05:36:21] [INFO ] Implicit Places using invariants and state equation in 10963 ms returned [42, 44, 47, 50, 90, 96, 107, 143, 146, 153, 189, 196, 201, 208, 211, 247, 249, 254, 297, 300, 303, 339, 342, 351, 354, 361, 398, 438, 441, 445, 450, 494, 501, 509, 548, 551, 592, 595, 634, 708, 793, 879, 937, 1195, 1236, 1282, 1364]
Discarding 47 places :
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Implicit Place search using SMT with State Equation took 11934 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1347/3598 places, 5241/7521 transitions.
Graph (complete) has 5009 edges and 1347 vertex of which 1199 are kept as prefixes of interest. Removing 148 places using SCC suffix rule.2 ms
Discarding 148 places :
Also discarding 0 output transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 1199 transition count 5227
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 1185 transition count 5227
Discarding 719 places :
Symmetric choice reduction at 0 with 719 rule applications. Total rules 748 place count 466 transition count 4508
Iterating global reduction 0 with 719 rules applied. Total rules applied 1467 place count 466 transition count 4508
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 1503 place count 448 transition count 4490
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 1535 place count 448 transition count 4458
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 1567 place count 416 transition count 4458
Applied a total of 1567 rules in 244 ms. Remains 416 /1347 variables (removed 931) and now considering 4458/5241 (removed 783) transitions.
[2023-03-23 05:36:22] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
// Phase 1: matrix 2036 rows 416 cols
[2023-03-23 05:36:22] [INFO ] Computed 28 place invariants in 16 ms
[2023-03-23 05:36:22] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-23 05:36:22] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-23 05:36:22] [INFO ] Invariant cache hit.
[2023-03-23 05:36:23] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 416/3598 places, 4458/7521 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 23088 ms. Remains : 416/3598 places, 4458/7521 transitions.
Incomplete random walk after 10000 steps, including 1216 resets, run finished after 1435 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 135202 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135202 steps, saw 50563 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 05:36:28] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-23 05:36:28] [INFO ] Invariant cache hit.
[2023-03-23 05:36:28] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 05:36:28] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-23 05:36:28] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 05:36:29] [INFO ] After 907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-23 05:36:29] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 124 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 75 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 416/416 places, 4458/4458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 74 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
[2023-03-23 05:36:29] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-23 05:36:29] [INFO ] Invariant cache hit.
[2023-03-23 05:36:29] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-23 05:36:29] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-23 05:36:29] [INFO ] Invariant cache hit.
[2023-03-23 05:36:30] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2023-03-23 05:36:31] [INFO ] Redundant transitions in 452 ms returned []
[2023-03-23 05:36:31] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-23 05:36:31] [INFO ] Invariant cache hit.
[2023-03-23 05:36:32] [INFO ] Dead Transitions using invariants and state equation in 1324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3221 ms. Remains : 416/416 places, 4458/4458 transitions.
Drop transitions removed 1259 transitions
Ensure Unique test removed 1196 transitions
Reduce isomorphic transitions removed 2455 transitions.
Iterating post reduction 0 with 2455 rules applied. Total rules applied 2455 place count 416 transition count 2003
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 2455 place count 416 transition count 1977
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 52 rules applied. Total rules applied 2507 place count 390 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2509 place count 388 transition count 1925
Iterating global reduction 1 with 2 rules applied. Total rules applied 2511 place count 388 transition count 1925
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2515 place count 386 transition count 1923
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 2524 place count 386 transition count 1914
Free-agglomeration rule (complex) applied 96 times.
Iterating global reduction 1 with 96 rules applied. Total rules applied 2620 place count 386 transition count 1818
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 2716 place count 290 transition count 1818
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 2726 place count 290 transition count 1808
Partial Free-agglomeration rule applied 444 times.
Drop transitions removed 444 transitions
Iterating global reduction 2 with 444 rules applied. Total rules applied 3170 place count 290 transition count 1808
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 3183 place count 290 transition count 1795
Applied a total of 3183 rules in 88 ms. Remains 290 /416 variables (removed 126) and now considering 1795/4458 (removed 2663) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1795 rows 290 cols
[2023-03-23 05:36:32] [INFO ] Computed 28 place invariants in 14 ms
[2023-03-23 05:36:32] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 05:36:32] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-23 05:36:33] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 05:36:33] [INFO ] After 1027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-23 05:36:34] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 05:36:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-23 05:36:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 416 places, 4458 transitions and 21059 arcs took 23 ms.
[2023-03-23 05:36:34] [INFO ] Flatten gal took : 324 ms
Total runtime 110521 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/553/inv_0_ --invariant=/tmp/553/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15379240 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16079488 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419000534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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