Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200275.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 itstools
Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 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 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 1.7M 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-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716330358176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 22:26:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:26:01] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-05-21 22:26:01] [INFO ] Transformed 188 places.
[2024-05-21 22:26:01] [INFO ] Transformed 2108 transitions.
[2024-05-21 22:26:01] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 55 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:26:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 22:26:02] [INFO ] Computed 7 invariants in 40 ms
[2024-05-21 22:26:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:26:33] [INFO ] Deduced a trap composed of 5 places in 669 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20178 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 54509ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 54567ms
[2024-05-21 22:26:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:56] [INFO ] Invariant cache hit.
[2024-05-21 22:26:57] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-21 22:26:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:57] [INFO ] Invariant cache hit.
[2024-05-21 22:26:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:26:57] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:26:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:57] [INFO ] Invariant cache hit.
[2024-05-21 22:26:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:27:27] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:28:05] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1643 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 7 constraints, problems are : Problem set: 46 solved, 2059 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 76755ms problems are : Problem set: 46 solved, 2059 unsolved
Search for dead transitions found 46 dead transitions in 76794ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/188 places, 2062/2108 transitions.
Applied a total of 0 rules in 88 ms. Remains 188 /188 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132831 ms. Remains : 188/188 places, 2062/2108 transitions.
Support contains 21 out of 188 places after structural reductions.
[2024-05-21 22:28:15] [INFO ] Flatten gal took : 298 ms
[2024-05-21 22:28:15] [INFO ] Flatten gal took : 159 ms
[2024-05-21 22:28:16] [INFO ] Input system was already deterministic with 2062 transitions.
RANDOM walk for 40002 steps (56 resets) in 3792 ms. (10 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40003 steps (20 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (16 resets) in 282 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (20 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40005 steps (20 resets) in 303 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (20 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (20 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
[2024-05-21 22:28:17] [INFO ] Flow matrix only has 370 transitions (discarded 1692 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 22:28:17] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 22:28:17] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/185 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/188 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 4 solved, 2 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 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/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/90 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/414 variables, 90/94 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 131/545 variables, 85/179 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/180 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/204 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/547 variables, 1/205 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 2/207 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 11/558 variables, 11/218 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 1/219 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/558 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 219 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 700 ms.
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2062/2062 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2061
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2061
Applied a total of 3 rules in 409 ms. Remains 185 /188 variables (removed 3) and now considering 2061/2062 (removed 1) transitions.
Running 2058 sub problems to find dead transitions.
[2024-05-21 22:28:21] [INFO ] Flow matrix only has 369 transitions (discarded 1692 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 22:28:21] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 22:28:21] [INFO ] State equation strengthened by 22 read => feed constraints.

BK_STOP 1716330516910

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V80P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399200275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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