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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15818.399 1215894.00 4817694.00 613.20 FFFFFTTFTFTTTTTT 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-167987246600366.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-D4N025, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 19K 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-D4N025-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680909717098

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N025
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 23:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 23:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 23:22:03] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-04-07 23:22:03] [INFO ] Transformed 30 places.
[2023-04-07 23:22:03] [INFO ] Transformed 35 transitions.
[2023-04-07 23:22:03] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 14) seen :6
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:22:04] [INFO ] Computed 6 invariants in 4 ms
[2023-04-07 23:22:04] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-04-07 23:22:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-07 23:22:04] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:22:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:22:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:22:04] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:22:04] [INFO ] After 151ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:05] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-04-07 23:22:05] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 154 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 22 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:22:05] [INFO ] Invariant cache hit.
[2023-04-07 23:22:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 182874 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182874 steps, saw 126394 distinct states, run finished after 3006 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 23:22:09] [INFO ] Invariant cache hit.
[2023-04-07 23:22:09] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-04-07 23:22:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:22:09] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:22:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:22:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:22:09] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:22:09] [INFO ] After 107ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:09] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 1 ms to minimize.
[2023-04-07 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-07 23:22:09] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2023-04-07 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-07 23:22:09] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-04-07 23:22:10] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 118 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:22:10] [INFO ] Invariant cache hit.
[2023-04-07 23:22:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 23:22:10] [INFO ] Invariant cache hit.
[2023-04-07 23:22:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:22:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-04-07 23:22:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 23:22:10] [INFO ] Invariant cache hit.
[2023-04-07 23:22:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 23:22:10] [INFO ] Invariant cache hit.
[2023-04-07 23:22:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:22:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 23:22:10] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:22:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:22:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 23:22:10] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:22:10] [INFO ] After 74ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:10] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2023-04-07 23:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 23:22:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2023-04-07 23:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-07 23:22:10] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-04-07 23:22:10] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:22:10] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 21 ms.
[2023-04-07 23:22:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 0 ms.
[2023-04-07 23:22:11] [INFO ] Flatten gal took : 61 ms
Total runtime 8677 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 --invariant=/tmp/507/inv_0_ --invariant=/tmp/507/inv_1_ --invariant=/tmp/507/inv_2_ --invariant=/tmp/507/inv_3_ --invariant=/tmp/507/inv_4_ --invariant=/tmp/507/inv_5_ --invariant=/tmp/507/inv_6_ --invariant=/tmp/507/inv_7_ --inv-par
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680910932992

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_0_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_1_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_2_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_3_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_4_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/507/inv_5_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/507/inv_6_
rfs formula name Murphy-PT-D4N025-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/507/inv_7_
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 30 places, 35 transitions and 135 arcs
pnml2lts-sym: Petri net Murphy_PT_D4N025 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: 35->15 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 30; there are 15 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 417134 group checks and 0 next state calls
pnml2lts-sym: reachability took 1198.760 real 4489.500 user 294.160 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.220 real 0.890 user 0.000 sys
pnml2lts-sym: state space has 2.0012606308671e+16 states, 365218 nodes
pnml2lts-sym: group_next: 1166565 nodes total
pnml2lts-sym: group_explored: 579843 nodes, 16362765 short vectors total
pnml2lts-sym: max token count: 130

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-D4N025"
export BK_EXAMINATION="ReachabilityCardinality"
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-D4N025, 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 r521-tall-167987246600366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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