Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366400501.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 5 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 16:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 5 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:13 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 91K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779491659542

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 23:14:20] [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]
[2026-05-22 23:14:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:14:21] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-22 23:14:21] [INFO ] Transformed 390 places.
[2026-05-22 23:14:21] [INFO ] Transformed 388 transitions.
[2026-05-22 23:14:21] [INFO ] Found NUPN structural information;
[2026-05-22 23:14:21] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16147746513782519291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9364582521384157339.kers'
[2026-05-22 23:14:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16147746513782519291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9364582521384157339.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 390 cols 906 entries
Finished phase 1 with 356 SingleSign rule and 6 generalized
[2026-05-22 23:14:21] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9364582521384157339.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (49 resets) in 64 ms. (153 steps per ms)
FORMULA AutoFlight-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (15 resets) in 39 ms. (750 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 23:14:21] [INFO ] Invariant cache hit.
[2026-05-22 23:14:21] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2026-05-22 23:14:21] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:21] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2026-05-22 23:14:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:14:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 23:14:22] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:22] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2026-05-22 23:14:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2026-05-22 23:14:22] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 23 ms.
[2026-05-22 23:14:26] [INFO ] Added : 387 causal constraints over 78 iterations in 3952 ms. Result :sat
Minimization took 155 ms.
[2026-05-22 23:14:26] [INFO ] [Real]Absence check using 27 positive place invariants in 17 ms returned sat
[2026-05-22 23:14:26] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:27] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-22 23:14:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:14:27] [INFO ] [Nat]Absence check using 27 positive place invariants in 35 ms returned sat
[2026-05-22 23:14:27] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:27] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-22 23:14:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2026-05-22 23:14:27] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 27 ms.
[2026-05-22 23:14:31] [INFO ] Added : 379 causal constraints over 76 iterations in 3688 ms. Result :sat
Minimization took 201 ms.
[2026-05-22 23:14:32] [INFO ] [Real]Absence check using 27 positive place invariants in 19 ms returned sat
[2026-05-22 23:14:32] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:32] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2026-05-22 23:14:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:14:32] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2026-05-22 23:14:32] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-22 23:14:32] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-22 23:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2026-05-22 23:14:32] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 26 ms.
[2026-05-22 23:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 609 ms
[2026-05-22 23:14:37] [INFO ] Added : 385 causal constraints over 78 iterations in 4194 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 390 transition count 238
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 178 rules applied. Total rules applied 328 place count 240 transition count 210
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 337 place count 232 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 231 transition count 209
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 338 place count 231 transition count 157
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 442 place count 179 transition count 157
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 479 place count 142 transition count 120
Iterating global reduction 4 with 37 rules applied. Total rules applied 516 place count 142 transition count 120
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 516 place count 142 transition count 108
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 540 place count 130 transition count 108
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 602 place count 99 transition count 77
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 618 place count 99 transition count 61
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 634 place count 83 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 635 place count 82 transition count 60
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 5 with 35 rules applied. Total rules applied 670 place count 67 transition count 40
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 690 place count 47 transition count 40
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 690 place count 47 transition count 28
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 714 place count 35 transition count 28
Applied a total of 714 rules in 121 ms. Remains 35 /390 variables (removed 355) and now considering 28/388 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 35/390 places, 28/388 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2682503994985832973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14656198773755302981.kers'
[2026-05-22 23:14:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2682503994985832973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14656198773755302981.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 28 rows 30 cols 74 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 23:14:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14656198773755302981.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 962 ms. (1038 steps per ms)
FORMULA AutoFlight-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 18179 ms.

BK_STOP 1779491679218

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="AutoFlight-PT-04b"
export BK_EXAMINATION="UpperBounds"
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 AutoFlight-PT-04b, 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 r002-oct2-177944366400501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;