Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978300486.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d2m64, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978300486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679320436552

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=SieveSingleMsgMbox-PT-d2m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 13:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:53:58] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-20 13:53:58] [INFO ] Transformed 2398 places.
[2023-03-20 13:53:58] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:53:58] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 15 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2198 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 382042 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 382042 steps, saw 176621 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 13:54:02] [INFO ] Computed 6 place invariants in 71 ms
[2023-03-20 13:54:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-20 13:54:02] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:54:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:54:02] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:54:03] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:03] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 13:54:04] [INFO ] After 1050ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:04] [INFO ] After 1167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-20 13:54:04] [INFO ] After 2094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.6 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1167 place count 180 transition count 273
Iterating global reduction 2 with 90 rules applied. Total rules applied 1257 place count 180 transition count 273
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1292 place count 180 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1329 place count 143 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1366 place count 143 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1388 place count 143 transition count 166
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1397 place count 134 transition count 153
Iterating global reduction 4 with 9 rules applied. Total rules applied 1406 place count 134 transition count 153
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1415 place count 125 transition count 144
Iterating global reduction 4 with 9 rules applied. Total rules applied 1424 place count 125 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1429 place count 120 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 1434 place count 120 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1436 place count 120 transition count 136
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1441 place count 115 transition count 131
Iterating global reduction 5 with 5 rules applied. Total rules applied 1446 place count 115 transition count 131
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1449 place count 112 transition count 128
Iterating global reduction 5 with 3 rules applied. Total rules applied 1452 place count 112 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1453 place count 111 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 1454 place count 111 transition count 127
Applied a total of 1454 rules in 126 ms. Remains 111 /414 variables (removed 303) and now considering 127/1954 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 111/414 places, 127/1954 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2587342 steps, run timeout after 3001 ms. (steps per millisecond=862 ) properties seen :{}
Probabilistic random walk after 2587342 steps, saw 1183703 distinct states, run finished after 3001 ms. (steps per millisecond=862 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 111 cols
[2023-03-20 13:54:08] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-20 13:54:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:54:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:54:08] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:54:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:54:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:08] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 13:54:08] [INFO ] After 30ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:08] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 13:54:08] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 127/127 transitions.
Applied a total of 0 rules in 16 ms. Remains 111 /111 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 111/111 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 127/127 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-20 13:54:08] [INFO ] Invariant cache hit.
[2023-03-20 13:54:08] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-20 13:54:08] [INFO ] Invariant cache hit.
[2023-03-20 13:54:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 13:54:09] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-20 13:54:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:54:09] [INFO ] Invariant cache hit.
[2023-03-20 13:54:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 111/111 places, 127/127 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 107 transition count 121
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 10 place count 107 transition count 101
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 50 place count 87 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 83 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 81 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 81 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 80 transition count 105
Applied a total of 64 rules in 20 ms. Remains 80 /111 variables (removed 31) and now considering 105/127 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 80 cols
[2023-03-20 13:54:09] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 13:54:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 13:54:09] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:09] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:54:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 13:54:09] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:54:09] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:09] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 13:54:09] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:54:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2023-03-20 13:54:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 127 transitions and 506 arcs took 4 ms.
[2023-03-20 13:54:09] [INFO ] Flatten gal took : 61 ms
Total runtime 11342 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/496/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 1122148 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099712 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-03

BK_STOP 1679324020986

--------------------
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
mcc2023
rfs formula name SieveSingleMsgMbox-PT-d2m64-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/496/inv_0_
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 111 places, 127 transitions and 506 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d2m64 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: 127->125 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.010 sys
pnml2lts-sym: state vector length is 111; there are 125 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
Killing (15) : 502
Killing (9) : 502

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="SieveSingleMsgMbox-PT-d2m64"
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 SieveSingleMsgMbox-PT-d2m64, 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 r425-tajo-167905978300486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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