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

About the Execution of LTSMin+red for Murphy-PT-D2N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15762.111 1516955.00 6009477.00 388.30 FTFFFFFFFFFTTTTT 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.r521-tall-167987246500343.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 ltsminxred
Input is Murphy-PT-D2N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N050-ReachabilityFireability-00
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-01
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-02
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-03
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-04
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-05
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-06
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-07
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-08
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-09
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-10
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-11
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-12
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-13
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-14
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680904434494

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 21:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 21:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 21:53:59] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-04-07 21:53:59] [INFO ] Transformed 18 places.
[2023-04-07 21:53:59] [INFO ] Transformed 21 transitions.
[2023-04-07 21:53:59] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 12) seen :1
FORMULA Murphy-PT-D2N050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 290941 steps, run timeout after 3043 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 290941 steps, saw 187380 distinct states, run finished after 3047 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 21:54:03] [INFO ] Computed 4 invariants in 10 ms
[2023-04-07 21:54:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-07 21:54:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 21:54:04] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 21:54:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-07 21:54:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2023-04-07 21:54:05] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-04-07 21:54:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:54:05] [INFO ] After 91ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-04-07 21:54:05] [INFO ] Deduced a trap composed of 2 places in 195 ms of which 55 ms to minimize.
[2023-04-07 21:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-04-07 21:54:05] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-04-07 21:54:05] [INFO ] After 1572ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA Murphy-PT-D2N050-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 14 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:54:06] [INFO ] Invariant cache hit.
[2023-04-07 21:54:06] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10038 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 189434 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189434 steps, saw 121514 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-07 21:54:09] [INFO ] Invariant cache hit.
[2023-04-07 21:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:54:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 28 ms returned sat
[2023-04-07 21:54:09] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 21:54:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 33 ms returned sat
[2023-04-07 21:54:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 20 ms returned sat
[2023-04-07 21:54:09] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 21:54:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:54:09] [INFO ] After 64ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 21:54:09] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2023-04-07 21:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 21:54:09] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 21:54:09] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 63 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:54:10] [INFO ] Invariant cache hit.
[2023-04-07 21:54:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-04-07 21:54:10] [INFO ] Invariant cache hit.
[2023-04-07 21:54:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:54:10] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-04-07 21:54:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 21:54:10] [INFO ] Invariant cache hit.
[2023-04-07 21:54:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 10 properties.
[2023-04-07 21:54:10] [INFO ] Invariant cache hit.
[2023-04-07 21:54:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:54:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 21:54:10] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 21:54:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:54:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 21:54:10] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 21:54:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:54:10] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 21:54:10] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-04-07 21:54:11] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-04-07 21:54:11] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 30 ms.
[2023-04-07 21:54:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
[2023-04-07 21:54:11] [INFO ] Flatten gal took : 43 ms
Total runtime 12653 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/504/inv_0_ --invariant=/tmp/504/inv_1_ --invariant=/tmp/504/inv_2_ --invariant=/tmp/504/inv_3_ --invariant=/tmp/504/inv_4_ --invariant=/tmp/504/inv_5_ --invariant=/tmp/504/inv_6_ --invariant=/tmp/504/inv_7_ --invariant=/tmp/504/inv_8_ --invariant=/tmp/504/inv_9_ --inv-par
FORMULA Murphy-PT-D2N050-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680905951449

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_0_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_1_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_2_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_3_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_4_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_5_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_6_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/504/inv_7_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/504/inv_8_
rfs formula name Murphy-PT-D2N050-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/504/inv_9_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Murphy_PT_D2N050 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37763 group checks and 0 next state calls
pnml2lts-sym: reachability took 1488.830 real 5376.100 user 563.290 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.080 real 0.350 user 0.000 sys
pnml2lts-sym: state space has 41538421296 states, 199733 nodes
pnml2lts-sym: group_next: 981332 nodes total
pnml2lts-sym: group_explored: 528499 nodes, 18081738 short vectors total
pnml2lts-sym: max token count: 151

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="Murphy-PT-D2N050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-PT-D2N050, 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 r521-tall-167987246500343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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