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

About the Execution of GreatSPN+red for BART-COL-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.172 14186.00 33991.00 284.70 FFFFTFFFTTFTFFFT 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.r025-smll-171620166500401.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 BART-COL-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.8K Apr 12 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 23:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 02:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 13 02:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 00:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 195K 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 BART-COL-020-CTLCardinality-2024-00
FORMULA_NAME BART-COL-020-CTLCardinality-2024-01
FORMULA_NAME BART-COL-020-CTLCardinality-2024-02
FORMULA_NAME BART-COL-020-CTLCardinality-2024-03
FORMULA_NAME BART-COL-020-CTLCardinality-2024-04
FORMULA_NAME BART-COL-020-CTLCardinality-2024-05
FORMULA_NAME BART-COL-020-CTLCardinality-2024-06
FORMULA_NAME BART-COL-020-CTLCardinality-2024-07
FORMULA_NAME BART-COL-020-CTLCardinality-2024-08
FORMULA_NAME BART-COL-020-CTLCardinality-2024-09
FORMULA_NAME BART-COL-020-CTLCardinality-2024-10
FORMULA_NAME BART-COL-020-CTLCardinality-2024-11
FORMULA_NAME BART-COL-020-CTLCardinality-2024-12
FORMULA_NAME BART-COL-020-CTLCardinality-2024-13
FORMULA_NAME BART-COL-020-CTLCardinality-2024-14
FORMULA_NAME BART-COL-020-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716368197903

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:56:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 08:56:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:56:40] [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-22 08:56:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 08:56:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1644 ms
[2024-05-22 08:56:42] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-05-22 08:56:42] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 15293 PT places and 2.814459024E10 transition bindings in 117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
[2024-05-22 08:56:42] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 8 ms.
[2024-05-22 08:56:42] [INFO ] Skeletonized 16 HLPN properties in 12 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA BART-COL-020-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
RANDOM walk for 40036 steps (1816 resets) in 762 ms. (52 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 401 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 323 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 255 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 77 ms. (513 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 86 ms. (460 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40036 steps (1816 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
// Phase 1: matrix 2 rows 1 cols
[2024-05-22 08:56:43] [INFO ] Computed 0 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 2/3 variables, and 1 constraints, problems are : Problem set: 12 solved, 0 unsolved in 275 ms.
Refiners :[State Equation: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 10 simplifications.
FORMULA BART-COL-020-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 08:56:44] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-22 08:56:44] [INFO ] Flatten gal took : 17 ms
[2024-05-22 08:56:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BART-COL-020-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 08:56:44] [INFO ] Flatten gal took : 1 ms
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 20
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2024-05-22 08:56:45] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1416 ms.
[2024-05-22 08:56:45] [INFO ] Unfolded 3 HLPN properties in 2 ms.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
Support contains 0 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 59 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2024-05-22 08:56:45] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 08:56:45] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 08:56:45] [INFO ] Invariant cache hit.
[2024-05-22 08:56:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-22 08:56:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 50 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 133 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 4269ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4276ms
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4676 ms. Remains : 49/132 places, 119/202 transitions.
Support contains 0 out of 49 places after structural reductions.
[2024-05-22 08:56:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 28 ms
FORMULA BART-COL-020-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 22 ms
[2024-05-22 08:56:50] [INFO ] Input system was already deterministic with 119 transitions.
RANDOM walk for 0 steps (0 resets) in 5 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 )
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 17 ms
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 08:56:50] [INFO ] Input system was already deterministic with 119 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/49 places, 119/119 transitions.
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:56:50] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/49 places, 119/119 transitions.
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:56:50] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:56:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:56:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-22 08:56:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 119 transitions and 238 arcs took 8 ms.
Total runtime 10276 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BART-COL-020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 49
TRANSITIONS: 119
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
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: 547
MODEL NAME: /home/mcc/execution/414/model
49 places, 119 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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BART-COL-020-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BART-COL-020-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716368212089

--------------------
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 CTLCardinality -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="BART-COL-020"
export BK_EXAMINATION="CTLCardinality"
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 BART-COL-020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166500401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-020.tgz
mv BART-COL-020 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;