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

About the Execution of Marcie+red for Szymanski-PT-b10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6328.623 3600000.00 3638270.00 6607.30 TTFTFTT?FF?FFF?F 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.r490-tall-167912708700486.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 Szymanski-PT-b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708700486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 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 3.7M 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 Szymanski-PT-b10-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-b10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679267566895

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=Szymanski-PT-b10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 23:12:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:12:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:12:48] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-19 23:12:48] [INFO ] Transformed 568 places.
[2023-03-19 23:12:48] [INFO ] Transformed 8320 transitions.
[2023-03-19 23:12:48] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 16 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 5 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :3
FORMULA Szymanski-PT-b10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 23:12:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 23:12:49] [INFO ] Computed 3 place invariants in 46 ms
[2023-03-19 23:12:49] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 23:12:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:12:49] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-19 23:12:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 23:12:49] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:12:50] [INFO ] After 1007ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-19 23:12:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 23:12:52] [INFO ] After 1590ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-19 23:12:53] [INFO ] Deduced a trap composed of 60 places in 483 ms of which 4 ms to minimize.
[2023-03-19 23:12:53] [INFO ] Deduced a trap composed of 74 places in 475 ms of which 1 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 86 places in 406 ms of which 1 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Deduced a trap composed of 80 places in 411 ms of which 2 ms to minimize.
[2023-03-19 23:12:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2089 ms
[2023-03-19 23:12:55] [INFO ] After 4540ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 553 ms.
[2023-03-19 23:12:55] [INFO ] After 6233ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA Szymanski-PT-b10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 306 transition count 7937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 305 transition count 7809
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 305 transition count 7809
Applied a total of 130 rules in 440 ms. Remains 305 /308 variables (removed 3) and now considering 7809/8064 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 305/308 places, 7809/8064 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 118211 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118211 steps, saw 92169 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:12:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 23:12:59] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-19 23:12:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:12:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:13:00] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:13:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 23:13:04] [INFO ] After 4130ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:13:04] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 0 ms to minimize.
[2023-03-19 23:13:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2023-03-19 23:13:05] [INFO ] After 4934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-19 23:13:05] [INFO ] After 5926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 231 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 298 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 23:13:05] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 23:13:05] [INFO ] Invariant cache hit.
[2023-03-19 23:13:06] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-19 23:13:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 23:13:06] [INFO ] Invariant cache hit.
[2023-03-19 23:13:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 23:13:13] [INFO ] Implicit Places using invariants and state equation in 6701 ms returned []
Implicit Place search using SMT with State Equation took 7171 ms to find 0 implicit places.
[2023-03-19 23:13:14] [INFO ] Redundant transitions in 933 ms returned []
[2023-03-19 23:13:14] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 23:13:14] [INFO ] Invariant cache hit.
[2023-03-19 23:13:15] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10246 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 9 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 323 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1947 rows 269 cols
[2023-03-19 23:13:16] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-19 23:13:16] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:13:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:13:17] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:13:17] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 23:13:17] [INFO ] After 802ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:13:19] [INFO ] After 2283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 613 ms.
[2023-03-19 23:13:19] [INFO ] After 3591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:13:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-19 23:13:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7809 transitions and 31362 arcs took 32 ms.
[2023-03-19 23:13:20] [INFO ] Flatten gal took : 443 ms
Total runtime 32379 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Szymanski_PT_b10
(NrP: 305 NrTr: 7809 NrArc: 31362)

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

net check time: 0m 0.003sec

init dd package: 0m 2.701sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9812488 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094068 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.110sec

3124 5693 6285 6325 7730 8980 9852 10408 10013 14747 10419 15298 10951 15941 11851 16594 12415 15683 13860 16108 14621 16116 15808 16466 18434 14067 12328 10639 10146 18523 18932 21778 11939 18906 18640 21341 13095 19460 18541 20868 14252 19642 18621 20716 15447 20011 19645 20535 17561 19845 20334 20252 19026 20195 20586 19535 20373 21270 17510 14490 20694 22874 29590 23236 23518 16383 21538 26458 28862 27779 23613 18060 22064 25075 25421 28784 24443 21522 20358 24226 24614 29347 25224 25540 21733 24414 26601 28078 27152 26134 22705 25290 26944 27523 28633 26576 24836 25982 27158 28179 27437 27168 27272 28093 27937 28420 28430 21874 20044 24423 24703 30159 28034 27606 31561 29124 31910 20003 23047 27684 28754 29690 29204 26985 29863 29502 30918 18199 24296 26793 30155 26483 29769 29550 29744 29879 28543 22051 26342 26083 30629 28216 30852 29923 29947 30336 27155 25878 28037 27789 30446 29442 29568 31198 30585 31170 26815 27841 29139 30361 29559 30644 29686 30443 31359 30406 28337 29705 30404 30344 30855 30708 31374 30315 30728 30925 31040 31483 29065 29146 14798 20229 29696 33145 36926 34608 35128 34813 40917 44465 51159 42506 37615 35671 37986 29223 25279 30305 34249 34048 37660 34942 38924 38731 42324 48306 47834 40315 39009 38256 38239 28681 29758 35145 36253 39631 37160 38858 37224 43160 45160 49659 43506 40074 39481 41257 35219 31156 35804 38289 37923 40387 38941 41250 40401 43528 46910 47042 42371 41048 41260 40533 34927 35879 39322 39732 42328 40606 41575 40244 44343 45804 48133 44367 42115 42972 43470 39714 38734 40648 42340 42629 43531 42298 43549 44394 45408 46997 45854 43681 43844 44209 42410 41476 42970 44025 44754 43864 44482 45454 46663 45527 45338 45794 44416 44942 46229 46158 46171 47688 46515 50165 36899 41163 30800 28799 33876 37257 35354

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="Szymanski-PT-b10"
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 Szymanski-PT-b10, 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 r490-tall-167912708700486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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