Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100404.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m008-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716297679933

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:21:22] [INFO ] Load time of PNML (sax parser for PT used): 910 ms
[2024-05-21 13:21:22] [INFO ] Transformed 754 places.
[2024-05-21 13:21:22] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:21:22] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1096 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 474 places in 119 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 89 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 13:21:22] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 13:21:22] [INFO ] Computed 8 invariants in 53 ms
[2024-05-21 13:21:23] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-21 13:21:23] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:21:23] [INFO ] Invariant cache hit.
[2024-05-21 13:21:24] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 13:21:25] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 3116 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 13:21:26] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:21:26] [INFO ] Invariant cache hit.
[2024-05-21 13:21:26] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 13:22:30] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 26 ms to minimize.
[2024-05-21 13:22:30] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2024-05-21 13:22:30] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-21 13:22:39] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-05-21 13:23:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 13:23:11] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-05-21 13:23:11] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-05-21 13:23:11] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 8/8 constraints]
After SMT, in 106093ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 106193ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 18 places and 565 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 259 transition count 3238
Reduce places removed 9 places and 278 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 27 place count 250 transition count 2960
Reduce places removed 12 places and 336 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 39 place count 238 transition count 2624
Reduce places removed 8 places and 184 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 47 place count 230 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 229 transition count 2420
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 229 transition count 2420
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 49 rules in 46 ms. Remains 229 /277 variables (removed 48) and now considering 2420/3803 (removed 1383) transitions.
[2024-05-21 13:23:12] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 229 cols
[2024-05-21 13:23:12] [INFO ] Computed 9 invariants in 10 ms
[2024-05-21 13:23:12] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-21 13:23:12] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 13:23:12] [INFO ] Invariant cache hit.
[2024-05-21 13:23:13] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 13:23:14] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/280 places, 2420/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111357 ms. Remains : 229/280 places, 2420/3904 transitions.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Support contains 3 out of 228 places after structural reductions.
FORMULA BugTracking-PT-q8m008-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:23:14] [INFO ] Flatten gal took : 214 ms
[2024-05-21 13:23:14] [INFO ] Flatten gal took : 145 ms
[2024-05-21 13:23:14] [INFO ] Input system was already deterministic with 2420 transitions.
RANDOM walk for 40008 steps (223 resets) in 1033 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217374 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217374 steps, saw 123678 distinct states, run finished after 3005 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-21 13:23:18] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 13:23:18] [INFO ] Computed 8 invariants in 12 ms
[2024-05-21 13:23:18] [INFO ] State equation strengthened by 210 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) 32/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 13:23:18] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 35/2546 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, State Equation: 0/228 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 396ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA BugTracking-PT-q8m008-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 73 stable transitions
All properties solved by simple procedures.
Total runtime 117616 ms.
ITS solved all properties within timeout

BK_STOP 1716297798916

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="BugTracking-PT-q8m008"
export BK_EXAMINATION="LTLFireability"
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 BugTracking-PT-q8m008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398100404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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