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.r223-tall-171649611300391.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 greatspnxred
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 r223-tall-171649611300391
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 11:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 11:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:26:57] [INFO ] Load time of PNML (sax parser for PT used): 695 ms
[2024-05-24 11:26:57] [INFO ] Transformed 21462 places.
[2024-05-24 11:26:57] [INFO ] Transformed 21129 transitions.
[2024-05-24 11:26:57] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 908 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2194 resets) in 3190 ms. (12 steps per ms) remains 8/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-09 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-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (98 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 679 ms. (58 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (99 resets) in 1175 ms. (34 steps per ms) remains 6/7 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 11:27:02] [INFO ] Computed 333 invariants in 2635 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/146 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 19984/20130 variables, 101/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20130/42591 variables, and 119 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 18/67 constraints, Generalized P Invariants (flows): 101/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/104 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19683/19787 variables, 81/95 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19787 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19840/42591 variables, and 148 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 81/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 13095ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 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 10058 are kept as prefixes of interest. Removing 11404 places using SCC suffix rule.36 ms
Discarding 11404 places :
Also discarding 5415 output transitions
Drop transitions (Output transitions of discarded places.) removed 5415 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1708 transitions
Reduce isomorphic transitions removed 1708 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4355 transitions
Trivial Post-agglo rules discarded 4355 transitions
Performed 4355 trivial Post agglomeration. Transition count delta: 4355
Iterating post reduction 0 with 6063 rules applied. Total rules applied 6064 place count 10058 transition count 9651
Reduce places removed 4356 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 4365 rules applied. Total rules applied 10429 place count 5702 transition count 9642
Reduce places removed 9 places and 0 transitions.
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Iterating post reduction 2 with 204 rules applied. Total rules applied 10633 place count 5693 transition count 9447
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 3 with 195 rules applied. Total rules applied 10828 place count 5498 transition count 9447
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 10828 place count 5498 transition count 9372
Deduced a syphon composed of 75 places in 7 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 10978 place count 5423 transition count 9372
Discarding 2361 places :
Symmetric choice reduction at 4 with 2361 rule applications. Total rules 13339 place count 3062 transition count 7011
Iterating global reduction 4 with 2361 rules applied. Total rules applied 15700 place count 3062 transition count 7011
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 15731 place count 3031 transition count 6980
Iterating global reduction 4 with 31 rules applied. Total rules applied 15762 place count 3031 transition count 6980
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 15763 place count 3030 transition count 6980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 15765 place count 3029 transition count 6979
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 15771 place count 3029 transition count 6973
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 15777 place count 3023 transition count 6973
Partial Free-agglomeration rule applied 352 times.
Drop transitions (Partial Free agglomeration) removed 352 transitions
Iterating global reduction 6 with 352 rules applied. Total rules applied 16129 place count 3023 transition count 6973
Applied a total of 16129 rules in 3446 ms. Remains 3023 /21462 variables (removed 18439) and now considering 6973/21129 (removed 14156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3460 ms. Remains : 3023/21462 places, 6973/21129 transitions.
RANDOM walk for 40000 steps (4546 resets) in 1130 ms. (35 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (151 resets) in 207 ms. (192 steps per ms) remains 3/4 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (81 resets) in 142 ms. (279 steps per ms) remains 2/3 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (136 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-05-24 11:27:16] [INFO ] Flow matrix only has 5388 transitions (discarded 1585 similar events)
// Phase 1: matrix 5388 rows 3023 cols
[2024-05-24 11:27:16] [INFO ] Computed 107 invariants in 91 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 258/397 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 5390/5787 variables, 318/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5787 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2140/7927 variables, 100/561 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7927 variables, 2115/2676 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7927 variables, 0/2676 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 473/8400 variables, 440/3116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8400 variables, 0/3116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/8403 variables, 3/3119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8403 variables, 3/3122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8403 variables, 0/3122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/8411 variables, 8/3130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/8411 variables, 0/3130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/8411 variables, 0/3130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8411/8411 variables, and 3130 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2520 ms.
Refiners :[Generalized P Invariants (flows): 107/107 constraints, State Equation: 3023/3023 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/133 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/329 variables, 134/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5388/5717 variables, 258/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5717 variables, 1/396 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5717 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2145/7862 variables, 100/496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7862 variables, 2120/2616 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7862 variables, 0/2616 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 537/8399 variables, 499/3115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8399 variables, 0/3115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/8403 variables, 4/3119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8403 variables, 4/3123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/8403 variables, 0/3123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/8411 variables, 8/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/8411 variables, 0/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/8411 variables, 0/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8411/8411 variables, and 3131 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2278 ms.
Refiners :[Generalized P Invariants (flows): 107/107 constraints, State Equation: 3023/3023 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4937ms problems are : Problem set: 1 solved, 1 unsolved
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 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 25012 ms.
ITS solved all properties within timeout

BK_STOP 1716550041449

--------------------
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="greatspnxred"
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 greatspnxred"
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 r223-tall-171649611300391"
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 ;