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-171654455800187.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 PolyORBLF-PT-S04J06T08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455800187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717269766947

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:22:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:22:48] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-06-01 19:22:48] [INFO ] Transformed 792 places.
[2024-06-01 19:22:48] [INFO ] Transformed 4268 transitions.
[2024-06-01 19:22:48] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 470 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 792/792 places, 4268/4268 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 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2316 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 2316 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 8 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 2508 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2668 place count 540 transition count 1852
Applied a total of 2668 rules in 155 ms. Remains 540 /792 variables (removed 252) and now considering 1852/4268 (removed 2416) transitions.
Running 1848 sub problems to find dead transitions.
[2024-06-01 19:22:49] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 540 cols
[2024-06-01 19:22:49] [INFO ] Computed 54 invariants in 163 ms
[2024-06-01 19:22:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 19:23:13] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 17 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/2360 variables, and 47 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1848/1848 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 19:23:21] [INFO ] Deduced a trap composed of 52 places in 409 ms of which 4 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 54 places in 346 ms of which 3 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 9 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 2 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:23:22] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:23:23] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 3 ms to minimize.
[2024-06-01 19:23:23] [INFO ] Deduced a trap composed of 73 places in 260 ms of which 3 ms to minimize.
[2024-06-01 19:23:26] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:23:26] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 72 places in 368 ms of which 3 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/2360 variables, and 60 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1848 constraints, Known Traps: 15/15 constraints]
After SMT, in 50172ms problems are : Problem set: 0 solved, 1848 unsolved
Search for dead transitions found 0 dead transitions in 50229ms
[2024-06-01 19:23:39] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
[2024-06-01 19:23:39] [INFO ] Invariant cache hit.
[2024-06-01 19:23:40] [INFO ] Implicit Places using invariants in 782 ms returned [2, 89, 100, 147, 200, 236, 263, 397]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 809 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 532/792 places, 1852/4268 transitions.
Applied a total of 0 rules in 12 ms. Remains 532 /532 variables (removed 0) and now considering 1852/1852 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 51266 ms. Remains : 532/792 places, 1852/4268 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 9058 ms. (4 steps per ms) remains 458/1848 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 19 ms. (20 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 12 ms. (30 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 14 ms. (26 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 458/458 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 458/458 properties
[2024-06-01 19:23:43] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 532 cols
[2024-06-01 19:23:43] [INFO ] Computed 46 invariants in 46 ms
[2024-06-01 19:23:43] [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, 458 unsolved
Problem qltransition_24 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 6465ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Fused 458 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1852/1852 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 525 transition count 1845
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 525 transition count 1845
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 525 transition count 1837
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 517 transition count 1837
Applied a total of 30 rules in 214 ms. Remains 517 /532 variables (removed 15) and now considering 1837/1852 (removed 15) transitions.
Running 1833 sub problems to find dead transitions.
[2024-06-01 19:23:49] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 517 cols
[2024-06-01 19:23:50] [INFO ] Computed 46 invariants in 222 ms
[2024-06-01 19:23:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 1 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/2322 variables, and 46 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/517 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1833/1833 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 3 ms to minimize.
[2024-06-01 19:24:26] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 2 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 89 places in 253 ms of which 2 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 2 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 92 places in 230 ms of which 2 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 2 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 3 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/2322 variables, and 62 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/517 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1833 constraints, Known Traps: 21/21 constraints]
After SMT, in 50145ms problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 50167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50387 ms. Remains : 517/532 places, 1837/1852 transitions.
Total runtime 111639 ms.
ITS solved all properties within timeout

BK_STOP 1717269880077

--------------------
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-S04J06T08"
export BK_EXAMINATION="QuasiLiveness"
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 PolyORBLF-PT-S04J06T08, 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 r518-tajo-171654455800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;