Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000287.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 239K 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 ShieldRVt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679306654921

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=ShieldRVt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:04:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:04:17] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-20 10:04:17] [INFO ] Transformed 1003 places.
[2023-03-20 10:04:17] [INFO ] Transformed 1003 transitions.
[2023-03-20 10:04:17] [INFO ] Found NUPN structural information;
[2023-03-20 10:04:17] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-20 10:04:18] [INFO ] Computed 81 place invariants in 23 ms
[2023-03-20 10:04:19] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2023-03-20 10:04:19] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 10:04:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-20 10:04:20] [INFO ] After 1468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 8 ms to minimize.
[2023-03-20 10:04:21] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 1 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 2 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 2 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 2 ms to minimize.
[2023-03-20 10:04:22] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 2 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 2 ms to minimize.
[2023-03-20 10:04:23] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 2 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 0 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 1 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 1 ms to minimize.
[2023-03-20 10:04:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3720 ms
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2023-03-20 10:04:25] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 1 ms to minimize.
[2023-03-20 10:04:26] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 0 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2023-03-20 10:04:27] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 1 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 0 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2023-03-20 10:04:28] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 1 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2023-03-20 10:04:29] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
[2023-03-20 10:04:30] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 0 ms to minimize.
[2023-03-20 10:04:30] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2023-03-20 10:04:30] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 6 ms to minimize.
[2023-03-20 10:04:30] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-20 10:04:30] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2023-03-20 10:04:31] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2023-03-20 10:04:31] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 0 ms to minimize.
[2023-03-20 10:04:31] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-20 10:04:31] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2023-03-20 10:04:32] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-20 10:04:33] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2023-03-20 10:04:33] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8300 ms
[2023-03-20 10:04:33] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-20 10:04:34] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 1 ms to minimize.
[2023-03-20 10:04:34] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 2 ms to minimize.
[2023-03-20 10:04:34] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-20 10:04:34] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 1 ms to minimize.
[2023-03-20 10:04:35] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 0 ms to minimize.
[2023-03-20 10:04:36] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 1 ms to minimize.
[2023-03-20 10:04:36] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 0 ms to minimize.
[2023-03-20 10:04:36] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2023-03-20 10:04:36] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 0 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 0 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 0 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2023-03-20 10:04:37] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 3 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2023-03-20 10:04:38] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5489 ms
[2023-03-20 10:04:39] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 1 ms to minimize.
[2023-03-20 10:04:39] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2023-03-20 10:04:40] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 1 ms to minimize.
[2023-03-20 10:04:40] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2023-03-20 10:04:40] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 1 ms to minimize.
[2023-03-20 10:04:41] [INFO ] Deduced a trap composed of 39 places in 353 ms of which 1 ms to minimize.
[2023-03-20 10:04:41] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 1 ms to minimize.
[2023-03-20 10:04:41] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 1 ms to minimize.
[2023-03-20 10:04:41] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2023-03-20 10:04:42] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 0 ms to minimize.
[2023-03-20 10:04:42] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 0 ms to minimize.
[2023-03-20 10:04:42] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2023-03-20 10:04:42] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-20 10:04:43] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 0 ms to minimize.
[2023-03-20 10:04:43] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-20 10:04:43] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-20 10:04:43] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 0 ms to minimize.
[2023-03-20 10:04:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4568 ms
[2023-03-20 10:04:44] [INFO ] Deduced a trap composed of 45 places in 267 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-20 10:04:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 10:04:44] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 291 ms.
Support contains 125 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1003 transition count 805
Reduce places removed 198 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 229 rules applied. Total rules applied 427 place count 805 transition count 774
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 458 place count 774 transition count 774
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 458 place count 774 transition count 678
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 650 place count 678 transition count 678
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 774 place count 554 transition count 554
Iterating global reduction 3 with 124 rules applied. Total rules applied 898 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 900 place count 554 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 901 place count 553 transition count 552
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 901 place count 553 transition count 513
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 979 place count 514 transition count 513
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 17 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 5 with 276 rules applied. Total rules applied 1255 place count 376 transition count 375
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1329 place count 339 transition count 396
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1337 place count 339 transition count 388
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1345 place count 331 transition count 388
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1353 place count 331 transition count 388
Applied a total of 1353 rules in 323 ms. Remains 331 /1003 variables (removed 672) and now considering 388/1003 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 331/1003 places, 388/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 7) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) 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 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
Running SMT prover for 5 properties.
// Phase 1: matrix 388 rows 331 cols
[2023-03-20 10:04:45] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 10:04:46] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:04:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-20 10:04:46] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:46] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-20 10:04:46] [INFO ] After 434ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-20 10:04:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 438 ms
[2023-03-20 10:04:48] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 10:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-20 10:04:49] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-20 10:04:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-20 10:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-20 10:04:49] [INFO ] After 2583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-20 10:04:49] [INFO ] After 3405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 134 ms.
Support contains 100 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 388/388 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 331 transition count 382
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 325 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 323 transition count 380
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 16 place count 323 transition count 372
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 32 place count 315 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 314 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 314 transition count 371
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 64 place count 299 transition count 356
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 297 transition count 360
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 297 transition count 359
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 297 transition count 357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 295 transition count 357
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 295 transition count 357
Applied a total of 75 rules in 89 ms. Remains 295 /331 variables (removed 36) and now considering 357/388 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 295/331 places, 357/388 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 212925 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212925 steps, saw 102314 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 357 rows 295 cols
[2023-03-20 10:04:53] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 10:04:53] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:04:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 13 ms returned sat
[2023-03-20 10:04:53] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:53] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-20 10:04:53] [INFO ] After 282ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-20 10:04:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-20 10:04:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-20 10:04:55] [INFO ] After 1405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-20 10:04:55] [INFO ] After 2079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 58 ms.
Support contains 100 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 357/357 transitions.
Applied a total of 0 rules in 10 ms. Remains 295 /295 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 295/295 places, 357/357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 357/357 transitions.
Applied a total of 0 rules in 11 ms. Remains 295 /295 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2023-03-20 10:04:55] [INFO ] Invariant cache hit.
[2023-03-20 10:04:55] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-20 10:04:55] [INFO ] Invariant cache hit.
[2023-03-20 10:04:55] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-20 10:04:55] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-20 10:04:55] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 10:04:55] [INFO ] Invariant cache hit.
[2023-03-20 10:04:56] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 295/295 places, 357/357 transitions.
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 295 transition count 340
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 30 place count 295 transition count 340
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 295 transition count 337
Applied a total of 33 rules in 36 ms. Remains 295 /295 variables (removed 0) and now considering 337/357 (removed 20) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 337 rows 295 cols
[2023-03-20 10:04:56] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 10:04:56] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:04:56] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-20 10:04:56] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:04:56] [INFO ] After 165ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:56] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 316 ms
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-20 10:04:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 10:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-20 10:04:57] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-20 10:04:57] [INFO ] After 1430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:04:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-20 10:04:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 295 places, 357 transitions and 1476 arcs took 5 ms.
[2023-03-20 10:04:58] [INFO ] Flatten gal took : 72 ms
Total runtime 40629 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/874/inv_0_ --invariant=/tmp/874/inv_1_ --invariant=/tmp/874/inv_2_ --invariant=/tmp/874/inv_3_ --invariant=/tmp/874/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16035152 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100512 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
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r425-tajo-167905978000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B 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 ;