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.r043-tajo-167813697000550.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 smartxred
Input is BusinessProcesses-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678792750694

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 11:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:19:12] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-14 11:19:12] [INFO ] Transformed 593 places.
[2023-03-14 11:19:12] [INFO ] Transformed 536 transitions.
[2023-03-14 11:19:12] [INFO ] Found NUPN structural information;
[2023-03-14 11:19:12] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 154 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 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 70 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-14 11:19:13] [INFO ] Computed 95 place invariants in 26 ms
[2023-03-14 11:19:14] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 11:19:14] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 11:19:14] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-14 11:19:15] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-14 11:19:15] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 8 ms to minimize.
[2023-03-14 11:19:15] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:19:15] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-14 11:19:16] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:19:16] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:16] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-14 11:19:16] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 1 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2023-03-14 11:19:17] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:19:18] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:19:18] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:19:18] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:19:18] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 0 ms to minimize.
[2023-03-14 11:19:18] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 0 ms to minimize.
[2023-03-14 11:19:19] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:19:19] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:19:19] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:19:19] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:19:19] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:19:20] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:19:20] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2023-03-14 11:19:20] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:19:20] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 0 ms to minimize.
[2023-03-14 11:19:20] [INFO ] Deduced a trap composed of 135 places in 202 ms of which 1 ms to minimize.
[2023-03-14 11:19:21] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 0 ms to minimize.
[2023-03-14 11:19:21] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:19:21] [INFO ] Deduced a trap composed of 137 places in 342 ms of which 1 ms to minimize.
[2023-03-14 11:19:21] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:19:22] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 1 ms to minimize.
[2023-03-14 11:19:22] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:19:22] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:19:22] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:19:22] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:19:23] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:19:23] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 0 ms to minimize.
[2023-03-14 11:19:23] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:19:23] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:19:23] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 1 ms to minimize.
[2023-03-14 11:19:24] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 1 ms to minimize.
[2023-03-14 11:19:24] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:19:24] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:19:24] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 2 ms to minimize.
[2023-03-14 11:19:25] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:19:25] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:19:25] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 2 ms to minimize.
[2023-03-14 11:19:25] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:19:25] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:26] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:19:26] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:19:26] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:19:26] [INFO ] Deduced a trap composed of 133 places in 184 ms of which 2 ms to minimize.
[2023-03-14 11:19:26] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 0 ms to minimize.
[2023-03-14 11:19:27] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 2 ms to minimize.
[2023-03-14 11:19:27] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:19:27] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:27] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:19:28] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-14 11:19:28] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:28] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2023-03-14 11:19:28] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:19:28] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 1 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:19:29] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 0 ms to minimize.
[2023-03-14 11:19:30] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 0 ms to minimize.
[2023-03-14 11:19:30] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:19:30] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:30] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:19:30] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 0 ms to minimize.
[2023-03-14 11:19:31] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 0 ms to minimize.
[2023-03-14 11:19:31] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:19:31] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:19:31] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 0 ms to minimize.
[2023-03-14 11:19:32] [INFO ] Deduced a trap composed of 133 places in 163 ms of which 0 ms to minimize.
[2023-03-14 11:19:32] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:19:32] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:19:32] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:19:32] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 0 ms to minimize.
[2023-03-14 11:19:33] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:19:33] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:19:33] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:19:33] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:19:34] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:19:34] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:19:34] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:19:34] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:19:34] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:19:35] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:19:35] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:19:35] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:19:35] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 0 ms to minimize.
[2023-03-14 11:19:36] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2023-03-14 11:19:36] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:19:36] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 0 ms to minimize.
[2023-03-14 11:19:36] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 0 ms to minimize.
[2023-03-14 11:19:36] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:19:37] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:19:37] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:19:37] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 1 ms to minimize.
[2023-03-14 11:19:37] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:19:37] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 0 ms to minimize.
[2023-03-14 11:19:38] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 0 ms to minimize.
[2023-03-14 11:19:38] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 0 ms to minimize.
[2023-03-14 11:19:38] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 1 ms to minimize.
[2023-03-14 11:19:38] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:19:38] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:19:39] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:19:39] [INFO ] Deduced a trap composed of 156 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:19:39] [INFO ] Deduced a trap composed of 144 places in 130 ms of which 0 ms to minimize.
[2023-03-14 11:19:39] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 0 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-14 11:19:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:19:39] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 59 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 275 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 574 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 574 transition count 423
Reduce places removed 96 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 112 rules applied. Total rules applied 210 place count 478 transition count 407
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 226 place count 462 transition count 407
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 226 place count 462 transition count 339
Deduced a syphon composed of 68 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 372 place count 384 transition count 339
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 428 place count 328 transition count 283
Iterating global reduction 3 with 56 rules applied. Total rules applied 484 place count 328 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 484 place count 328 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 491 place count 324 transition count 280
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 655 place count 242 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 241 transition count 202
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 659 place count 241 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 661 place count 239 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 238 transition count 199
Applied a total of 662 rules in 124 ms. Remains 238 /585 variables (removed 347) and now considering 199/528 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 238/585 places, 199/528 transitions.
Finished random walk after 392 steps, including 4 resets, run visited all 9 properties in 11 ms. (steps per millisecond=35 )
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27361 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 13
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 593 places, 536 transitions, 1582 arcs.
Final Score: 30033.042
Took : 18 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( (tk(P575)) <= (tk(P323)) ) & ( (tk(P268)) <= (tk(P212)) ) ) | ( (! ( ( ( 1 ) <= (tk(P131)) ) | ( ( (! ( ( 1 ) <= (tk(P309)) )) & ( ( 1 ) <= (tk(P257)) ) ) | ( (tk(P56)) <= (tk(P226)) ) ) )) | ( ( ( ( ( ( (tk(P215)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P270)) ) ) | ( ( ( 1 ) <= (tk(P163)) ) | ( (tk(P86)) <= (tk(P490)) ) ) ) | ( ( ( (tk(P57)) <= (tk(P425)) ) | ( (tk(P445)) <= ( 1 ) ) ) & ( (tk(P43)) <= (tk(P239)) ) ) ) | (! ( ( ( 1 ) <= (tk(P91)) ) & ( (tk(P315)) <= (tk(P15)) ) )) ) | ( ( ( ( ( (tk(P91)) <= (tk(P184)) ) & ( (tk(P112)) <= (tk(P401)) ) ) & (! ( (tk(P446)) <= (tk(P40)) )) ) | ( ( ( (tk(P1)) <= (tk(P276)) ) & ( (tk(P489)) <= ( 1 ) ) ) & (! ( (tk(P12)) <= (tk(P335)) )) ) ) & ( ( (! ( (tk(P389)) <= ( 1 ) )) | ( ( (tk(P317)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P420)) ) ) ) | ( ( ( (tk(P198)) <= (tk(P310)) ) & ( (tk(P397)) <= (tk(P325)) ) ) & ( (tk(P572)) <= (tk(P72)) ) ) ) ) ) ) ) & ( (tk(P341)) <= (tk(P390)) ) ) | (! ( ( (tk(P467)) <= (tk(P196)) ) | ( (! ( (tk(P65)) <= (tk(P305)) )) & ( ( 1 ) <= (tk(P2)) ) ) )) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-01 (reachable & potential(( (! ( ( ( ( ( ( (tk(P334)) <= (tk(P168)) ) | ( (tk(P258)) <= (tk(P169)) ) ) & ( ( (! ( (tk(P324)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P441)) ) & ( ( 1 ) <= (tk(P462)) ) ) ) & (! ( (tk(P205)) <= (tk(P154)) )) ) ) | (! ( (tk(P382)) <= ( 0 ) )) ) | ( (! ( ( 1 ) <= (tk(P541)) )) & ( ( (tk(P531)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P238)) ) ) ) ) | ( ( (tk(P558)) <= (tk(P368)) ) & (! ( (! ( ( ( 1 ) <= (tk(P151)) ) & ( (tk(P226)) <= ( 1 ) ) )) | ( (tk(P210)) <= ( 0 ) ) )) ) )) & ( ( 1 ) <= (tk(P503)) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P508)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-03 (reachable &!potential( ( ( (tk(P549)) <= (tk(P203)) ) & ( (tk(P233)) <= (tk(P477)) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-04 (reachable & potential((! ( (tk(P451)) <= ( 0 ) ))))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P118)) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-06 (reachable & potential((! ( (! ( (! ( ( ( (tk(P256)) <= (tk(P226)) ) & ( (tk(P260)) <= ( 1 ) ) ) | (! ( (tk(P24)) <= (tk(P176)) )) )) & ( (tk(P333)) <= ( 1 ) ) )) | ( ( 1 ) <= (tk(P191)) ) ))))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P571)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-08 (reachable & potential((! ( (tk(P135)) <= (tk(P455)) ))))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-09 (reachable &!potential( (! ( (! ( ( (! ( ( 1 ) <= (tk(P364)) )) | (! ( ( (tk(P264)) <= (tk(P366)) ) & ( ( ( ( 1 ) <= (tk(P401)) ) | ( (tk(P157)) <= ( 1 ) ) ) & ( ( (tk(P556)) <= ( 0 ) ) & ( (tk(P309)) <= (tk(P284)) ) ) ) )) ) & ( (tk(P124)) <= ( 1 ) ) )) & ( (tk(P589)) <= (tk(P141)) ) ))))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-10 (reachable & potential(( ( (! ( ( ( ( ( ( (tk(P285)) <= ( 1 ) ) | ( (tk(P411)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P257)) ) | ( ( 1 ) <= (tk(P140)) ) ) ) & (! ( (tk(P310)) <= (tk(P492)) )) ) | (! ( (tk(P454)) <= (tk(P463)) )) ) | (! ( ( (tk(P90)) <= (tk(P138)) ) & ( (! ( (tk(P288)) <= ( 0 ) )) | ( ( (tk(P346)) <= (tk(P558)) ) | ( (tk(P245)) <= ( 1 ) ) ) ) )) )) & ( ( ( 1 ) <= (tk(P532)) ) | ( ( ( (tk(P420)) <= ( 0 ) ) | ( ( (tk(P498)) <= ( 1 ) ) | ( ( ( ( (tk(P85)) <= ( 1 ) ) | ( (tk(P575)) <= (tk(P179)) ) ) | ( ( (tk(P86)) <= (tk(P304)) ) | ( (tk(P16)) <= ( 1 ) ) ) ) | ( (! ( ( 1 ) <= (tk(P578)) )) | ( ( (tk(P59)) <= ( 1 ) ) | ( (tk(P277)) <= (tk(P555)) ) ) ) ) ) ) | ( ( (tk(P141)) <= (tk(P488)) ) | ( ( ( 1 ) <= (tk(P415)) ) | (! ( ( ( (tk(P123)) <= (tk(P137)) ) & ( ( 1 ) <= (tk(P342)) ) ) & ( ( (tk(P340)) <= ( 0 ) ) & ( (tk(P552)) <= ( 0 ) ) ) )) ) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P141)) ) | (! ( (tk(P135)) <= (tk(P574)) )) ) & ( ( ( ( 1 ) <= (tk(P344)) ) & (! ( ( ( ( (tk(P536)) <= ( 1 ) ) | ( (tk(P558)) <= ( 1 ) ) ) & ( (tk(P459)) <= ( 0 ) ) ) & ( (! ( (tk(P339)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P441)) )) ) )) ) | (! ( ( ( (tk(P80)) <= ( 0 ) ) | (! ( ( ( ( 1 ) <= (tk(P21)) ) & ( (tk(P116)) <= ( 1 ) ) ) & ( ( (tk(P200)) <= ( 1 ) ) | ( (tk(P10)) <= (tk(P420)) ) ) )) ) | ( ( ( ( ( ( 1 ) <= (tk(P22)) ) & ( ( 1 ) <= (tk(P78)) ) ) | ( (tk(P336)) <= ( 1 ) ) ) & ( ( ( ( 1 ) <= (tk(P494)) ) & ( (tk(P160)) <= (tk(P505)) ) ) & ( (tk(P503)) <= ( 1 ) ) ) ) & (! ( (tk(P295)) <= (tk(P529)) )) ) )) ) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-11 (reachable &!potential( ( ( ( (tk(P58)) <= (tk(P200)) ) & (! ( ( 1 ) <= (tk(P280)) )) ) | ( ( 1 ) <= (tk(P240)) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-12 (reachable & potential(( (! ( (tk(P137)) <= ( 0 ) )) & ( ( (tk(P85)) <= (tk(P139)) ) & ( (! ( (tk(P360)) <= ( 1 ) )) | ( ( (tk(P528)) <= ( 0 ) ) | (! ( (tk(P243)) <= ( 0 ) )) ) ) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-13 (reachable &!potential( (! ( ( ( ( 1 ) <= (tk(P155)) ) & ( (tk(P115)) <= ( 1 ) ) ) & ( ( ( ( ( ( ( ( 1 ) <= (tk(P564)) ) | (! ( (tk(P32)) <= (tk(P255)) )) ) | (! ( ( 1 ) <= (tk(P298)) )) ) & (! ( ( ( (tk(P348)) <= (tk(P346)) ) | ( ( 1 ) <= (tk(P41)) ) ) | (! ( ( 1 ) <= (tk(P500)) )) )) ) | (! ( ( (tk(P321)) <= ( 1 ) ) & ( ( (tk(P252)) <= (tk(P57)) ) | ( ( (tk(P560)) <= (tk(P276)) ) | ( ( 1 ) <= (tk(P65)) ) ) ) )) ) | (! ( ( (tk(P6)) <= (tk(P488)) ) | ( ( ( ( 1 ) <= (tk(P188)) ) | ( ( (tk(P474)) <= (tk(P447)) ) | ( ( 1 ) <= (tk(P511)) ) ) ) | ( ( ( (tk(P11)) <= (tk(P575)) ) | ( (tk(P370)) <= ( 1 ) ) ) | (! ( (tk(P540)) <= ( 1 ) )) ) ) )) ) | ( (tk(P494)) <= (tk(P583)) ) ) ))))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P280)) <= ( 0 ) ) & ( (! ( ( ( (! ( ( (tk(P191)) <= (tk(P392)) ) | ( (tk(P323)) <= (tk(P152)) ) )) | ( ( 1 ) <= (tk(P306)) ) ) & (! ( ( ( ( 1 ) <= (tk(P223)) ) | ( (tk(P92)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P220)) ) & ( (tk(P410)) <= ( 1 ) ) ) )) ) | (! ( ( (tk(P259)) <= (tk(P360)) ) | ( ( (tk(P415)) <= ( 1 ) ) & ( (tk(P393)) <= (tk(P121)) ) ) )) )) | ( ( (tk(P298)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P496)) ) | ( ( ( 1 ) <= (tk(P409)) ) & ( (tk(P83)) <= ( 1 ) ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-13-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( ( ( (! ( (tk(P26)) <= ( 1 ) )) | ( ( ( (tk(P389)) <= (tk(P168)) ) | ( (tk(P237)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P160)) ) & ( (tk(P552)) <= (tk(P122)) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P541)) ) & ( (tk(P588)) <= ( 0 ) ) ) & (! ( (tk(P364)) <= (tk(P511)) )) ) | (! ( ( (tk(P196)) <= (tk(P279)) ) | ( ( 1 ) <= (tk(P559)) ) )) ) ) | ( ( ( 1 ) <= (tk(P472)) ) & ( ( (tk(P431)) <= (tk(P66)) ) | (! ( ( 1 ) <= (tk(P183)) )) ) ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P116)) ) | ( (tk(P185)) <= (tk(P209)) ) ) | ( ( ( 1 ) <= (tk(P586)) ) & ( ( 1 ) <= (tk(P413)) ) ) ) | (! ( ( ( 1 ) <= (tk(P171)) ) & ( (tk(P49)) <= (tk(P238)) ) )) ) | (! ( (tk(P585)) <= ( 1 ) )) ) | ( ( (tk(P493)) <= ( 0 ) ) & ( (tk(P234)) <= (tk(P258)) ) ) ) ) | ( (tk(P373)) <= (tk(P543)) ) ) & ( ( ( 1 ) <= (tk(P395)) ) | ( ( ( 1 ) <= (tk(P425)) ) & (! ( ( (! ( (tk(P180)) <= (tk(P91)) )) & (! ( ( 1 ) <= (tk(P54)) )) ) & ( ( ( ( (tk(P227)) <= (tk(P535)) ) & ( (tk(P399)) <= ( 1 ) ) ) | (! ( (tk(P159)) <= ( 0 ) )) ) & ( (tk(P586)) <= (tk(P457)) ) ) )) ) ) ) | ( (tk(P358)) <= ( 0 ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11751928 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16108020 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-13"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-13, 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 r043-tajo-167813697000550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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