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.r042-tajo-167813696000582.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 marciexred
Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678734538167

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:08:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:08:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:08:59] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-13 19:08:59] [INFO ] Transformed 650 places.
[2023-03-13 19:08:59] [INFO ] Transformed 580 transitions.
[2023-03-13 19:08:59] [INFO ] Found NUPN structural information;
[2023-03-13 19:08:59] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-13 19:09:01] [INFO ] Computed 108 place invariants in 29 ms
[2023-03-13 19:09:01] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 19:09:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2023-03-13 19:09:01] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-13 19:09:02] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-13 19:09:02] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 5 ms to minimize.
[2023-03-13 19:09:02] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:09:02] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2023-03-13 19:09:03] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2023-03-13 19:09:03] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 1 ms to minimize.
[2023-03-13 19:09:03] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:09:03] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:09:04] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:09:04] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:09:04] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 0 ms to minimize.
[2023-03-13 19:09:04] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:09:04] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:09:05] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 1 ms to minimize.
[2023-03-13 19:09:05] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:09:05] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:09:05] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:09:05] [INFO ] Deduced a trap composed of 144 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:09:06] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:09:06] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 0 ms to minimize.
[2023-03-13 19:09:06] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:09:06] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:09:06] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 2 ms to minimize.
[2023-03-13 19:09:07] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 1 ms to minimize.
[2023-03-13 19:09:07] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:09:07] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 0 ms to minimize.
[2023-03-13 19:09:07] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2023-03-13 19:09:07] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 0 ms to minimize.
[2023-03-13 19:09:08] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:09:08] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:09:08] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2023-03-13 19:09:08] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:09:09] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:09:09] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:09:09] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 2 ms to minimize.
[2023-03-13 19:09:09] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:09:10] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 0 ms to minimize.
[2023-03-13 19:09:10] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 0 ms to minimize.
[2023-03-13 19:09:10] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:09:10] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 1 ms to minimize.
[2023-03-13 19:09:10] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 2 ms to minimize.
[2023-03-13 19:09:11] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:09:11] [INFO ] Deduced a trap composed of 116 places in 191 ms of which 0 ms to minimize.
[2023-03-13 19:09:11] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 0 ms to minimize.
[2023-03-13 19:09:11] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 1 ms to minimize.
[2023-03-13 19:09:12] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:09:12] [INFO ] Deduced a trap composed of 143 places in 196 ms of which 0 ms to minimize.
[2023-03-13 19:09:12] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 0 ms to minimize.
[2023-03-13 19:09:12] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:09:12] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 0 ms to minimize.
[2023-03-13 19:09:13] [INFO ] Deduced a trap composed of 124 places in 178 ms of which 0 ms to minimize.
[2023-03-13 19:09:13] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:09:13] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:09:13] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:09:14] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:09:14] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:09:14] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 6 ms to minimize.
[2023-03-13 19:09:14] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:09:14] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:09:15] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:09:15] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:09:15] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:09:15] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:09:15] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 0 ms to minimize.
[2023-03-13 19:09:16] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 0 ms to minimize.
[2023-03-13 19:09:16] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:09:16] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:09:16] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:09:17] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2023-03-13 19:09:17] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:09:17] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:09:17] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:09:17] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:09:18] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 0 ms to minimize.
[2023-03-13 19:09:18] [INFO ] Deduced a trap composed of 130 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:09:18] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 0 ms to minimize.
[2023-03-13 19:09:18] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 0 ms to minimize.
[2023-03-13 19:09:19] [INFO ] Deduced a trap composed of 135 places in 186 ms of which 1 ms to minimize.
[2023-03-13 19:09:19] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:09:19] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:09:19] [INFO ] Deduced a trap composed of 140 places in 192 ms of which 1 ms to minimize.
[2023-03-13 19:09:19] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 0 ms to minimize.
[2023-03-13 19:09:20] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:09:20] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 0 ms to minimize.
[2023-03-13 19:09:20] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:09:20] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:09:21] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:09:21] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 0 ms to minimize.
[2023-03-13 19:09:21] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:09:21] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:09:22] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:09:22] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:09:22] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 0 ms to minimize.
[2023-03-13 19:09:22] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:09:22] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:09:23] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:09:23] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 1 ms to minimize.
[2023-03-13 19:09:23] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:09:23] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:09:23] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:09:24] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:09:24] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:09:24] [INFO ] Deduced a trap composed of 142 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:09:24] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2023-03-13 19:09:25] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-13 19:09:25] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 0 ms to minimize.
[2023-03-13 19:09:25] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-13 19:09:25] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:09:26] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
[2023-03-13 19:09:26] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 0 ms to minimize.
[2023-03-13 19:09:26] [INFO ] Deduced a trap composed of 22 places in 199 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-13 19:09:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:09:26] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 215 ms.
Support contains 58 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 309 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 639 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 639 transition count 461
Reduce places removed 110 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 123 rules applied. Total rules applied 235 place count 529 transition count 448
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 248 place count 516 transition count 448
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 248 place count 516 transition count 359
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 439 place count 414 transition count 359
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 505 place count 348 transition count 293
Iterating global reduction 3 with 66 rules applied. Total rules applied 571 place count 348 transition count 293
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 571 place count 348 transition count 289
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 580 place count 343 transition count 289
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 769 place count 247 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 771 place count 246 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 246 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 775 place count 244 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 776 place count 243 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 777 place count 242 transition count 197
Applied a total of 777 rules in 170 ms. Remains 242 /646 variables (removed 404) and now considering 197/576 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 242/646 places, 197/576 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 9) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 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 88 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 197 rows 242 cols
[2023-03-13 19:09:27] [INFO ] Computed 87 place invariants in 4 ms
[2023-03-13 19:09:27] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 19:09:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 16 ms returned sat
[2023-03-13 19:09:27] [INFO ] [Nat]Absence check using 60 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-13 19:09:28] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 19:09:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:09:28] [INFO ] After 133ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 19:09:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-13 19:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-13 19:09:28] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-13 19:09:28] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2023-03-13 19:09:28] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:09:28] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:09:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2023-03-13 19:09:29] [INFO ] After 816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-13 19:09:29] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 57 ms.
Support contains 55 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 197/197 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 239 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 239 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 237 transition count 192
Applied a total of 10 rules in 35 ms. Remains 237 /242 variables (removed 5) and now considering 192/197 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 237/242 places, 192/197 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 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 97 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 896867 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1, 6=1}
Probabilistic random walk after 896867 steps, saw 135087 distinct states, run finished after 3002 ms. (steps per millisecond=298 ) properties seen :6
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 237 cols
[2023-03-13 19:09:33] [INFO ] Computed 87 place invariants in 10 ms
[2023-03-13 19:09:33] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:09:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-13 19:09:33] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-13 19:09:33] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:09:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:09:33] [INFO ] After 45ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:09:33] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-13 19:09:33] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2023-03-13 19:09:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2023-03-13 19:09:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2023-03-13 19:09:33] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-13 19:09:33] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 26 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 192/192 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 237 transition count 189
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 234 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 233 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 8 place count 233 transition count 180
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 26 place count 223 transition count 180
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 219 transition count 176
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 219 transition count 176
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 54 place count 209 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 207 transition count 164
Applied a total of 56 rules in 62 ms. Remains 207 /237 variables (removed 30) and now considering 164/192 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 207/237 places, 164/192 transitions.
Incomplete random walk after 10000 steps, including 722 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 145327 steps, run visited all 1 properties in 473 ms. (steps per millisecond=307 )
Probabilistic random walk after 145327 steps, saw 30356 distinct states, run finished after 474 ms. (steps per millisecond=306 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 34522 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_17
(NrP: 650 NrTr: 580 NrArc: 1709)

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

net check time: 0m 0.000sec

init dd package: 0m 3.249sec


before gc: list nodes free: 1853633

after gc: idd nodes used:51143339, unused:12856661; list nodes free:54949880

RS generation: 49m12.491sec


-> last computed set: #nodes 51142701 (5.1e+07) #states 531,905,833,779,161 (14)


CANNOT_COMPUTE


BK_STOP 1678737561092

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p329
p257
p255
p256

The net has transition(s) that can never fire:
t258
t460
t288
t289

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.002sec

idd.cc:820: DD Exception: No free nodes

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="BusinessProcesses-PT-17"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696000582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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