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

About the Execution of GreatSPN+red for TokenRing-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16208.304 1649344.00 1273706.00 23654.40 FTTFTFFF??T????? 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.r421-smll-171690572800183.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 TokenRing-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-smll-171690572800183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 100M
-rw-r--r-- 1 mcc users 267K Apr 11 19:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Apr 11 19:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 19M Apr 11 19:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 216K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 735K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.8M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 795K Apr 11 21:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.8M Apr 11 21:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13M Apr 11 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44M Apr 11 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.0M May 18 16:43 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 TokenRing-PT-020-ReachabilityFireability-2024-00
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-01
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-02
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-03
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-04
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-05
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-06
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-07
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-08
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-09
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-10
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-12
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-13
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-14
FORMULA_NAME TokenRing-PT-020-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717010975820

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:29:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:29:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:29:39] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2024-05-29 19:29:40] [INFO ] Transformed 441 places.
[2024-05-29 19:29:40] [INFO ] Transformed 8421 transitions.
[2024-05-29 19:29:40] [INFO ] Found NUPN structural information;
[2024-05-29 19:29:40] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 920 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 1171 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3701 ms. (10 steps per ms) remains 7/12 properties
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 797 ms. (50 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 665 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 563 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 708 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1009 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 657 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 545 ms. (73 steps per ms) remains 7/7 properties
// Phase 1: matrix 8421 rows 441 cols
[2024-05-29 19:29:45] [INFO ] Computed 21 invariants in 80 ms
[2024-05-29 19:29:46] [INFO ] State equation strengthened by 8020 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 355/441 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 355/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8421/8862 variables, 441/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8862/8862 variables, and 8923 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5083 ms.
Refiners :[Domain max(s): 441/441 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 441/441 constraints, ReadFeed: 8020/8020 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 355/441 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 355/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8421/8862 variables, 441/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8862/8862 variables, and 8923 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5011 ms.
Refiners :[Domain max(s): 441/441 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 441/441 constraints, ReadFeed: 8020/8020 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 10950ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 556 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 441/441 places, 8421/8421 transitions.
RANDOM walk for 40000 steps (8 resets) in 1165 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 439 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 528 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 430 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 431 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 37975 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 7
Probabilistic random walk after 37975 steps, saw 9191 distinct states, run finished after 3009 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-29 19:30:01] [INFO ] Invariant cache hit.
[2024-05-29 19:30:01] [INFO ] State equation strengthened by 8020 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 355/441 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 355/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8421/8862 variables, 441/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8862 variables, 8020/8923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8862 variables, 0/8923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/8862 variables, 0/8923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8862/8862 variables, and 8923 constraints, problems are : Problem set: 0 solved, 7 unsolved in 15318 ms.
Refiners :[Domain max(s): 441/441 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 441/441 constraints, ReadFeed: 8020/8020 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 355/441 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 355/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8421/8862 variables, 441/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8862 variables, 8020/8923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8862 variables, 6/8929 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8862 variables, 0/8929 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/8862 variables, 0/8929 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8862/8862 variables, and 8929 constraints, problems are : Problem set: 0 solved, 7 unsolved in 31128 ms.
Refiners :[Domain max(s): 441/441 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 441/441 constraints, ReadFeed: 8020/8020 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 46729ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 26292 ms.
Support contains 86 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 743 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 267 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2024-05-29 19:31:15] [INFO ] Invariant cache hit.
[2024-05-29 19:31:16] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-29 19:31:16] [INFO ] Invariant cache hit.
[2024-05-29 19:31:18] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2024-05-29 19:31:49] [INFO ] Implicit Places using invariants and state equation in 32334 ms returned []
Implicit Place search using SMT with State Equation took 33541 ms to find 0 implicit places.
[2024-05-29 19:31:50] [INFO ] Redundant transitions in 1578 ms returned []
Running 8401 sub problems to find dead transitions.
[2024-05-29 19:31:50] [INFO ] Invariant cache hit.
[2024-05-29 19:31:51] [INFO ] State equation strengthened by 8020 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 8401 unsolved
SMT process timed out in 50504ms, After SMT, problems are : Problem set: 0 solved, 8401 unsolved
Search for dead transitions found 0 dead transitions in 50614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86085 ms. Remains : 441/441 places, 8421/8421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5385 edges and 441 vertex of which 336 / 441 are part of one of the 20 SCC in 20 ms
Free SCC test removed 316 places
Drop transitions (Empty/Sink Transition effects.) removed 5368 transitions
Ensure Unique test removed 2536 transitions
Reduce isomorphic transitions removed 7904 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 125 transition count 503
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 111 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 109 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 109 transition count 500
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 108 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 360 transitions
Redundant transition composition rules discarded 360 transitions
Iterating global reduction 3 with 360 rules applied. Total rules applied 395 place count 108 transition count 140
Applied a total of 395 rules in 181 ms. Remains 108 /441 variables (removed 333) and now considering 140/8421 (removed 8281) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 140 rows 108 cols
[2024-05-29 19:32:41] [INFO ] Computed 21 invariants in 1 ms
[2024-05-29 19:32:41] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 19:32:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-29 19:32:42] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-29 19:32:42] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-29 19:32:42] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1143 ms.
[2024-05-29 19:32:42] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-29 19:32:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 81 ms.
[2024-05-29 19:32:43] [INFO ] Flatten gal took : 685 ms
Total runtime 184620 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running TokenRing-PT-020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 441
TRANSITIONS: 8421
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.329s, Sys 0.020s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.054s, Sys 0.007s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 595
MODEL NAME: /home/mcc/execution/418/model
441 places, 8421 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717012625164

--------------------
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="TokenRing-PT-020"
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 TokenRing-PT-020, 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 r421-smll-171690572800183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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