About the Execution of LTSMin+red for ShieldRVt-PT-100A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2963.123 | 3593421.00 | 14316356.00 | 78.30 | FFFTFTTTFFFTFFF? | normal |
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-167905978100342.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 ShieldRVt-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100342
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 273K 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 ShieldRVt-PT-100A-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679311224543
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=ShieldRVt-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:20:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:20:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:20:26] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-20 11:20:26] [INFO ] Transformed 803 places.
[2023-03-20 11:20:26] [INFO ] Transformed 803 transitions.
[2023-03-20 11:20:26] [INFO ] Found NUPN structural information;
[2023-03-20 11:20:26] [INFO ] Parsed PT model containing 803 places and 803 transitions and 3406 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 13) seen :1
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 228746 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1}
Probabilistic random walk after 228746 steps, saw 226843 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :11
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:20:31] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-20 11:20:31] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:20:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 61 ms returned sat
[2023-03-20 11:20:32] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:32] [INFO ] After 900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-20 11:20:33] [INFO ] After 1343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 34 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 92 times.
Drop transitions removed 92 transitions
Iterating global reduction 0 with 92 rules applied. Total rules applied 94 place count 802 transition count 801
Drop transitions removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 0 with 92 rules applied. Total rules applied 186 place count 802 transition count 709
Applied a total of 186 rules in 295 ms. Remains 802 /803 variables (removed 1) and now considering 709/802 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 802/803 places, 709/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276050 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 276050 steps, saw 273960 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 709 rows 802 cols
[2023-03-20 11:20:36] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 11:20:36] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:20:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 56 ms returned sat
[2023-03-20 11:20:37] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 11:20:37] [INFO ] After 186ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:37] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-20 11:20:38] [INFO ] After 1298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 34 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 709/709 transitions.
Applied a total of 0 rules in 49 ms. Remains 802 /802 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 802/802 places, 709/709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 709/709 transitions.
Applied a total of 0 rules in 37 ms. Remains 802 /802 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2023-03-20 11:20:38] [INFO ] Invariant cache hit.
[2023-03-20 11:20:38] [INFO ] Implicit Places using invariants in 535 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 542 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 801/802 places, 709/709 transitions.
Applied a total of 0 rules in 38 ms. Remains 801 /801 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 618 ms. Remains : 801/802 places, 709/709 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 304213 steps, run timeout after 3002 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 304213 steps, saw 301892 distinct states, run finished after 3003 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 709 rows 801 cols
[2023-03-20 11:20:41] [INFO ] Computed 400 place invariants in 9 ms
[2023-03-20 11:20:42] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:20:42] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-20 11:20:42] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:42] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-20 11:20:42] [INFO ] After 954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 34 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 709/709 transitions.
Applied a total of 0 rules in 27 ms. Remains 801 /801 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 801/801 places, 709/709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 709/709 transitions.
Applied a total of 0 rules in 25 ms. Remains 801 /801 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2023-03-20 11:20:43] [INFO ] Invariant cache hit.
[2023-03-20 11:20:43] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-20 11:20:43] [INFO ] Invariant cache hit.
[2023-03-20 11:20:44] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2023-03-20 11:20:44] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-20 11:20:44] [INFO ] Invariant cache hit.
[2023-03-20 11:20:44] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1758 ms. Remains : 801/801 places, 709/709 transitions.
Applied a total of 0 rules in 25 ms. Remains 801 /801 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 11:20:44] [INFO ] Invariant cache hit.
[2023-03-20 11:20:44] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:20:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 56 ms returned sat
[2023-03-20 11:20:45] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:45] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-20 11:20:46] [INFO ] After 1206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:20:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-20 11:20:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 801 places, 709 transitions and 3213 arcs took 8 ms.
[2023-03-20 11:20:46] [INFO ] Flatten gal took : 188 ms
Total runtime 20317 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/516/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 16029156 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095248 kB
Could not compute solution for formula : ShieldRVt-PT-100A-ReachabilityCardinality-15
BK_STOP 1679314817964
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 ShieldRVt-PT-100A-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/516/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 801 places, 709 transitions and 3213 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_100A analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 709->402 groups
pnml2lts-sym: Regrouping took 0.330 real 0.340 user 0.000 sys
pnml2lts-sym: state vector length is 801; there are 402 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
Killing (15) : 522
Killing (9) : 522
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="ShieldRVt-PT-100A"
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 ShieldRVt-PT-100A, 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-167905978100342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100A.tgz
mv ShieldRVt-PT-100A 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 '
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 ;