About the Execution of 2024-gold for PermAdmissibility-PT-50
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PermAdmissibility-PT-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 340K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-00
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-01
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-02
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-03
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-04
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-05
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-06
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-07
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-08
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-09
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-10
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-11
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-12
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-13
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-14
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748841526149
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:47] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-02 05:18:47] [INFO ] Transformed 168 places.
[2025-06-02 05:18:47] [INFO ] Transformed 592 transitions.
[2025-06-02 05:18:47] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 100, 0, 0, 0, 0, 0, 0, 50, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 100, 0, 0, 0, 0, 0, 0, 50, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 592 rows 168 cols
[2025-06-02 05:18:47] [INFO ] Computed 32 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 100, 0, 0, 0, 0, 0, 0, 50, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10013 steps (12 resets) in 16 ms. (589 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 268 ms. (594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50, 100, 100, 50, 50, 50, 100, 50, 50, 50, 50, 50, 50, 3, 50, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 05:18:47] [INFO ] Invariant cache hit.
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 8 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 7 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 8 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 6 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 8 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 12 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 69 ms returned sat
[2025-06-02 05:18:48] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-02 05:18:49] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 560 transitions) in 92 ms.
[2025-06-02 05:18:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:49] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 10 ms returned sat
[2025-06-02 05:18:49] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-02 05:18:49] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 560 transitions) in 63 ms.
[2025-06-02 05:18:49] [INFO ] Added : 19 causal constraints over 6 iterations in 294 ms. Result :sat
Minimization took 559 ms.
[2025-06-02 05:18:50] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 13 ms returned unsat
[2025-06-02 05:18:50] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[50, 100, 100, 50, 50, 50, 100, 50, 50, 50, 50, 50, 50, 3, 50, 50] Max Struct:[50, 100, 100, 50, 50, 50, 100, 50, 50, 50, 50, 50, 50, +inf, 50, 50]
FORMULA PermAdmissibility-PT-50-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 105 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.4 ms
Discarding 63 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 105 transition count 536
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 83 place count 79 transition count 343
Iterating global reduction 1 with 26 rules applied. Total rules applied 109 place count 79 transition count 343
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 133 place count 55 transition count 107
Iterating global reduction 1 with 24 rules applied. Total rules applied 157 place count 55 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 159 place count 53 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 161 place count 53 transition count 91
Free-agglomeration rule (complex) applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 53 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 167 place count 50 transition count 90
Applied a total of 167 rules in 59 ms. Remains 50 /168 variables (removed 118) and now considering 90/592 (removed 502) transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 90 rows 50 cols
[2025-06-02 05:18:50] [INFO ] Computed 17 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 90/140 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 67 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1161 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 90/140 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 86/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3193 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 4454ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 4471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4544 ms. Remains : 50/168 places, 90/592 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 05:18:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000041 steps (1606 resets) in 485 ms. (2057 steps per ms)
BEST_FIRST walk for 1000001 steps (59 resets) in 928 ms. (1076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[+inf]
[2025-06-02 05:18:56] [INFO ] Invariant cache hit.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[50]
FORMULA PermAdmissibility-PT-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-06-02 05:18:56] [INFO ] Flatten gal took : 58 ms
[2025-06-02 05:18:56] [INFO ] Flatten gal took : 18 ms
[2025-06-02 05:18:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1872014354646330387.gal : 9 ms
[2025-06-02 05:18:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13890687376879299470.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1872014354646330387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13890687376879299470.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9445 ms.
BK_STOP 1748841536832
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="PermAdmissibility-PT-50"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PermAdmissibility-PT-50, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-174876824800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;