Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546500297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-BN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.6K May 14 04:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 04:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 22:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 10:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 5 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 146K May 12 20: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 Sudoku-COL-BN09-00
FORMULA_NAME Sudoku-COL-BN09-01
FORMULA_NAME Sudoku-COL-BN09-02
FORMULA_NAME Sudoku-COL-BN09-03
FORMULA_NAME Sudoku-COL-BN09-04
FORMULA_NAME Sudoku-COL-BN09-05
FORMULA_NAME Sudoku-COL-BN09-06
FORMULA_NAME Sudoku-COL-BN09-07
FORMULA_NAME Sudoku-COL-BN09-08
FORMULA_NAME Sudoku-COL-BN09-09
FORMULA_NAME Sudoku-COL-BN09-10
FORMULA_NAME Sudoku-COL-BN09-11
FORMULA_NAME Sudoku-COL-BN09-12
FORMULA_NAME Sudoku-COL-BN09-13
FORMULA_NAME Sudoku-COL-BN09-14
FORMULA_NAME Sudoku-COL-BN09-15

=== Now, execution of the tool begins

BK_START 1590484552294

[2020-05-26 09:15:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:15:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-26 09:15:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2020-05-26 09:15:54] [INFO ] sort/places :
N2->Rows,Regions,Cells,Columns,
N3->Board,

[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [WARNING] Unknown arithmetic term or operator :fr.lip6.move.pnml.symmetricnet.finiteIntRanges.impl.FiniteIntRangeConstantImpl
[2020-05-26 09:15:54] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 768 PT places and 4096.0 transition bindings in 70 ms.
[2020-05-26 09:15:54] [INFO ] Computed order based on color domains.
[2020-05-26 09:15:54] [INFO ] Unfolded HLPN to a Petri net with 768 places and 8 transitions in 6 ms.
[2020-05-26 09:15:54] [INFO ] Unfolded HLPN properties in 3 ms.
Deduced a syphon composed of 763 places in 0 ms
Reduce places removed 763 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 88 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 222 ms. (steps per millisecond=450 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0]
// Phase 1: matrix 1 rows 5 cols
[2020-05-26 09:15:54] [INFO ] Computed 4 place invariants in 2 ms
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-26 09:15:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 20 atomic propositions for a total of 33 simplifications.
[2020-05-26 09:15:55] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-05-26 09:15:55] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-BN09-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:15:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-26 09:15:55] [INFO ] Flatten gal took : 1 ms
[2020-05-26 09:15:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-BN09-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-26 09:15:55] [INFO ] Applying decomposition
[2020-05-26 09:15:55] [INFO ] Flatten gal took : 2 ms
Built C files in :
/home/mcc/execution
[2020-05-26 09:15:55] [INFO ] Input system was already deterministic with 1 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1 rows 5 cols
[2020-05-26 09:15:55] [INFO ] Computed 4 place invariants in 0 ms
inv : Board_0 + Regions_0 = 1
inv : Rows_0 + Board_0 = 1
inv : Board_0 + Columns_0 = 1
inv : Board_0 + Cells_0 = 1
Total of 4 invariants.
[2020-05-26 09:15:55] [INFO ] Computed 4 place invariants in 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17950239764716559687.txt, -o, /tmp/graph17950239764716559687.bin, -w, /tmp/graph17950239764716559687.weights], workingDir=null]
[2020-05-26 09:15:55] [INFO ] Proved 5 variables to be positive in 35 ms
[2020-05-26 09:15:55] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2020-05-26 09:15:55] [INFO ] Computation of disable matrix completed :0/1 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:15:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:15:55] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2020-05-26 09:15:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17950239764716559687.bin, -l, -1, -v, -w, /tmp/graph17950239764716559687.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:15:55] [INFO ] Decomposing Gal with order
[2020-05-26 09:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:15:55] [INFO ] Flatten gal took : 1 ms
[2020-05-26 09:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-26 09:15:55] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 0 ms
[2020-05-26 09:15:55] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((F(!(X(X((F("(gu0.Board_0<=gu0.Rows_0)"))&&("((gu0.Board_0>gu0.Rows_0)||(gu0.Board_0>gu0.Columns_0))")))))))
Formula 0 simplified : !F!XX("((gu0.Board_0>gu0.Rows_0)||(gu0.Board_0>gu0.Columns_0))" & F"(gu0.Board_0<=gu0.Rows_0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.014826,16456,1,0,6,33,30,3,90,15,17
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-BN09-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X("(gu0.Board_0<=gu0.Cells_0)"))))
Formula 1 simplified : !FX"(gu0.Board_0<=gu0.Cells_0)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.015422,16456,1,0,6,33,39,3,93,15,23
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Sudoku-COL-BN09-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X("(gu0.Regions_0>=1)"))))
Formula 2 simplified : !GX"(gu0.Regions_0>=1)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.016005,16740,1,0,6,33,51,3,95,15,33
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-COL-BN09-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:15:55] [WARNING] Script execution failed on command (assert (and (and (and (and (>= (select s0 0) 1) (>= (select s0 2) 1)) (>= (select s0 3) 1)) (>= (select s0 4) 1)) (= (store (store (store (store (store s0 0 (- (select s0 0) 1)) 3 (- (select s0 3) 1)) 2 (- (select s0 2) 1)) 4 (- (select s0 4) 1)) 1 (+ (select s0 1) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-26 09:15:55] [INFO ] Built C files in 168ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590484555752

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-BN09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-BN09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-oct2-159033546500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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