Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700292.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-PT-S04J04T08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 24K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 578K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 375K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.3M May 29 14:32 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748899948129

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:32:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:32:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:32:29] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2025-06-02 21:32:29] [INFO ] Transformed 712 places.
[2025-06-02 21:32:29] [INFO ] Transformed 4012 transitions.
[2025-06-02 21:32:29] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 396 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 712/712 places, 4012/4012 transitions.
Ensure Unique test removed 4 places
Ensure Unique test removed 2168 transitions
Reduce isomorphic transitions removed 2168 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 2244 rules applied. Total rules applied 2244 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2316 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 2316 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 8 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2476 place count 556 transition count 1692
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2636 place count 476 transition count 1612
Applied a total of 2636 rules in 157 ms. Remains 476 /712 variables (removed 236) and now considering 1612/4012 (removed 2400) transitions.
Running 1608 sub problems to find dead transitions.
[2025-06-02 21:32:29] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 476 cols
[2025-06-02 21:32:30] [INFO ] Computed 50 invariants in 79 ms
[2025-06-02 21:32:30] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2025-06-02 21:32:50] [INFO ] Deduced a trap composed of 47 places in 364 ms of which 37 ms to minimize.
[2025-06-02 21:32:50] [INFO ] Deduced a trap composed of 46 places in 317 ms of which 3 ms to minimize.
[2025-06-02 21:32:50] [INFO ] Deduced a trap composed of 46 places in 296 ms of which 5 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 151 places in 317 ms of which 3 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-02 21:32:51] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 3 ms to minimize.
[2025-06-02 21:32:52] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 3 ms to minimize.
[2025-06-02 21:32:52] [INFO ] Deduced a trap composed of 46 places in 289 ms of which 3 ms to minimize.
[2025-06-02 21:32:53] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 4 ms to minimize.
[2025-06-02 21:32:53] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 1 ms to minimize.
[2025-06-02 21:32:54] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:32:54] [INFO ] Deduced a trap composed of 196 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:32:55] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2056 variables, and 62 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2025-06-02 21:33:06] [INFO ] Deduced a trap composed of 218 places in 341 ms of which 3 ms to minimize.
[2025-06-02 21:33:06] [INFO ] Deduced a trap composed of 192 places in 281 ms of which 2 ms to minimize.
[2025-06-02 21:33:07] [INFO ] Deduced a trap composed of 260 places in 289 ms of which 3 ms to minimize.
[2025-06-02 21:33:09] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2056 variables, and 66 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 20/20 constraints]
After SMT, in 47268ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 47317ms
[2025-06-02 21:33:17] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
[2025-06-02 21:33:17] [INFO ] Invariant cache hit.
[2025-06-02 21:33:17] [INFO ] Implicit Places using invariants in 618 ms returned [95, 149, 167, 233, 322, 363, 371, 462]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 624 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 468/712 places, 1612/4012 transitions.
Applied a total of 0 rules in 12 ms. Remains 468 /468 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 48164 ms. Remains : 468/712 places, 1612/4012 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (11 resets) in 3842 ms. (10 steps per ms) remains 453/1608 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 453/453 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 453/453 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 453/453 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 453/453 properties
[2025-06-02 21:33:19] [INFO ] Flow matrix only has 1580 transitions (discarded 32 similar events)
// Phase 1: matrix 1580 rows 468 cols
[2025-06-02 21:33:19] [INFO ] Computed 42 invariants in 44 ms
[2025-06-02 21:33:19] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem qltransition_15 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 6627ms, After SMT, problems are : Problem set: 0 solved, 453 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 1612/1612 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 461 transition count 1605
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 461 transition count 1605
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 461 transition count 1597
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 453 transition count 1597
Applied a total of 30 rules in 190 ms. Remains 453 /468 variables (removed 15) and now considering 1597/1612 (removed 15) transitions.
Running 1593 sub problems to find dead transitions.
[2025-06-02 21:33:26] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
// Phase 1: matrix 1565 rows 453 cols
[2025-06-02 21:33:26] [INFO ] Computed 42 invariants in 30 ms
[2025-06-02 21:33:26] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2025-06-02 21:33:44] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 3 ms to minimize.
[2025-06-02 21:33:44] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:33:46] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:33:46] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/2018 variables, and 41 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/31 constraints, State Equation: 0/453 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1593/1593 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2025-06-02 21:33:55] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-02 21:33:55] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-02 21:33:55] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2025-06-02 21:33:56] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:33:56] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2025-06-02 21:33:56] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2025-06-02 21:33:56] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:34:08] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/2018 variables, and 49 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/31 constraints, State Equation: 0/453 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1593 constraints, Known Traps: 12/12 constraints]
After SMT, in 46938ms problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 46951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47146 ms. Remains : 453/468 places, 1597/1612 transitions.
Total runtime 103839 ms.
ITS solved all properties within timeout

BK_STOP 1748900053185

--------------------
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 QuasiLiveness -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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S04J04T08, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;