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

About the Execution of GreatSPN+red for FamilyReunion-COL-L00020M0002C001P001G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4455.756 67975.00 116261.00 380.10 TFTFTTTFFTTTTTFT 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.r157-smll-171636265600399.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 FamilyReunion-COL-L00020M0002C001P001G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265600399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.6K Apr 11 20:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 20:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 20:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 135K 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 FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716621178399

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 07:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 07:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 07:13:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 07:13:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 07:13:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1158 ms
[2024-05-25 07:13:01] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2024-05-25 07:13:01] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 07:13:01] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 7 ms.
[2024-05-25 07:13:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
RANDOM walk for 4583 steps (0 resets) in 37 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-25 07:13:01] [INFO ] Flatten gal took : 39 ms
[2024-05-25 07:13:01] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2024-05-25 07:13:01] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 93 ms.
[2024-05-25 07:13:02] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2024-05-25 07:13:02] [INFO ] Reduced 42 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 42 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 42 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 42 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 42 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 07:13:02] [INFO ] Reduced 21 identical enabling conditions.
Deduced a syphon composed of 21 places in 34 ms
Reduce places removed 30 places and 0 transitions.
RANDOM walk for 40000 steps (32 resets) in 4611 ms. (8 steps per ms) remains 3/16 properties
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 2933 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4549 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1745 ms. (22 steps per ms) remains 3/3 properties
// Phase 1: matrix 2438 rows 3065 cols
[2024-05-25 07:13:06] [INFO ] Computed 747 invariants in 227 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2446 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 330/2776 variables, 26/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2776 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 289/3065 variables, 405/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3065 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5503/5503 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 721/721 constraints, State Equation: 3065/3065 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2446 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 330/2776 variables, 26/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2776 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 289/3065 variables, 405/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 07:13:19] [INFO ] Deduced a trap composed of 64 places in 2185 ms of which 200 ms to minimize.
SMT process timed out in 13644ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2446 out of 3065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Graph (complete) has 4456 edges and 3065 vertex of which 2971 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.11 ms
Discarding 94 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 2950 transition count 2417
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 22 place count 2950 transition count 2375
Deduced a syphon composed of 42 places in 13 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 84 rules applied. Total rules applied 106 place count 2908 transition count 2375
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 10 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 148 place count 2887 transition count 2354
Applied a total of 148 rules in 415 ms. Remains 2887 /3065 variables (removed 178) and now considering 2354/2438 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 2887/3065 places, 2354/2438 transitions.
RANDOM walk for 40000 steps (32 resets) in 2049 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4025 ms. (9 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3105 ms. (12 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1775 ms. (22 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 364053 steps, run timeout after 9001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 364053 steps, saw 101661 distinct states, run finished after 9007 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 2354 rows 2887 cols
[2024-05-25 07:13:32] [INFO ] Computed 677 invariants in 99 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2446 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 399/2845 variables, 497/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2845 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2354/5199 variables, 2845/3522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5199 variables, 0/3522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 42/5241 variables, 42/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5241 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/5241 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5241/5241 variables, and 3564 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15949 ms.
Refiners :[Generalized P Invariants (flows): 677/677 constraints, State Equation: 2887/2887 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2446 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 399/2845 variables, 497/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2845 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2354/5199 variables, 2845/3522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5199 variables, 0/3522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 42/5241 variables, 42/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5241 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/5241 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5241/5241 variables, and 3564 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15514 ms.
Refiners :[Generalized P Invariants (flows): 677/677 constraints, State Equation: 2887/2887 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 33964ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1201 steps, including 2 resets, run visited all 3 properties in 32 ms. (steps per millisecond=37 )
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 46 ms.
All properties solved without resorting to model-checking.
Total runtime 66103 ms.
ITS solved all properties within timeout

BK_STOP 1716621246374

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FamilyReunion-COL-L00020M0002C001P001G001"
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 FamilyReunion-COL-L00020M0002C001P001G001, 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 r157-smll-171636265600399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 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 ;