About the Execution of GreatSPN+red for Sudoku-PT-AN02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
316.359 | 3871.00 | 9845.00 | 117.60 | TTTTTFTTTTTFTFFT | normal |
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.r399-tall-171690530600577.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 Sudoku-PT-AN02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530600577
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 9.9K Apr 12 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 10:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.4K May 18 16:43 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 Sudoku-PT-AN02-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717056431099
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 08:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 08:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:07:12] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-05-30 08:07:12] [INFO ] Transformed 20 places.
[2024-05-30 08:07:12] [INFO ] Transformed 8 transitions.
[2024-05-30 08:07:12] [INFO ] Found NUPN structural information;
[2024-05-30 08:07:12] [INFO ] Parsed PT model containing 20 places and 8 transitions and 32 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-05-30 08:07:12] [INFO ] Computed 12 invariants in 4 ms
[2024-05-30 08:07:12] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-30 08:07:12] [INFO ] Invariant cache hit.
[2024-05-30 08:07:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2024-05-30 08:07:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 08:07:12] [INFO ] Flatten gal took : 16 ms
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 08:07:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 08:07:12] [INFO ] Input system was already deterministic with 8 transitions.
RANDOM walk for 40000 steps (8914 resets) in 1667 ms. (23 steps per ms) remains 11/32 properties
BEST_FIRST walk for 40004 steps (2214 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2229 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2223 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (2219 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2223 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (2220 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2216 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2220 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (2215 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2225 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2225 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
[2024-05-30 08:07:14] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 20/28 variables, and 32 constraints, problems are : Problem set: 11 solved, 0 unsolved in 66 ms.
Refiners :[Domain max(s): 20/20 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 08:07:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 3 ms
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Support contains 19 out of 20 places (down from 20) after GAL structural reductions.
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 6 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 12/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 18 /20 variables (removed 2) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 18/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 8
Applied a total of 4 rules in 0 ms. Remains 16 /20 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 17 transition count 8
Applied a total of 3 rules in 0 ms. Remains 17 /20 variables (removed 3) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 8
Applied a total of 4 rules in 0 ms. Remains 16 /20 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 13/20 places, 8/8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:07:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:07:14] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-30 08:07:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 8 transitions and 32 arcs took 1 ms.
Total runtime 2072 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-PT-AN02
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 20
TRANSITIONS: 8
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 527
MODEL NAME: /home/mcc/execution/411/model
20 places, 8 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-PT-AN02-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717056434970
--------------------
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 CTLCardinality -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="Sudoku-PT-AN02"
export BK_EXAMINATION="CTLCardinality"
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 Sudoku-PT-AN02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530600577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;