fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r487-tall-167912702600098
Last Updated
May 14, 2023

About the Execution of LoLa+red for Sudoku-COL-AN13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 277233.00 0.00 0.00 ??T??T?T?????F?? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702600098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-AN13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702600098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 09:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-COL-AN13-CTLFireability-00
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-01
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-02
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-03
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-04
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-05
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-06
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-07
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-08
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-09
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-10
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-11
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-12
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-13
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-14
FORMULA_NAME Sudoku-COL-AN13-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679165173132

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 18:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:46:14] [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.
[2023-03-18 18:46:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 18:46:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2023-03-18 18:46:15] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2023-03-18 18:46:15] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 18:46:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 11 formulas.
FORMULA Sudoku-COL-AN13-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2023-03-18 18:46:15] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 40 ms.
[2023-03-18 18:46:15] [INFO ] Unfolded 12 HLPN properties in 20 ms.
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 55 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 18:46:29] [INFO ] Computed 38 place invariants in 119 ms
[2023-03-18 18:46:29] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-18 18:46:29] [INFO ] Invariant cache hit.
[2023-03-18 18:46:30] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2023-03-18 18:46:30] [INFO ] Invariant cache hit.
[2023-03-18 18:46:30] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1752 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2023-03-18 18:46:33] [INFO ] Flatten gal took : 1010 ms
[2023-03-18 18:46:43] [INFO ] Flatten gal took : 1272 ms
[2023-03-18 18:46:53] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1414 ms. (steps per millisecond=7 ) properties (out of 8) seen :7
Interrupted Best-First random walk after 5361 steps, including 1 resets, run timeout after 5873 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-18 18:47:01] [INFO ] Invariant cache hit.
[2023-03-18 18:47:07] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-18 18:47:15] [INFO ] Flatten gal took : 878 ms
[2023-03-18 18:47:25] [INFO ] Flatten gal took : 1221 ms
[2023-03-18 18:47:35] [INFO ] Input system was already deterministic with 2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:41] [INFO ] Flatten gal took : 154 ms
[2023-03-18 18:47:41] [INFO ] Flatten gal took : 226 ms
[2023-03-18 18:47:42] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:42] [INFO ] Flatten gal took : 118 ms
[2023-03-18 18:47:42] [INFO ] Flatten gal took : 169 ms
[2023-03-18 18:47:43] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:43] [INFO ] Flatten gal took : 90 ms
[2023-03-18 18:47:43] [INFO ] Flatten gal took : 116 ms
[2023-03-18 18:47:43] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:44] [INFO ] Flatten gal took : 230 ms
[2023-03-18 18:47:45] [INFO ] Flatten gal took : 365 ms
[2023-03-18 18:47:46] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:46] [INFO ] Flatten gal took : 91 ms
[2023-03-18 18:47:46] [INFO ] Flatten gal took : 122 ms
[2023-03-18 18:47:46] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:47] [INFO ] Flatten gal took : 116 ms
[2023-03-18 18:47:48] [INFO ] Flatten gal took : 165 ms
[2023-03-18 18:47:48] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:48] [INFO ] Flatten gal took : 118 ms
[2023-03-18 18:47:48] [INFO ] Flatten gal took : 169 ms
[2023-03-18 18:47:49] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:49] [INFO ] Flatten gal took : 108 ms
[2023-03-18 18:47:49] [INFO ] Flatten gal took : 147 ms
[2023-03-18 18:47:50] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:50] [INFO ] Flatten gal took : 134 ms
[2023-03-18 18:47:50] [INFO ] Flatten gal took : 193 ms
[2023-03-18 18:47:51] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:51] [INFO ] Flatten gal took : 65 ms
[2023-03-18 18:47:51] [INFO ] Flatten gal took : 80 ms
[2023-03-18 18:47:51] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 18 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:51] [INFO ] Flatten gal took : 92 ms
[2023-03-18 18:47:51] [INFO ] Flatten gal took : 128 ms
[2023-03-18 18:47:52] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 12 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 507/507 places, 2197/2197 transitions.
[2023-03-18 18:47:53] [INFO ] Flatten gal took : 114 ms
[2023-03-18 18:47:53] [INFO ] Flatten gal took : 161 ms
[2023-03-18 18:47:53] [INFO ] Input system was already deterministic with 2197 transitions.
[2023-03-18 18:47:56] [INFO ] Flatten gal took : 1349 ms
[2023-03-18 18:48:06] [INFO ] Flatten gal took : 1171 ms
[2023-03-18 18:48:15] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 356 ms.
[2023-03-18 18:48:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 2197 transitions and 6591 arcs took 8 ms.
Total runtime 121202 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN13
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
CTLFireability

BK_STOP 1679165450365

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/CTLFireability.xml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 486 Killed lola --conf=$BIN_DIR/configfiles/ctlfireabilityconf --formula=$DIR/CTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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-COL-AN13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-COL-AN13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702600098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;