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.r393-oct2-167903716600127.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679424687222

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:51:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 18:51:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:51:30] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-21 18:51:30] [INFO ] Transformed 1803 places.
[2023-03-21 18:51:30] [INFO ] Transformed 1773 transitions.
[2023-03-21 18:51:30] [INFO ] Found NUPN structural information;
[2023-03-21 18:51:30] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-21 18:51:31] [INFO ] Computed 271 place invariants in 22 ms
[2023-03-21 18:51:31] [INFO ] [Real]Absence check using 271 positive place invariants in 122 ms returned sat
[2023-03-21 18:51:32] [INFO ] After 1008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:51:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 88 ms returned sat
[2023-03-21 18:51:35] [INFO ] After 2275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:51:36] [INFO ] Deduced a trap composed of 24 places in 842 ms of which 11 ms to minimize.
[2023-03-21 18:51:37] [INFO ] Deduced a trap composed of 22 places in 861 ms of which 2 ms to minimize.
[2023-03-21 18:51:38] [INFO ] Deduced a trap composed of 16 places in 817 ms of which 3 ms to minimize.
[2023-03-21 18:51:38] [INFO ] Deduced a trap composed of 25 places in 686 ms of which 2 ms to minimize.
[2023-03-21 18:51:39] [INFO ] Deduced a trap composed of 14 places in 535 ms of which 17 ms to minimize.
[2023-03-21 18:51:41] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 2 ms to minimize.
[2023-03-21 18:51:41] [INFO ] Deduced a trap composed of 33 places in 558 ms of which 1 ms to minimize.
[2023-03-21 18:51:42] [INFO ] Deduced a trap composed of 18 places in 860 ms of which 2 ms to minimize.
[2023-03-21 18:51:43] [INFO ] Deduced a trap composed of 24 places in 671 ms of which 1 ms to minimize.
[2023-03-21 18:51:44] [INFO ] Deduced a trap composed of 27 places in 567 ms of which 1 ms to minimize.
[2023-03-21 18:51:45] [INFO ] Deduced a trap composed of 27 places in 579 ms of which 1 ms to minimize.
[2023-03-21 18:51:45] [INFO ] Deduced a trap composed of 16 places in 629 ms of which 2 ms to minimize.
[2023-03-21 18:51:46] [INFO ] Deduced a trap composed of 22 places in 621 ms of which 6 ms to minimize.
[2023-03-21 18:51:47] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 1 ms to minimize.
[2023-03-21 18:51:47] [INFO ] Deduced a trap composed of 44 places in 515 ms of which 1 ms to minimize.
[2023-03-21 18:51:48] [INFO ] Deduced a trap composed of 15 places in 806 ms of which 2 ms to minimize.
[2023-03-21 18:51:49] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 1 ms to minimize.
[2023-03-21 18:51:49] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 1 ms to minimize.
[2023-03-21 18:51:50] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 1 ms to minimize.
[2023-03-21 18:51:50] [INFO ] Deduced a trap composed of 21 places in 447 ms of which 1 ms to minimize.
[2023-03-21 18:51:51] [INFO ] Deduced a trap composed of 13 places in 641 ms of which 1 ms to minimize.
[2023-03-21 18:51:51] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 1 ms to minimize.
[2023-03-21 18:51:52] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2023-03-21 18:51:52] [INFO ] Deduced a trap composed of 23 places in 434 ms of which 1 ms to minimize.
[2023-03-21 18:51:53] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 17 ms to minimize.
[2023-03-21 18:51:53] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 1 ms to minimize.
[2023-03-21 18:51:54] [INFO ] Deduced a trap composed of 24 places in 440 ms of which 1 ms to minimize.
[2023-03-21 18:51:55] [INFO ] Deduced a trap composed of 21 places in 592 ms of which 1 ms to minimize.
[2023-03-21 18:51:55] [INFO ] Deduced a trap composed of 36 places in 517 ms of which 1 ms to minimize.
[2023-03-21 18:51:56] [INFO ] Deduced a trap composed of 22 places in 979 ms of which 1 ms to minimize.
[2023-03-21 18:51:57] [INFO ] Deduced a trap composed of 20 places in 714 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 18:51:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 18:51:57] [INFO ] After 25408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 157 ms.
Support contains 110 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 1803 transition count 1645
Reduce places removed 128 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 264 place count 1675 transition count 1637
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 1667 transition count 1637
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 272 place count 1667 transition count 1491
Deduced a syphon composed of 146 places in 3 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 564 place count 1521 transition count 1491
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 751 place count 1334 transition count 1304
Iterating global reduction 3 with 187 rules applied. Total rules applied 938 place count 1334 transition count 1304
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 938 place count 1334 transition count 1239
Deduced a syphon composed of 65 places in 6 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1068 place count 1269 transition count 1239
Performed 421 Post agglomeration using F-continuation condition.Transition count delta: 421
Deduced a syphon composed of 421 places in 4 ms
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 3 with 842 rules applied. Total rules applied 1910 place count 848 transition count 818
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 3 with 189 rules applied. Total rules applied 2099 place count 848 transition count 818
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2100 place count 847 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2101 place count 846 transition count 817
Applied a total of 2101 rules in 492 ms. Remains 846 /1803 variables (removed 957) and now considering 817/1773 (removed 956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 846/1803 places, 817/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 151879 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151879 steps, saw 73094 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 846 cols
[2023-03-21 18:52:01] [INFO ] Computed 270 place invariants in 33 ms
[2023-03-21 18:52:01] [INFO ] [Real]Absence check using 267 positive place invariants in 52 ms returned sat
[2023-03-21 18:52:01] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 18:52:01] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:52:02] [INFO ] [Nat]Absence check using 267 positive place invariants in 40 ms returned sat
[2023-03-21 18:52:02] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 18:52:02] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:52:03] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-21 18:52:03] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-21 18:52:03] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-21 18:52:03] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-21 18:52:04] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2023-03-21 18:52:04] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2023-03-21 18:52:04] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 4 ms to minimize.
[2023-03-21 18:52:04] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-21 18:52:04] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-21 18:52:05] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-21 18:52:05] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-21 18:52:05] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-21 18:52:05] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-21 18:52:05] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3215 ms
[2023-03-21 18:52:06] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-21 18:52:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2023-03-21 18:52:07] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-21 18:52:07] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 3 ms to minimize.
[2023-03-21 18:52:07] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2023-03-21 18:52:07] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-21 18:52:08] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2023-03-21 18:52:08] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-21 18:52:08] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-21 18:52:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1422 ms
[2023-03-21 18:52:08] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-21 18:52:08] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-21 18:52:09] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-21 18:52:09] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-21 18:52:09] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-21 18:52:09] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2023-03-21 18:52:09] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2023-03-21 18:52:10] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-21 18:52:10] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-21 18:52:10] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-21 18:52:10] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-21 18:52:11] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-21 18:52:11] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-21 18:52:11] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-21 18:52:11] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-21 18:52:11] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2023-03-21 18:52:12] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-21 18:52:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3464 ms
[2023-03-21 18:52:12] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2023-03-21 18:52:12] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-21 18:52:12] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-21 18:52:13] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-21 18:52:13] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-21 18:52:13] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-21 18:52:13] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2023-03-21 18:52:13] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-21 18:52:14] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-21 18:52:14] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2023-03-21 18:52:14] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2023-03-21 18:52:14] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-21 18:52:14] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2023-03-21 18:52:15] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-21 18:52:15] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-21 18:52:15] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-21 18:52:15] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-21 18:52:15] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-21 18:52:16] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-21 18:52:17] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5546 ms
[2023-03-21 18:52:17] [INFO ] After 15665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-21 18:52:18] [INFO ] After 16372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 107 ms.
Support contains 110 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 30 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 846/846 places, 817/817 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 29 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2023-03-21 18:52:18] [INFO ] Invariant cache hit.
[2023-03-21 18:52:19] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-21 18:52:19] [INFO ] Invariant cache hit.
[2023-03-21 18:52:20] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
[2023-03-21 18:52:20] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-21 18:52:20] [INFO ] Invariant cache hit.
[2023-03-21 18:52:20] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2204 ms. Remains : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 20 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-21 18:52:20] [INFO ] Invariant cache hit.
[2023-03-21 18:52:20] [INFO ] [Real]Absence check using 267 positive place invariants in 88 ms returned sat
[2023-03-21 18:52:20] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-21 18:52:21] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 18:52:21] [INFO ] [Nat]Absence check using 267 positive place invariants in 61 ms returned sat
[2023-03-21 18:52:21] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-21 18:52:22] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 18:52:22] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-21 18:52:22] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-21 18:52:22] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-21 18:52:23] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-21 18:52:23] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-21 18:52:23] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-21 18:52:23] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-21 18:52:24] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-21 18:52:24] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-21 18:52:24] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-21 18:52:24] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2023-03-21 18:52:24] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2023-03-21 18:52:25] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-21 18:52:26] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2023-03-21 18:52:26] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-21 18:52:26] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-21 18:52:26] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4339 ms
[2023-03-21 18:52:26] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-21 18:52:27] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-21 18:52:27] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-21 18:52:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2023-03-21 18:52:27] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 2 ms to minimize.
[2023-03-21 18:52:27] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-21 18:52:28] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-21 18:52:28] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-21 18:52:28] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-21 18:52:28] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-21 18:52:29] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2023-03-21 18:52:30] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-21 18:52:30] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-21 18:52:30] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-21 18:52:30] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-21 18:52:30] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-21 18:52:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3540 ms
[2023-03-21 18:52:31] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2023-03-21 18:52:31] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-21 18:52:31] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 0 ms to minimize.
[2023-03-21 18:52:32] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-21 18:52:32] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-21 18:52:32] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 0 ms to minimize.
[2023-03-21 18:52:32] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-21 18:52:32] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-21 18:52:33] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-21 18:52:33] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-21 18:52:33] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:52:33] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-21 18:52:33] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-21 18:52:34] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:52:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2931 ms
[2023-03-21 18:52:34] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-21 18:52:34] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-21 18:52:34] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-21 18:52:35] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-21 18:52:35] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-21 18:52:35] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-21 18:52:35] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2023-03-21 18:52:36] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-21 18:52:36] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-21 18:52:36] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:52:36] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2023-03-21 18:52:37] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-21 18:52:37] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-21 18:52:37] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-21 18:52:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3359 ms
[2023-03-21 18:52:37] [INFO ] After 16345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 603 ms.
[2023-03-21 18:52:38] [INFO ] After 17252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-21 18:52:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-21 18:52:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 846 places, 817 transitions and 3714 arcs took 9 ms.
[2023-03-21 18:52:38] [INFO ] Flatten gal took : 123 ms
Total runtime 68870 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1028/inv_0_ --invariant=/tmp/1028/inv_1_ --invariant=/tmp/1028/inv_2_ --invariant=/tmp/1028/inv_3_ --invariant=/tmp/1028/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 409252 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096384 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716600127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;