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.r394-oct2-167903717500127.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 marciexred
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 r394-oct2-167903717500127
=====================================================================

--------------------
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 1679491911514

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:31:54] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-22 13:31:54] [INFO ] Transformed 1803 places.
[2023-03-22 13:31:54] [INFO ] Transformed 1773 transitions.
[2023-03-22 13:31:54] [INFO ] Found NUPN structural information;
[2023-03-22 13:31:54] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) 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 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 28 ms. (steps per millisecond=357 ) 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 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-22 13:31:55] [INFO ] Computed 271 place invariants in 32 ms
[2023-03-22 13:31:56] [INFO ] [Real]Absence check using 271 positive place invariants in 114 ms returned sat
[2023-03-22 13:31:56] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:31:57] [INFO ] [Nat]Absence check using 271 positive place invariants in 77 ms returned sat
[2023-03-22 13:31:59] [INFO ] After 1967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:32:00] [INFO ] Deduced a trap composed of 24 places in 710 ms of which 9 ms to minimize.
[2023-03-22 13:32:01] [INFO ] Deduced a trap composed of 22 places in 664 ms of which 8 ms to minimize.
[2023-03-22 13:32:01] [INFO ] Deduced a trap composed of 16 places in 524 ms of which 1 ms to minimize.
[2023-03-22 13:32:02] [INFO ] Deduced a trap composed of 25 places in 741 ms of which 2 ms to minimize.
[2023-03-22 13:32:03] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 2 ms to minimize.
[2023-03-22 13:32:04] [INFO ] Deduced a trap composed of 32 places in 935 ms of which 2 ms to minimize.
[2023-03-22 13:32:05] [INFO ] Deduced a trap composed of 33 places in 746 ms of which 14 ms to minimize.
[2023-03-22 13:32:06] [INFO ] Deduced a trap composed of 18 places in 650 ms of which 1 ms to minimize.
[2023-03-22 13:32:07] [INFO ] Deduced a trap composed of 24 places in 654 ms of which 1 ms to minimize.
[2023-03-22 13:32:08] [INFO ] Deduced a trap composed of 27 places in 655 ms of which 2 ms to minimize.
[2023-03-22 13:32:08] [INFO ] Deduced a trap composed of 27 places in 592 ms of which 3 ms to minimize.
[2023-03-22 13:32:09] [INFO ] Deduced a trap composed of 16 places in 652 ms of which 1 ms to minimize.
[2023-03-22 13:32:10] [INFO ] Deduced a trap composed of 22 places in 821 ms of which 3 ms to minimize.
[2023-03-22 13:32:11] [INFO ] Deduced a trap composed of 20 places in 535 ms of which 1 ms to minimize.
[2023-03-22 13:32:11] [INFO ] Deduced a trap composed of 44 places in 574 ms of which 2 ms to minimize.
[2023-03-22 13:32:12] [INFO ] Deduced a trap composed of 15 places in 569 ms of which 1 ms to minimize.
[2023-03-22 13:32:13] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 1 ms to minimize.
[2023-03-22 13:32:13] [INFO ] Deduced a trap composed of 21 places in 498 ms of which 1 ms to minimize.
[2023-03-22 13:32:14] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 1 ms to minimize.
[2023-03-22 13:32:14] [INFO ] Deduced a trap composed of 21 places in 479 ms of which 2 ms to minimize.
[2023-03-22 13:32:15] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2023-03-22 13:32:16] [INFO ] Deduced a trap composed of 21 places in 598 ms of which 18 ms to minimize.
[2023-03-22 13:32:16] [INFO ] Deduced a trap composed of 28 places in 501 ms of which 1 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 1 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 21 places in 610 ms of which 2 ms to minimize.
[2023-03-22 13:32:19] [INFO ] Deduced a trap composed of 24 places in 1200 ms of which 2 ms to minimize.
[2023-03-22 13:32:19] [INFO ] Deduced a trap composed of 24 places in 500 ms of which 1 ms to minimize.
[2023-03-22 13:32:20] [INFO ] Deduced a trap composed of 21 places in 515 ms of which 2 ms to minimize.
[2023-03-22 13:32:20] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 1 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 22 places in 727 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-22 13:32:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:32:21] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 258 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 37 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 2 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 684 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 685 ms. Remains : 846/1803 places, 817/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 135786 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135786 steps, saw 70391 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 846 cols
[2023-03-22 13:32:26] [INFO ] Computed 270 place invariants in 14 ms
[2023-03-22 13:32:26] [INFO ] [Real]Absence check using 267 positive place invariants in 49 ms returned sat
[2023-03-22 13:32:26] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 13:32:26] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:32:26] [INFO ] [Nat]Absence check using 267 positive place invariants in 44 ms returned sat
[2023-03-22 13:32:26] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-22 13:32:27] [INFO ] After 1000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:32:28] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2023-03-22 13:32:28] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-22 13:32:28] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 13 ms to minimize.
[2023-03-22 13:32:29] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-22 13:32:29] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2023-03-22 13:32:29] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 27 ms to minimize.
[2023-03-22 13:32:30] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2023-03-22 13:32:30] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-22 13:32:30] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-22 13:32:30] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 2 ms to minimize.
[2023-03-22 13:32:31] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:32:31] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-22 13:32:31] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2023-03-22 13:32:31] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 8 ms to minimize.
[2023-03-22 13:32:31] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-22 13:32:32] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-22 13:32:32] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4148 ms
[2023-03-22 13:32:32] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-22 13:32:32] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-22 13:32:32] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-22 13:32:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 575 ms
[2023-03-22 13:32:33] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-22 13:32:33] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-22 13:32:33] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:32:33] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-22 13:32:34] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2023-03-22 13:32:34] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 1 ms to minimize.
[2023-03-22 13:32:34] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:32:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2051 ms
[2023-03-22 13:32:35] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-22 13:32:35] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 13 ms to minimize.
[2023-03-22 13:32:35] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-22 13:32:36] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-22 13:32:36] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-22 13:32:36] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-22 13:32:37] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2023-03-22 13:32:37] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 13:32:37] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 1 ms to minimize.
[2023-03-22 13:32:37] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-22 13:32:38] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:32:38] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 0 ms to minimize.
[2023-03-22 13:32:38] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 21 ms to minimize.
[2023-03-22 13:32:38] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-22 13:32:38] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-22 13:32:39] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2023-03-22 13:32:39] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-22 13:32:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4207 ms
[2023-03-22 13:32:39] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-22 13:32:39] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-22 13:32:40] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 13:32:40] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-22 13:32:40] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-22 13:32:40] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2023-03-22 13:32:40] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-22 13:32:41] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-22 13:32:41] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:32:41] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 3 ms to minimize.
[2023-03-22 13:32:41] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-22 13:32:42] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:32:42] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-22 13:32:42] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-22 13:32:42] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-22 13:32:42] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-22 13:32:43] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2023-03-22 13:32:43] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-22 13:32:43] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-22 13:32:43] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2023-03-22 13:32:43] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:32:44] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 13:32:44] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-22 13:32:44] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-22 13:32:44] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-22 13:32:44] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6003 ms
[2023-03-22 13:32:45] [INFO ] After 18500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 602 ms.
[2023-03-22 13:32:46] [INFO ] After 19473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 173 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 29 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 29 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 28 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2023-03-22 13:32:46] [INFO ] Invariant cache hit.
[2023-03-22 13:32:46] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-22 13:32:46] [INFO ] Invariant cache hit.
[2023-03-22 13:32:47] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-22 13:32:47] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-22 13:32:47] [INFO ] Invariant cache hit.
[2023-03-22 13:32:48] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2233 ms. Remains : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 31 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-22 13:32:48] [INFO ] Invariant cache hit.
[2023-03-22 13:32:48] [INFO ] [Real]Absence check using 267 positive place invariants in 47 ms returned sat
[2023-03-22 13:32:48] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 13:32:48] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:32:49] [INFO ] [Nat]Absence check using 267 positive place invariants in 58 ms returned sat
[2023-03-22 13:32:49] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 13:32:50] [INFO ] After 1045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 0 ms to minimize.
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 0 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 0 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 2 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 1 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5528 ms
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 0 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 908 ms
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 0 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4189 ms
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 0 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 0 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 2 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 19 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3183 ms
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 13:33:05] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-22 13:33:05] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 0 ms to minimize.
[2023-03-22 13:33:05] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2023-03-22 13:33:05] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-22 13:33:06] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2023-03-22 13:33:06] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:33:06] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2023-03-22 13:33:06] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-22 13:33:07] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-22 13:33:07] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-22 13:33:07] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 0 ms to minimize.
[2023-03-22 13:33:07] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-22 13:33:08] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-22 13:33:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3503 ms
[2023-03-22 13:33:08] [INFO ] After 18825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 520 ms.
[2023-03-22 13:33:08] [INFO ] After 19730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 13:33:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 13:33:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 846 places, 817 transitions and 3714 arcs took 6 ms.
[2023-03-22 13:33:08] [INFO ] Flatten gal took : 90 ms
Total runtime 74858 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_030B
(NrP: 846 NrTr: 817 NrArc: 3714)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.058sec

net check time: 0m 0.000sec

init dd package: 0m 3.004sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6456888 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099240 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is 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 r394-oct2-167903717500127"
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 ;