Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901200270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CircularTrains-PT-768, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901200270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 14:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 5 14:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 14:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 5 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 14:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 591K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-00
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-01
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-02
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-03
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-04
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-05
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-06
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-07
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-08
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-09
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-10
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-11
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-12
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-13
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-14
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779601035957

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 05:37:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 05:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:37:18] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2026-05-24 05:37:18] [INFO ] Transformed 1536 places.
[2026-05-24 05:37:18] [INFO ] Transformed 768 transitions.
[2026-05-24 05:37:18] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 05:37:19] [INFO ] Flatten gal took : 285 ms
[2026-05-24 05:37:19] [INFO ] Flatten gal took : 245 ms
[2026-05-24 05:37:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13173190465645175904.gal : 132 ms
[2026-05-24 05:37:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11712692378065019748.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13173190465645175904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11712692378065019748.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11712692378065019748.prop.
RANDOM walk for 40000 steps (8 resets) in 6521 ms. (6 steps per ms) remains 3/16 properties
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1221 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1035 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1574 ms. (25 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3770286423494044795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17900828131371444983.kers'
[2026-05-24 05:37:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3770286423494044795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17900828131371444983.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 768 rows 1536 cols 3072 entries
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 6
Finished phase 1 with 0 SingleSign rule and 767 generalized
[2026-05-24 05:37:21] [INFO ] Computed 769 invariants in 36 ms
Computed 769 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-17900828131371444983.kers
Total runtime 38 ms.
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 36
Invariant property CircularTrains-PT-768-ReachabilityCardinality-2024-00 does not hold.
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :36 after 534
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :534 after 2209
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :2209 after 18570
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :18570 after 751236
Reachability property CircularTrains-PT-768-ReachabilityCardinality-2024-14 is true.
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :751236 after 3.04036e+08
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3.04036e+08 after 2.93231e+10
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :2.93231e+10 after 6.44308e+13
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :6.44308e+13 after 3.41274e+18
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 123/208 variables, 66/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/276 variables, 35/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/304 variables, 14/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/320 variables, 8/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/324 variables, 2/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/328 variables, 2/127 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/127 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 588/916 variables, 144/271 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 383/1299 variables, 280/551 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1299 variables, 0/551 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 17/1316 variables, 9/560 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 220/1536 variables, 209/769 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1536 variables, 0/769 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 768/2304 variables, 1536/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2304/2304 variables, and 2305 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 416/416 constraints, Generalized P Invariants (flows): 353/353 constraints, State Equation: 1536/1536 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/146 variables, 46/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/197 variables, 26/72 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/219 variables, 11/83 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/229 variables, 5/88 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/231 variables, 1/89 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/233 variables, 1/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 576/809 variables, 110/200 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 446/1255 variables, 313/513 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1255 variables, 0/513 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 23/1278 variables, 13/526 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1278 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 258/1536 variables, 243/769 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1536 variables, 0/769 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 768/2304 variables, 1536/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2304/2304 variables, and 2305 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2060 ms.
Refiners :[Positive P Invariants (semi-flows): 416/416 constraints, Generalized P Invariants (flows): 353/353 constraints, State Equation: 1536/1536 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4500ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 993 steps, including 0 resets, run visited all 1 properties in 54 ms. (steps per millisecond=18 )
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 67 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 8161 ms.

BK_STOP 1779601045954

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="CircularTrains-PT-768"
export BK_EXAMINATION="ReachabilityCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-768, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901200270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-768.tgz
mv CircularTrains-PT-768 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;