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-167813695800486.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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678728062930

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-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:21:05] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-13 17:21:05] [INFO ] Transformed 368 places.
[2023-03-13 17:21:05] [INFO ] Transformed 319 transitions.
[2023-03-13 17:21:05] [INFO ] Found NUPN structural information;
[2023-03-13 17:21:05] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 93 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 13) seen :5
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 318 rows 367 cols
[2023-03-13 17:21:05] [INFO ] Computed 57 place invariants in 21 ms
[2023-03-13 17:21:06] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:21:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2023-03-13 17:21:06] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-13 17:21:06] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:21:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 6 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2023-03-13 17:21:07] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 0 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 0 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 0 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-13 17:21:08] [INFO ] Deduced a trap composed of 95 places in 72 ms of which 0 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 0 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 0 ms to minimize.
[2023-03-13 17:21:09] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 0 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 0 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2023-03-13 17:21:10] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 0 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 1 ms to minimize.
[2023-03-13 17:21:11] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:21:12] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 5260 ms
[2023-03-13 17:21:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-13 17:21:12] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2023-03-13 17:21:12] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-13 17:21:12] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-13 17:21:12] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 0 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 5 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 0 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 0 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2023-03-13 17:21:13] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 1 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 0 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 0 ms to minimize.
[2023-03-13 17:21:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2652 ms
[2023-03-13 17:21:15] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2023-03-13 17:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-13 17:21:15] [INFO ] After 9099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-13 17:21:16] [INFO ] After 9768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 130 ms.
Support contains 45 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 195 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 15 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 357 transition count 239
Reduce places removed 67 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 76 rules applied. Total rules applied 146 place count 290 transition count 230
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 155 place count 281 transition count 230
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 155 place count 281 transition count 189
Deduced a syphon composed of 41 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 247 place count 230 transition count 189
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 292 place count 185 transition count 144
Iterating global reduction 3 with 45 rules applied. Total rules applied 337 place count 185 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 337 place count 185 transition count 142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 341 place count 183 transition count 142
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 421 place count 143 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 422 place count 142 transition count 101
Applied a total of 422 rules in 105 ms. Remains 142 /367 variables (removed 225) and now considering 101/318 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 142/367 places, 101/318 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 5569 steps, including 21 resets, run visited all 1 properties in 10 ms. (steps per millisecond=556 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 11518 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_05
(NrP: 368 NrTr: 319 NrArc: 854)

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

net check time: 0m 0.000sec

init dd package: 0m 3.186sec


before gc: list nodes free: 1617564

after gc: idd nodes used:37063200, unused:26936800; list nodes free:114916606

RS generation: 21m57.084sec


-> last computed set: #nodes 37062835 (3.7e+07) #states 406,795,942,061 (11)


CANNOT_COMPUTE


BK_STOP 1678729421310

--------------------
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:
p272

The net has transition(s) that can never fire:
t80

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

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-05"
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-05, 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-167813695800486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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