fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r504-tall-171649612700391
Last Updated
July 7, 2024

About the Execution of LTSMin+red for LeafsetExtension-PT-S64C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1438.104 117969.00 153409.00 435.60 FTTFFTTFFTTTTTFT 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.r504-tall-171649612700391.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 LeafsetExtension-PT-S64C2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 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 LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228866177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:01:08] [INFO ] Load time of PNML (sax parser for PT used): 704 ms
[2024-06-01 08:01:08] [INFO ] Transformed 21462 places.
[2024-06-01 08:01:08] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:01:08] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 974 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 136 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2195 resets) in 3017 ms. (13 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 494 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 202 ms. (197 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 785 ms. (50 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 274 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (112 resets) in 105 ms. (377 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (100 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (44 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (99 resets) in 106 ms. (373 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (101 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-06-01 08:01:13] [INFO ] Computed 333 invariants in 2614 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 26/209 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20269/20478 variables, 121/147 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20478/42591 variables, and 147 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 26/67 constraints, Generalized P Invariants (flows): 121/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 22/165 variables, 22/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19974/20139 variables, 105/127 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 08:02:46] [INFO ] Deduced a trap composed of 415 places in 84468 ms of which 945 ms to minimize.
SMT process timed out in 96335ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 143 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 10613 are kept as prefixes of interest. Removing 10849 places using SCC suffix rule.37 ms
Discarding 10849 places :
Also discarding 5216 output transitions
Drop transitions (Output transitions of discarded places.) removed 5216 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1355 transitions
Reduce isomorphic transitions removed 1355 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4033 transitions
Trivial Post-agglo rules discarded 4033 transitions
Performed 4033 trivial Post agglomeration. Transition count delta: 4033
Iterating post reduction 0 with 5388 rules applied. Total rules applied 5389 place count 10613 transition count 10525
Reduce places removed 4034 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 4042 rules applied. Total rules applied 9431 place count 6579 transition count 10517
Reduce places removed 8 places and 0 transitions.
Performed 602 Post agglomeration using F-continuation condition.Transition count delta: 602
Iterating post reduction 2 with 610 rules applied. Total rules applied 10041 place count 6571 transition count 9915
Reduce places removed 602 places and 0 transitions.
Iterating post reduction 3 with 602 rules applied. Total rules applied 10643 place count 5969 transition count 9915
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 10643 place count 5969 transition count 9837
Deduced a syphon composed of 78 places in 21 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 10799 place count 5891 transition count 9837
Discarding 2680 places :
Symmetric choice reduction at 4 with 2680 rule applications. Total rules 13479 place count 3211 transition count 7157
Iterating global reduction 4 with 2680 rules applied. Total rules applied 16159 place count 3211 transition count 7157
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 16190 place count 3180 transition count 7126
Iterating global reduction 4 with 31 rules applied. Total rules applied 16221 place count 3180 transition count 7126
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16222 place count 3179 transition count 7126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 16224 place count 3178 transition count 7125
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 16233 place count 3178 transition count 7116
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 16242 place count 3169 transition count 7116
Partial Free-agglomeration rule applied 283 times.
Drop transitions (Partial Free agglomeration) removed 283 transitions
Iterating global reduction 6 with 283 rules applied. Total rules applied 16525 place count 3169 transition count 7116
Applied a total of 16525 rules in 5221 ms. Remains 3169 /21462 variables (removed 18293) and now considering 7116/21129 (removed 14013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5234 ms. Remains : 3169/21462 places, 7116/21129 transitions.
RANDOM walk for 40000 steps (4284 resets) in 1884 ms. (21 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 279 ms. (142 steps per ms) remains 3/4 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (140 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
[2024-06-01 08:02:52] [INFO ] Flow matrix only has 5638 transitions (discarded 1478 similar events)
// Phase 1: matrix 5638 rows 3169 cols
[2024-06-01 08:02:52] [INFO ] Computed 116 invariants in 85 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 704/790 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/791 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1881/2672 variables, 791/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2672 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4446/7118 variables, 696/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7118 variables, 58/1567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7118 variables, 0/1567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1517/8635 variables, 36/1603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8635 variables, 1511/3114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8635 variables, 0/3114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 172/8807 variables, 171/3285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8807 variables, 0/3285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/8807 variables, 0/3285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8807/8807 variables, and 3285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4490 ms.
Refiners :[Generalized P Invariants (flows): 116/116 constraints, State Equation: 3169/3169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 704/790 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/791 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1881/2672 variables, 791/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2672 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4446/7118 variables, 696/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7118 variables, 58/1567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7118 variables, 3/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7118 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1517/8635 variables, 36/1606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8635 variables, 1511/3117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8635 variables, 0/3117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 172/8807 variables, 171/3288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8807 variables, 0/3288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/8807 variables, 0/3288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8807/8807 variables, and 3288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6246 ms.
Refiners :[Generalized P Invariants (flows): 116/116 constraints, State Equation: 3169/3169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 11084ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 41 ms.
All properties solved without resorting to model-checking.
Total runtime 116644 ms.
ITS solved all properties within timeout

BK_STOP 1717228984146

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="LeafsetExtension-PT-S64C2"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S64C2, 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 r504-tall-171649612700391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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