fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397900284
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V80P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16053.012 3600000.00 13374026.00 343.90 T?T??F?TFFFT???? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397900284.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V80P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 27K Apr 13 02:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 02:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 698K Apr 13 02:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:30 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 15K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 206K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 604K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 13 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 13 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.7M Apr 13 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 BridgeAndVehicles-PT-V80P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716290490509

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:21:32] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2024-05-21 11:21:32] [INFO ] Transformed 198 places.
[2024-05-21 11:21:32] [INFO ] Transformed 3728 transitions.
[2024-05-21 11:21:32] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 120 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3728
Applied a total of 2 rules in 78 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 11:21:33] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 11:21:33] [INFO ] Computed 5 invariants in 21 ms
[2024-05-21 11:21:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 11:22:48] [INFO ] Deduced a trap composed of 5 places in 616 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 86512ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 86595ms
[2024-05-21 11:22:59] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 11:22:59] [INFO ] Invariant cache hit.
[2024-05-21 11:22:59] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 11:22:59] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 11:22:59] [INFO ] Invariant cache hit.
[2024-05-21 11:23:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:23:00] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 3725 sub problems to find dead transitions.
[2024-05-21 11:23:00] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 11:23:00] [INFO ] Invariant cache hit.
[2024-05-21 11:23:00] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 11:24:08] [INFO ] Deduced a trap composed of 5 places in 474 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 109567ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 109633ms
Starting structural reductions in LTL mode, iteration 1 : 196/198 places, 3728/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197301 ms. Remains : 196/198 places, 3728/3728 transitions.
Support contains 120 out of 196 places after structural reductions.
[2024-05-21 11:24:51] [INFO ] Flatten gal took : 552 ms
[2024-05-21 11:24:52] [INFO ] Flatten gal took : 276 ms
[2024-05-21 11:24:53] [INFO ] Input system was already deterministic with 3728 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (56 resets) in 7472 ms. (5 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40003 steps (24 resets) in 681 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (24 resets) in 4342 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (24 resets) in 442 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 358 ms. (111 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 407 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (20 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (24 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
[2024-05-21 11:24:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 11:24:57] [INFO ] Invariant cache hit.
[2024-05-21 11:24:57] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (OVERLAPS) 79/193 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 410/603 variables, 193/198 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 42/240 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/240 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/606 variables, 3/243 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 0/243 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/606 variables, 0/243 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 243 constraints, problems are : Problem set: 4 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 196/196 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 183/189 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 408/597 variables, 189/193 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 42/235 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/235 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/606 variables, 7/242 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 1/243 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 2/245 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/245 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/245 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 245 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 196/196 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2966ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 388 ms.
Support contains 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 191 transition count 3724
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P20N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 198
TRANSITIONS: 3728
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.133s, Sys 0.009s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.016s, 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: 600
MODEL NAME: /home/mcc/execution/model
198 places, 3728 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 BridgeAndVehicles-PT-V80P20N20-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-PT-V80P20N20"
export BK_EXAMINATION="LTLFireability"
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 BridgeAndVehicles-PT-V80P20N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397900284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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