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

About the Execution of Marcie+red for Railroad-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5563.392 3600000.00 3638561.00 8539.00 TFFTTTFFTTFTFFTF 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.r330-tall-167889203200391.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 Railroad-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203200391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 22:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 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 1.4M 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 Railroad-PT-050-ReachabilityFireability-00
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-01
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-02
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-03
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-04
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-05
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-06
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-07
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-08
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-09
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-10
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-11
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-12
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-13
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-14
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679155358289

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=Railroad-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 16:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 16:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:02:40] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-18 16:02:40] [INFO ] Transformed 518 places.
[2023-03-18 16:02:40] [INFO ] Transformed 2756 transitions.
[2023-03-18 16:02:40] [INFO ] Found NUPN structural information;
[2023-03-18 16:02:40] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 151 places in 20 ms
Reduce places removed 151 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA Railroad-PT-050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2706 rows 367 cols
[2023-03-18 16:02:41] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-18 16:02:42] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 16:02:43] [INFO ] After 1221ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-18 16:02:44] [INFO ] After 2275ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-18 16:02:45] [INFO ] After 3148ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA Railroad-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-050-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA Railroad-PT-050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 283 ms.
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 1 with 98 rules applied. Total rules applied 150 place count 266 transition count 2657
Applied a total of 150 rules in 611 ms. Remains 266 /367 variables (removed 101) and now considering 2657/2706 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 266/367 places, 2657/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 582059 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 582059 steps, saw 481737 distinct states, run finished after 3003 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 16:02:49] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-18 16:02:50] [INFO ] After 1222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:02:51] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 16:02:51] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-18 16:02:51] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 521 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 266/266 places, 2657/2657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 406 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 16:02:52] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-18 16:02:52] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 16:02:52] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 16:02:54] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162, 215, 217, 219, 225, 226, 227, 228, 231, 239, 240, 242, 244, 245, 246, 247, 248, 250, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2106 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/266 places, 2657/2657 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 445 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 16:02:54] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 16:02:54] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 16:02:54] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 16:02:56] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/266 places, 2653/2657 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4294 ms. Remains : 207/266 places, 2653/2657 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 810301 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 810301 steps, saw 669160 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 16:02:59] [INFO ] Invariants computation overflowed in 14 ms
[2023-03-18 16:02:59] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:03:00] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 16:03:00] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 16:03:00] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
FORMULA Railroad-PT-050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 20823 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Railroad_PT_050
(NrP: 518 NrTr: 2756 NrArc: 16378)

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

net check time: 0m 0.002sec

init dd package: 0m 2.860sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10585932 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098712 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
found
The net has a maximal unmarked siphon:
pl_P0_1
pl_P112_47
pl_P112_40
pl_P112_46
pl_P112_6
pl_P112_7
pl_P112_8
pl_P112_9
pl_P121_1
pl_P122_1
pl_P112_41
pl_P141_1
pl_P144_1
pl_P112_42
pl_P153_1
pl_P155_1
pl_P15_1
pl_P165_1
pl_P197_1
pl_P16_51
pl_P171_1
pl_P174_1
pl_P175_1
pl_P176_1
pl_P185_1
pl_P190_1
pl_P19_1
pl_P200_1
pl_P202_1
pl_P206_1
pl_P20_1
pl_P210_1
pl_P211_1
pl_P215_1
pl_P217_1
pl_P223_1
pl_P225_1
pl_P229_1
pl_P22_1
pl_P233_51
pl_P241_1
pl_P242_1
pl_P244_1
pl_P249_1
pl_P252_1
pl_P261_10
pl_P261_11
pl_P261_12
pl_P261_13
pl_P261_14
pl_P261_15
pl_P261_16
pl_P261_17
pl_P261_18
pl_P261_19
pl_P261_20
pl_P261_21
pl_P261_22
pl_P261_23
pl_P261_24
pl_P261_25
pl_P261_26
pl_P261_27
pl_P261_28
pl_P261_29
pl_P261_30
pl_P261_31
pl_P261_32
pl_P261_33
pl_P261_34
pl_P261_35
pl_P261_36
pl_P261_37
pl_P261_38
pl_P261_39
pl_P261_4
pl_P261_40
pl_P261_41
pl_P261_42
pl_P261_43
pl_P261_44
pl_P261_45
pl_P261_46
pl_P261_47
pl_P261_48
pl_P261_49
pl_P261_5
pl_P261_50
pl_P261_51
pl_P261_6
pl_P261_7
pl_P261_8
pl_P261_9
pl_P263_1
pl_P27_1
pl_P112_43
pl_P50_1
pl_P51_1
pl_P55_1
pl_P58_1
pl_P60_1
pl_P61_1
pl_P71_1
pl_P72_1
pl_P76_1
pl_P7_1
pl_P88_1
pl_P98_1
pl_P9_1
pl_P112_11
pl_P111_1
pl_P112_21
pl_P110_1
pl_P112_33
pl_P112_49
pl_P112_5
pl_P112_44
pl_P112_38
pl_P112_16
pl_P112_51
pl_P112_13
pl_P112_37
pl_P112_32
pl_P112_10
pl_P112_29
pl_P112_17
pl_P112_24
pl_P112_4
pl_P112_28
pl_P112_22
pl_P112_36
pl_P112_26
pl_P112_23
pl_P112_19
pl_P112_34
pl_P112_18
pl_P112_35
pl_P112_20
pl_P112_15
pl_P112_12
pl_P112_31
pl_P112_27
pl_P112_30
pl_P102_1
pl_P112_45
pl_P112_39
pl_P112_2
pl_P112_25
pl_P112_48
pl_P112_50
pl_P112_14

