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-171649611300359.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-S16C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 13:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 905K 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-S16C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716542841979

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-S16C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 09:27:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 09:27:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:27:23] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-24 09:27:23] [INFO ] Transformed 1542 places.
[2024-05-24 09:27:23] [INFO ] Transformed 1449 transitions.
[2024-05-24 09:27:23] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1193 resets) in 2048 ms. (19 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (66 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (138 resets) in 204 ms. (195 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 941 ms. (42 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (112 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (128 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (63 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 229 ms. (173 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (114 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (113 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (113 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
// Phase 1: matrix 1449 rows 1542 cols
[2024-05-24 09:27:25] [INFO ] Computed 93 invariants in 93 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/184 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1324/1508 variables, 61/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1508 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/1513 variables, 5/80 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1513 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 29/1542 variables, 13/93 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1449/2991 variables, 1542/1635 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2991/2991 variables, and 1635 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/121 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1302/1424 variables, 51/60 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-24 09:27:29] [INFO ] Deduced a trap composed of 106 places in 807 ms of which 89 ms to minimize.
[2024-05-24 09:27:30] [INFO ] Deduced a trap composed of 106 places in 695 ms of which 10 ms to minimize.
[2024-05-24 09:27:31] [INFO ] Deduced a trap composed of 124 places in 643 ms of which 16 ms to minimize.
[2024-05-24 09:27:31] [INFO ] Deduced a trap composed of 115 places in 639 ms of which 10 ms to minimize.
[2024-05-24 09:27:32] [INFO ] Deduced a trap composed of 106 places in 641 ms of which 10 ms to minimize.
[2024-05-24 09:27:33] [INFO ] Deduced a trap composed of 124 places in 662 ms of which 10 ms to minimize.
[2024-05-24 09:27:33] [INFO ] Deduced a trap composed of 124 places in 659 ms of which 10 ms to minimize.
SMT process timed out in 8785ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 1005 are kept as prefixes of interest. Removing 537 places using SCC suffix rule.5 ms
Discarding 537 places :
Also discarding 175 output transitions
Drop transitions (Output transitions of discarded places.) removed 175 transitions
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 1005 transition count 1042
Reduce places removed 167 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 173 rules applied. Total rules applied 406 place count 838 transition count 1036
Reduce places removed 6 places and 0 transitions.
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Iterating post reduction 2 with 171 rules applied. Total rules applied 577 place count 832 transition count 871
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 3 with 165 rules applied. Total rules applied 742 place count 667 transition count 871
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 742 place count 667 transition count 848
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 788 place count 644 transition count 848
Discarding 140 places :
Symmetric choice reduction at 4 with 140 rule applications. Total rules 928 place count 504 transition count 708
Iterating global reduction 4 with 140 rules applied. Total rules applied 1068 place count 504 transition count 708
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1079 place count 493 transition count 697
Iterating global reduction 4 with 11 rules applied. Total rules applied 1090 place count 493 transition count 697
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1097 place count 493 transition count 690
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1104 place count 486 transition count 690
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 1136 place count 486 transition count 690
Applied a total of 1136 rules in 343 ms. Remains 486 /1542 variables (removed 1056) and now considering 690/1449 (removed 759) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 486/1542 places, 690/1449 transitions.
RANDOM walk for 40000 steps (2063 resets) in 1037 ms. (38 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (164 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (147 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
[2024-05-24 09:27:34] [INFO ] Flow matrix only has 681 transitions (discarded 9 similar events)
// Phase 1: matrix 681 rows 486 cols
[2024-05-24 09:27:34] [INFO ] Computed 37 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 191/259 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 473/732 variables, 259/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/732 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 347/1079 variables, 148/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 9/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 30/1109 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1109 variables, 22/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/1167 variables, 57/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1167 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 523 constraints, problems are : Problem set: 0 solved, 3 unsolved in 588 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 486/486 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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 191/259 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 473/732 variables, 259/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/732 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 347/1079 variables, 148/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 9/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 30/1109 variables, 8/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 22/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1109 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 58/1167 variables, 57/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1167 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1167 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 526 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1111 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1755ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 29 ms.
All properties solved without resorting to model-checking.
Total runtime 13260 ms.
ITS solved all properties within timeout

BK_STOP 1716542856538

--------------------
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-S16C4"
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-S16C4, 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-171649611300359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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