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.r393-oct2-167903717000399.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717000399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K 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 ShieldPPPs-PT-003B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679444592089

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=ShieldPPPs-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:23:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:23:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:23:15] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-22 00:23:15] [INFO ] Transformed 207 places.
[2023-03-22 00:23:15] [INFO ] Transformed 192 transitions.
[2023-03-22 00:23:15] [INFO ] Found NUPN structural information;
[2023-03-22 00:23:15] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 16) seen :12
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 192 rows 207 cols
[2023-03-22 00:23:16] [INFO ] Computed 34 place invariants in 33 ms
[2023-03-22 00:23:16] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:23:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2023-03-22 00:23:17] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 00:23:17] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 17 ms to minimize.
[2023-03-22 00:23:17] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-22 00:23:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-22 00:23:17] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 00:23:17] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 27 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 192/192 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 207 transition count 177
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 192 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 190 transition count 175
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 34 place count 190 transition count 159
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 66 place count 174 transition count 159
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 81 place count 159 transition count 144
Iterating global reduction 3 with 15 rules applied. Total rules applied 96 place count 159 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 96 place count 159 transition count 142
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 157 transition count 142
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 182 place count 116 transition count 101
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 203 place count 116 transition count 101
Applied a total of 203 rules in 63 ms. Remains 116 /207 variables (removed 91) and now considering 101/192 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 116/207 places, 101/192 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522298 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522298 steps, saw 386616 distinct states, run finished after 3005 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 116 cols
[2023-03-22 00:23:20] [INFO ] Computed 34 place invariants in 9 ms
[2023-03-22 00:23:21] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-22 00:23:21] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:23:21] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:21] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 4 ms to minimize.
[2023-03-22 00:23:21] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-22 00:23:21] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-22 00:23:21] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-22 00:23:21] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 26 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 10 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-22 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1378 ms
[2023-03-22 00:23:22] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-22 00:23:22] [INFO ] After 1615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 14 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 116/116 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-22 00:23:22] [INFO ] Invariant cache hit.
[2023-03-22 00:23:23] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-22 00:23:23] [INFO ] Invariant cache hit.
[2023-03-22 00:23:23] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-22 00:23:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 00:23:23] [INFO ] Invariant cache hit.
[2023-03-22 00:23:23] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1055 ms. Remains : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:23:23] [INFO ] Invariant cache hit.
[2023-03-22 00:23:23] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:23:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-22 00:23:23] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:23:24] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:24] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:23:24] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-22 00:23:24] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 0 ms to minimize.
[2023-03-22 00:23:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-22 00:23:24] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 31 ms to minimize.
[2023-03-22 00:23:25] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 47 ms to minimize.
[2023-03-22 00:23:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-22 00:23:25] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 14 ms to minimize.
[2023-03-22 00:23:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 00:23:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1208 ms
[2023-03-22 00:23:25] [INFO ] After 1305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-22 00:23:25] [INFO ] After 1564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:23:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-22 00:23:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 101 transitions and 390 arcs took 2 ms.
[2023-03-22 00:23:25] [INFO ] Flatten gal took : 45 ms
Total runtime 10345 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/580/inv_0_ --inv-par
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679444675724

--------------------
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
mcc2023
rfs formula name ShieldPPPs-PT-003B-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/580/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 116 places, 101 transitions and 390 arcs
pnml2lts-sym: Petri net ShieldPPPs_PT_003B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 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: 101->97 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 116; there are 97 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: Exploration took 4972598 group checks and 0 next state calls
pnml2lts-sym: reachability took 68.100 real 271.880 user 0.240 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.050 real 0.170 user 0.000 sys
pnml2lts-sym: state space has 204026655412098 states, 115667 nodes
pnml2lts-sym: group_next: 903 nodes total
pnml2lts-sym: group_explored: 1127 nodes, 2508 short vectors total
pnml2lts-sym: max token count: 1

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="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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 r393-oct2-167903717000399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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