The net has transition(s) that can never fire:
tr_T66_102
tr_T62_969
tr_T62_1887
tr_T62_663
tr_T62_714
tr_T62_765
tr_T62_612
tr_T62_1836
tr_T62_561
tr_T62_1785
tr_T62_510
tr_T62_459
tr_T62_1734
tr_T62_408
tr_T62_1683
tr_T62_867
tr_T62_357
tr_T62_1632
tr_T62_306
tr_T62_2601
tr_T62_918
tr_T62_1581
tr_T62_2550
tr_T62_255
tr_T62_1530
tr_T62_153
tr_T62_2499
tr_T62_2448
tr_T62_1479
tr_T62_816
tr_T62_2397
tr_T62_1428
tr_T62_2346
tr_T62_1377
tr_T62_2295
tr_T62_2244
tr_T62_1326
tr_T62_2193
tr_T62_1275
tr_T62_2142
tr_T62_1224
tr_T62_2091
tr_T62_1173
tr_T62_2040
tr_T62_204
tr_T62_1989
tr_T62_1122
tr_T62_1938
tr_T62_1071
tr_T62_1020

check for constant places
pl_P0_1
pl_P102_1
pl_P110_1
pl_P111_1
pl_P112_10
pl_P112_11
pl_P112_12
pl_P112_13
pl_P112_14
pl_P112_15
pl_P112_16
pl_P112_17
pl_P112_18
pl_P112_19
pl_P112_2
pl_P112_20
pl_P112_21
pl_P112_22
pl_P112_23
pl_P112_24
pl_P112_25
pl_P112_26
pl_P112_27
pl_P112_28
pl_P112_29
pl_P112_30
pl_P112_31
pl_P112_32
pl_P112_33
pl_P112_34
pl_P112_35
pl_P112_36
pl_P112_37
pl_P112_38
pl_P112_39
pl_P112_4
pl_P112_40
pl_P112_41
pl_P112_42
pl_P112_43
pl_P112_44
pl_P112_45
pl_P112_46
pl_P112_47
pl_P112_48
pl_P112_49
pl_P112_5
pl_P112_50
pl_P112_51
pl_P112_6
pl_P112_7
pl_P112_8
pl_P112_9
pl_P121_1
pl_P122_1
pl_P141_1
pl_P144_1
pl_P153_1
pl_P155_1
pl_P15_1
pl_P165_1
pl_P171_1
pl_P174_1
pl_P175_1
pl_P176_1
pl_P185_1
pl_P190_1
pl_P197_1
pl_P19_1
pl_P200_1
pl_P202_1
pl_P206_1
pl_P20_1
pl_P210_1
pl_P211_1
pl_P215_1
pl_P217_1
pl_P223_1
pl_P225_1
pl_P229_1
pl_P22_1
pl_P241_1
pl_P242_1
pl_P244_1
pl_P249_1
pl_P252_1
pl_P261_10
pl_P261_11
pl_P261_12
pl_P261_13
pl_P261_14
pl_P261_15
pl_P261_16
pl_P261_17
pl_P261_18
pl_P261_19
pl_P261_20
pl_P261_21
pl_P261_22
pl_P261_23
pl_P261_24
pl_P261_25
pl_P261_26
pl_P261_27
pl_P261_28
pl_P261_29
pl_P261_30
pl_P261_31
pl_P261_32
pl_P261_33
pl_P261_34
pl_P261_35
pl_P261_36
pl_P261_37
pl_P261_38
pl_P261_39
pl_P261_4
pl_P261_40
pl_P261_41
pl_P261_42
pl_P261_43
pl_P261_44
pl_P261_45
pl_P261_46
pl_P261_47
pl_P261_48
pl_P261_49
pl_P261_5
pl_P261_50
pl_P261_51
pl_P261_6
pl_P261_7
pl_P261_8
pl_P261_9
pl_P263_1
pl_P27_1
pl_P50_1
pl_P51_1
pl_P55_1
pl_P58_1
pl_P60_1
pl_P61_1
pl_P71_1
pl_P72_1
pl_P76_1
pl_P7_1
pl_P88_1
pl_P98_1
pl_P9_1
found 149 constant places
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.005sec

5561 12364 82222

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="Railroad-PT-050"
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 Railroad-PT-050, 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 r330-tall-167889203200391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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