Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610900214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610900214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.6K Apr 13 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 07:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 07:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 13 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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 LamportFastMutEx-COL-3-ReachabilityCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716523254047

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 04:00:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 04:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:00:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 04:00:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 04:00:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-05-24 04:00:55] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 04:00:55] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 04:00:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 1420 ms. (28 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 567 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 647 ms. (61 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 04:00:57] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 04:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-01 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-00 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-02 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-04 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-05 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-06 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-07 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-08 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-11 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-12 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-13 is UNSAT
Problem LamportFastMutEx-COL-3-ReachabilityCardinality-2024-15 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 12 solved, 0 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-24 04:00:57] [INFO ] Flatten gal took : 15 ms
[2024-05-24 04:00:57] [INFO ] Flatten gal took : 3 ms
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 )
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-00 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Domain [pid(4), pid(4)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 04:00:57] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 19 ms.
[2024-05-24 04:00:57] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
RANDOM walk for 40000 steps (8 resets) in 512 ms. (77 steps per ms) remains 1/2 properties
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
[2024-05-24 04:00:58] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 04:00:58] [INFO ] Computed 17 invariants in 7 ms
[2024-05-24 04:00:58] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 96/153 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/153 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:00:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 6 ms to minimize.
[2024-05-24 04:00:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/167 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 24 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 65/71 places, 108/114 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15512 states, properties seen :0
Probabilistic random walk after 61100 steps, saw 15512 distinct states, run finished after 121 ms. (steps per millisecond=504 ) properties seen :0
Explored full state space saw : 15512 states, properties seen :0
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 72 ms. (steps per millisecond=848 ) properties seen :0
FORMULA LamportFastMutEx-COL-3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 3550 ms.
ITS solved all properties within timeout

BK_STOP 1716523258793

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="LamportFastMutEx-COL-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-COL-3, 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 r223-tall-171649610900214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;