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

About the Execution of Marcie+red for Parking-PT-832

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9887.455 3600000.00 3632121.00 8275.60 TTTTTTTTTTTFTTFT 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.r266-smll-167863540900446.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Parking-PT-832, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 251K 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 Parking-PT-832-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-832-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679061315726

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=Parking-PT-832
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 13:55:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 13:55:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 13:55:19] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2023-03-17 13:55:19] [INFO ] Transformed 737 places.
[2023-03-17 13:55:19] [INFO ] Transformed 993 transitions.
[2023-03-17 13:55:19] [INFO ] Found NUPN structural information;
[2023-03-17 13:55:19] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 13) seen :7
FORMULA Parking-PT-832-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :1
FORMULA Parking-PT-832-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 609 rows 737 cols
[2023-03-17 13:55:21] [INFO ] Computed 184 place invariants in 37 ms
[2023-03-17 13:55:22] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 13:55:22] [INFO ] [Nat]Absence check using 176 positive place invariants in 89 ms returned sat
[2023-03-17 13:55:22] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-17 13:55:24] [INFO ] After 1393ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-17 13:55:24] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-17 13:55:25] [INFO ] After 920ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-17 13:55:26] [INFO ] After 2136ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 728 ms.
[2023-03-17 13:55:27] [INFO ] After 5072ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA Parking-PT-832-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA Parking-PT-832-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 214 ms.
Support contains 74 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 609/609 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 737 transition count 596
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 724 transition count 594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 722 transition count 594
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 30 place count 722 transition count 580
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 58 place count 708 transition count 580
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 702 transition count 574
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 702 transition count 574
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 114 place count 680 transition count 552
Free-agglomeration rule applied 106 times.
Iterating global reduction 3 with 106 rules applied. Total rules applied 220 place count 680 transition count 446
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 3 with 106 rules applied. Total rules applied 326 place count 574 transition count 446
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 574 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 574 transition count 445
Applied a total of 328 rules in 567 ms. Remains 574 /737 variables (removed 163) and now considering 445/609 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 574/737 places, 445/609 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :1
FORMULA Parking-PT-832-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 445 rows 574 cols
[2023-03-17 13:55:28] [INFO ] Computed 184 place invariants in 8 ms
[2023-03-17 13:55:28] [INFO ] [Real]Absence check using 176 positive place invariants in 71 ms returned sat
[2023-03-17 13:55:28] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-17 13:55:28] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:55:29] [INFO ] [Nat]Absence check using 176 positive place invariants in 48 ms returned sat
[2023-03-17 13:55:29] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 13:55:29] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:55:29] [INFO ] State equation strengthened by 305 read => feed constraints.
[2023-03-17 13:55:30] [INFO ] After 439ms SMT Verify possible using 305 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 13:55:30] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-17 13:55:30] [INFO ] After 1917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 42 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 445/445 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 574 transition count 444
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 573 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 572 transition count 443
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 13 place count 572 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 22 place count 563 transition count 434
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 563 transition count 433
Applied a total of 23 rules in 133 ms. Remains 563 /574 variables (removed 11) and now considering 433/445 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 563/574 places, 433/445 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
FORMULA Parking-PT-832-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 563 cols
[2023-03-17 13:55:31] [INFO ] Computed 184 place invariants in 11 ms
[2023-03-17 13:55:31] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 13:55:31] [INFO ] [Nat]Absence check using 176 positive place invariants in 64 ms returned sat
[2023-03-17 13:55:31] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 13:55:32] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 13:55:32] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-03-17 13:55:32] [INFO ] After 150ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 13:55:32] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-17 13:55:32] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 34 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 433/433 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 563 transition count 430
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 560 transition count 430
Applied a total of 6 rules in 57 ms. Remains 560 /563 variables (removed 3) and now considering 430/433 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 560/563 places, 430/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261937 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261937 steps, saw 219772 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 430 rows 560 cols
[2023-03-17 13:55:35] [INFO ] Computed 184 place invariants in 7 ms
[2023-03-17 13:55:36] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 13:55:36] [INFO ] [Nat]Absence check using 176 positive place invariants in 46 ms returned sat
[2023-03-17 13:55:36] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 13:55:36] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 13:55:36] [INFO ] State equation strengthened by 317 read => feed constraints.
[2023-03-17 13:55:36] [INFO ] After 148ms SMT Verify possible using 317 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 13:55:37] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-17 13:55:37] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
FORMULA Parking-PT-832-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 17809 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: Parking_PT_832
(NrP: 737 NrTr: 993 NrArc: 2993)

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

net check time: 0m 0.000sec

init dd package: 0m 3.528sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6264308 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103132 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
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.006sec

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="Parking-PT-832"
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 Parking-PT-832, 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 r266-smll-167863540900446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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