fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717500087
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPs-PT-010A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10049.268 3600000.00 3673745.00 147.60 TTTFTFTTFTFF?TTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717500087.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-010A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 84K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679488258649

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:31:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 12:31:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:31:02] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-22 12:31:02] [INFO ] Transformed 253 places.
[2023-03-22 12:31:02] [INFO ] Transformed 243 transitions.
[2023-03-22 12:31:02] [INFO ] Found NUPN structural information;
[2023-03-22 12:31:02] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :14
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 243 rows 253 cols
[2023-03-22 12:31:02] [INFO ] Computed 91 place invariants in 7 ms
[2023-03-22 12:31:03] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 12:31:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 67 ms returned sat
[2023-03-22 12:31:04] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 12:31:05] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-22 12:31:05] [INFO ] After 1777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 155 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 243/243 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 253 transition count 243
Applied a total of 14 rules in 30 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 253/253 places, 243/243 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 243 rows 253 cols
[2023-03-22 12:31:05] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-22 12:31:05] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:31:05] [INFO ] [Nat]Absence check using 91 positive place invariants in 96 ms returned sat
[2023-03-22 12:31:06] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:06] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-22 12:31:06] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2023-03-22 12:31:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2023-03-22 12:31:06] [INFO ] After 607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-22 12:31:06] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 82 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 252 transition count 242
Applied a total of 23 rules in 23 ms. Remains 252 /253 variables (removed 1) and now considering 242/243 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 252/253 places, 242/243 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 780948 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 780948 steps, saw 147574 distinct states, run finished after 3006 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 252 cols
[2023-03-22 12:31:09] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-22 12:31:10] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:31:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 53 ms returned sat
[2023-03-22 12:31:10] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 12:31:10] [INFO ] After 96ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-22 12:31:11] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-22 12:31:11] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 82 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 252/252 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2023-03-22 12:31:11] [INFO ] Invariant cache hit.
[2023-03-22 12:31:11] [INFO ] Implicit Places using invariants in 347 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 351 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 251/252 places, 242/242 transitions.
Applied a total of 0 rules in 12 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 384 ms. Remains : 251/252 places, 242/242 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 874456 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 874456 steps, saw 161033 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 251 cols
[2023-03-22 12:31:14] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-22 12:31:14] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:31:14] [INFO ] [Nat]Absence check using 90 positive place invariants in 49 ms returned sat
[2023-03-22 12:31:15] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-22 12:31:15] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 13 ms to minimize.
[2023-03-22 12:31:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-22 12:31:15] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-22 12:31:15] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 82 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 242/242 transitions.
Applied a total of 0 rules in 17 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 251/251 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 242/242 transitions.
Applied a total of 0 rules in 21 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2023-03-22 12:31:15] [INFO ] Invariant cache hit.
[2023-03-22 12:31:16] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-22 12:31:16] [INFO ] Invariant cache hit.
[2023-03-22 12:31:16] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-22 12:31:16] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-22 12:31:16] [INFO ] Invariant cache hit.
[2023-03-22 12:31:17] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1285 ms. Remains : 251/251 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 12:31:17] [INFO ] Invariant cache hit.
[2023-03-22 12:31:17] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:31:17] [INFO ] [Nat]Absence check using 90 positive place invariants in 76 ms returned sat
[2023-03-22 12:31:17] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:17] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-22 12:31:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-22 12:31:18] [INFO ] After 645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-22 12:31:18] [INFO ] After 998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:31:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-22 12:31:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 242 transitions and 1150 arcs took 4 ms.
[2023-03-22 12:31:18] [INFO ] Flatten gal took : 125 ms
Total runtime 16543 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: ShieldIIPs_PT_010A
(NrP: 251 NrTr: 242 NrArc: 1150)

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

net check time: 0m 0.012sec

init dd package: 0m 2.943sec


before gc: list nodes free: 1234140

after gc: idd nodes used:124486, unused:63875514; list nodes free:293022487

before gc: list nodes free: 2095446

after gc: idd nodes used:242123, unused:63757877; list nodes free:292482643

before gc: list nodes free: 2430991

after gc: idd nodes used:263519, unused:63736481; list nodes free:292382479

before gc: list nodes free: 1202588

after gc: idd nodes used:305218, unused:63694782; list nodes free:292183914

before gc: list nodes free: 648404

after gc: idd nodes used:481814, unused:63518186; list nodes free:291366679

before gc: list nodes free: 1720581

after gc: idd nodes used:597004, unused:63402996; list nodes free:292908945
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6099244 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101132 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

50902 166132 161955 159264 164937 229634 233723 245329 257551 234733 224284 141769 129469 156452 142854 180570 218826 238682 202601 218836 230416 260093 280189 259485 279672 311636 315430 315791 303437 244672 253917 283387 265609 281732 273192 282802 273916 237467 336303 332135 358771 340104 334615 346506 345115 471778 544887 536035 531369 487134 561693 561730 522420

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-010A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPs-PT-010A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717500087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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