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.r605-tall-171774426700166.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 ltsminxred
Input is BlocksWorld-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 87K Jun 7 06:26 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 BlocksWorld-PT-01-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-01-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717745483218

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:31:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:31:24] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-07 07:31:24] [INFO ] Transformed 109 places.
[2024-06-07 07:31:24] [INFO ] Transformed 181 transitions.
[2024-06-07 07:31:24] [INFO ] Found NUPN structural information;
[2024-06-07 07:31:24] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2024-06-07 07:31:24] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2893 ms. (13 steps per ms) remains 12/14 properties
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 956 ms. (41 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1575 ms. (25 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 500 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 824 ms. (48 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 12/12 properties
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:31:27] [INFO ] Computed 19 invariants in 15 ms
[2024-06-07 07:31:27] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 10 solved, 2 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 47 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 2 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 13 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 2301 ms of which 36 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 7 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 6050ms, After SMT, problems are : Problem set: 10 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 109 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 181/181 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 180
Applied a total of 1 rules in 44 ms. Remains 109 /109 variables (removed 0) and now considering 180/181 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 109/109 places, 180/181 transitions.
RANDOM walk for 40000 steps (8 resets) in 616 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 346408 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 346408 steps, saw 190546 distinct states, run finished after 3009 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 180 rows 109 cols
[2024-06-07 07:31:37] [INFO ] Computed 19 invariants in 6 ms
[2024-06-07 07:31:37] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:31:38] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-01-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BlocksWorld-PT-01-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 109/289 variables, and 44 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/109 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 1716ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 14523 ms.
ITS solved all properties within timeout

BK_STOP 1717745498900

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="BlocksWorld-PT-01"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BlocksWorld-PT-01, 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 r605-tall-171774426700166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-01.tgz
mv BlocksWorld-PT-01 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;