fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734919900047
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
308.476 7833.00 23240.00 146.60 FFFTTFFTFTTTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734919900047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 33K Jun 2 16:33 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 MedleyA-PT-06-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355681902

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-02 19:14:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:14:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:14:44] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 19:14:44] [INFO ] Transformed 124 places.
[2024-06-02 19:14:44] [INFO ] Transformed 118 transitions.
[2024-06-02 19:14:44] [INFO ] Found NUPN structural information;
[2024-06-02 19:14:44] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:14:45] [INFO ] Flatten gal took : 182 ms
[2024-06-02 19:14:45] [INFO ] Flatten gal took : 67 ms
[2024-06-02 19:14:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14105817050217526007.gal : 22 ms
RANDOM walk for 40000 steps (1115 resets) in 2083 ms. (19 steps per ms) remains 6/15 properties
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 19:14:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3247358232029017480.prop : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14105817050217526007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3247358232029017480.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3247358232029017480.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :14 after 93
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :93 after 104
BEST_FIRST walk for 40002 steps (328 resets) in 921 ms. (43 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :104 after 3374
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3374 after 5854
BEST_FIRST walk for 40004 steps (240 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (236 resets) in 748 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (346 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (303 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (255 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
// Phase 1: matrix 118 rows 124 cols
[2024-06-02 19:14:46] [INFO ] Computed 24 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/118 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 31/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2024-02 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 6/124 variables, 7/142 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 6/148 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 118/242 variables, 124/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 272 constraints, problems are : Problem set: 1 solved, 5 unsolved in 665 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 37/115 variables, 12/91 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5854 after 369854
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 37/128 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 3/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 19:14:47] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 16 ms to minimize.
[2024-06-02 19:14:47] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:14:47] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 19:14:48] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2024-03 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 9/124 variables, 8/143 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 9/152 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-02 19:14:48] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
Problem MedleyA-PT-06-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 19:14:48] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
Problem MedleyA-PT-06-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 19:14:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 3/155 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/155 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/242 variables, 124/279 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-02 19:14:48] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 1/281 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/242 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 281 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1187 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 2053ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 29 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 119 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 117 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 115 transition count 114
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 115 transition count 111
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 112 transition count 111
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 32 place count 99 transition count 98
Iterating global reduction 3 with 13 rules applied. Total rules applied 45 place count 99 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 99 transition count 96
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 49 place count 97 transition count 96
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 84 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 83 transition count 83
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 83 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 80 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 80 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 79 transition count 79
Applied a total of 85 rules in 75 ms. Remains 79 /124 variables (removed 45) and now considering 79/118 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 79/124 places, 79/118 transitions.
RANDOM walk for 40000 steps (2009 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (505 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :369854 after 416002
Finished probabilistic random walk after 625240 steps, run visited all 1 properties in 713 ms. (steps per millisecond=876 )
Probabilistic random walk after 625240 steps, saw 110651 distinct states, run finished after 720 ms. (steps per millisecond=868 ) properties seen :1
FORMULA MedleyA-PT-06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 5290 ms.

BK_STOP 1717355689735

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-06, 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 r576-smll-171734919900047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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