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.r169-tall-167838855800415.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678541294565

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=FamilyReunion-PT-L00050M0005C002P002G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 13:28:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 13:28:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:28:16] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2023-03-11 13:28:16] [INFO ] Transformed 12194 places.
[2023-03-11 13:28:16] [INFO ] Transformed 10560 transitions.
[2023-03-11 13:28:16] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 16) seen :12
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 13:28:18] [INFO ] Computed 2768 place invariants in 620 ms
[2023-03-11 13:28:20] [INFO ] [Real]Absence check using 149 positive place invariants in 327 ms returned sat
[2023-03-11 13:28:22] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1369 ms returned sat
[2023-03-11 13:28:43] [INFO ] After 20634ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 13:28:43] [INFO ] After 20654ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 13:28:43] [INFO ] After 25134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-11 13:28:45] [INFO ] [Nat]Absence check using 149 positive place invariants in 305 ms returned sat
[2023-03-11 13:28:47] [INFO ] [Nat]Absence check using 149 positive and 2619 generalized place invariants in 1408 ms returned sat
[2023-03-11 13:29:08] [INFO ] After 20910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 13:29:08] [INFO ] After 20913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 13:29:08] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 93 ms.
Support contains 32 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11594 are kept as prefixes of interest. Removing 583 places using SCC suffix rule.30 ms
Discarding 583 places :
Also discarding 460 output transitions
Drop transitions removed 460 transitions
Drop transitions removed 50 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1831 places :
Implicit places reduction removed 1831 places
Drop transitions removed 5360 transitions
Trivial Post-agglo rules discarded 5360 transitions
Performed 5360 trivial Post agglomeration. Transition count delta: 5360
Iterating post reduction 0 with 7242 rules applied. Total rules applied 7243 place count 9763 transition count 4689
Reduce places removed 5360 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 5376 rules applied. Total rules applied 12619 place count 4403 transition count 4673
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 12635 place count 4387 transition count 4673
Performed 616 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 616 Pre rules applied. Total rules applied 12635 place count 4387 transition count 4057
Deduced a syphon composed of 616 places in 9 ms
Ensure Unique test removed 304 places
Reduce places removed 920 places and 0 transitions.
Iterating global reduction 3 with 1536 rules applied. Total rules applied 14171 place count 3467 transition count 4057
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 3 with 202 rules applied. Total rules applied 14373 place count 3467 transition count 3855
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 4 with 202 rules applied. Total rules applied 14575 place count 3265 transition count 3855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 14575 place count 3265 transition count 3854
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 14577 place count 3264 transition count 3854
Discarding 1117 places :
Symmetric choice reduction at 5 with 1117 rule applications. Total rules 15694 place count 2147 transition count 2737
Iterating global reduction 5 with 1117 rules applied. Total rules applied 16811 place count 2147 transition count 2737
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 5 with 586 rules applied. Total rules applied 17397 place count 2050 transition count 2248
Reduce places removed 389 places and 0 transitions.
Iterating post reduction 6 with 389 rules applied. Total rules applied 17786 place count 1661 transition count 2248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 62 Pre rules applied. Total rules applied 17786 place count 1661 transition count 2186
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 7 with 124 rules applied. Total rules applied 17910 place count 1599 transition count 2186
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 17917 place count 1592 transition count 1829
Iterating global reduction 7 with 7 rules applied. Total rules applied 17924 place count 1592 transition count 1829
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 7 with 353 rules applied. Total rules applied 18277 place count 1490 transition count 1578
Reduce places removed 98 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 100 rules applied. Total rules applied 18377 place count 1392 transition count 1576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 18379 place count 1390 transition count 1576
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 18379 place count 1390 transition count 1525
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 18481 place count 1339 transition count 1525
Discarding 198 places :
Symmetric choice reduction at 10 with 198 rule applications. Total rules 18679 place count 1141 transition count 1327
Iterating global reduction 10 with 198 rules applied. Total rules applied 18877 place count 1141 transition count 1327
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 10 with 198 rules applied. Total rules applied 19075 place count 1141 transition count 1129
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 1 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 11 with 408 rules applied. Total rules applied 19483 place count 937 transition count 925
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 19484 place count 937 transition count 924
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 19486 place count 936 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 19487 place count 935 transition count 923
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 19487 place count 935 transition count 922
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 19489 place count 934 transition count 922
Free-agglomeration rule (complex) applied 109 times.
Iterating global reduction 13 with 109 rules applied. Total rules applied 19598 place count 934 transition count 813
Ensure Unique test removed 50 places
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 13 with 159 rules applied. Total rules applied 19757 place count 775 transition count 813
Applied a total of 19757 rules in 2094 ms. Remains 775 /12177 variables (removed 11402) and now considering 813/10560 (removed 9747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2095 ms. Remains : 775/12177 places, 813/10560 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 813 rows 775 cols
[2023-03-11 13:29:11] [INFO ] Computed 221 place invariants in 12 ms
[2023-03-11 13:29:11] [INFO ] [Real]Absence check using 0 positive and 221 generalized place invariants in 41 ms returned sat
[2023-03-11 13:29:11] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 13:29:11] [INFO ] [Nat]Absence check using 0 positive and 221 generalized place invariants in 50 ms returned sat
[2023-03-11 13:29:11] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 13:29:12] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-11 13:29:12] [INFO ] After 948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 222 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=55 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 55990 ms.
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/466/inv_0_ --invariant=/tmp/466/inv_1_ --invariant=/tmp/466/inv_2_ --invariant=/tmp/466/inv_3_ --invariant=/tmp/466/inv_4_ --invariant=/tmp/466/inv_5_ --invariant=/tmp/466/inv_6_ --invariant=/tmp/466/inv_7_ --invariant=/tmp/466/inv_8_ --invariant=/tmp/466/inv_9_ --invariant=/tmp/466/inv_10_ --invariant=/tmp/466/inv_11_ --invariant=/tmp/466/inv_12_ --invariant=/tmp/466/inv_13_ --invariant=/tmp/466/inv_14_ --invariant=/tmp/466/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5977656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091740 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r169-tall-167838855800415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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