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.r518-tajo-171654456000283.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 ltsminxred
Input is PolyORBNT-PT-S05J30, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654456000283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 23K Apr 12 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 12 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 12 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 512K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717270225329

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:30:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:30:27] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-06-01 19:30:27] [INFO ] Transformed 489 places.
[2024-06-01 19:30:27] [INFO ] Transformed 1400 transitions.
[2024-06-01 19:30:27] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 545 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 24 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2742 resets) in 3690 ms. (10 steps per ms) remains 6/487 properties
BEST_FIRST walk for 40001 steps (662 resets) in 267 ms. (149 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (621 resets) in 193 ms. (206 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (614 resets) in 193 ms. (206 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (622 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
[2024-06-01 19:30:29] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-06-01 19:30:29] [INFO ] Computed 82 invariants in 53 ms
[2024-06-01 19:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 258/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 196/457 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/488 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 741/1229 variables, 488/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1230 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1230 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1230 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 572 constraints, problems are : Problem set: 0 solved, 3 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 258/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:30] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 196/457 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 31/488 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:30] [INFO ] Deduced a trap composed of 108 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:30:31] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 741/1229 variables, 488/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1229 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1229 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/1230 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1230 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1230 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 578 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 2982ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 923 ms.
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 484 transition count 710
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 75 place count 449 transition count 710
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 75 place count 449 transition count 676
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 143 place count 415 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 414 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 414 transition count 675
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 412 transition count 673
Applied a total of 149 rules in 235 ms. Remains 412 /489 variables (removed 77) and now considering 673/745 (removed 72) transitions.
Running 667 sub problems to find dead transitions.
[2024-06-01 19:30:33] [INFO ] Flow matrix only has 669 transitions (discarded 4 similar events)
// Phase 1: matrix 669 rows 412 cols
[2024-06-01 19:30:33] [INFO ] Computed 77 invariants in 24 ms
[2024-06-01 19:30:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/412 variables, 5/77 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 669/1081 variables, 412/489 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 1/490 constraints. Problems are: Problem set: 95 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 490 constraints, problems are : Problem set: 95 solved, 572 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 59/59 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 13/72 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/72 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 3 (OVERLAPS) 5/412 variables, 5/77 constraints. Problems are: Problem set: 95 solved, 572 unsolved
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 3 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 218 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 3/80 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/80 constraints. Problems are: Problem set: 95 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 669/1081 variables, 412/492 constraints. Problems are: Problem set: 95 solved, 572 unsolved
SMT process timed out in 41541ms, After SMT, problems are : Problem set: 95 solved, 572 unsolved
Search for dead transitions found 95 dead transitions in 41563ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 412/489 places, 578/745 transitions.
Applied a total of 0 rules in 47 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41878 ms. Remains : 412/489 places, 578/745 transitions.
RANDOM walk for 1099 steps (51 resets) in 19 ms. (54 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 488 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 48074 ms.
ITS solved all properties within timeout

BK_STOP 1717270275290

--------------------
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 StableMarking -timeout 180 -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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S05J30, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654456000283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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