Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r439-tajo-167905985900077.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-tajo-167905985900077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 370K Mar 5 18:23 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 1679552779699

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:26:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-23 06:26:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:26:21] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-23 06:26:21] [INFO ] Transformed 1203 places.
[2023-03-23 06:26:21] [INFO ] Transformed 1353 transitions.
[2023-03-23 06:26:21] [INFO ] Found NUPN structural information;
[2023-03-23 06:26:21] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 180 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1203 transition count 1232
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 1082 transition count 1232
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 1082 transition count 1082
Deduced a syphon composed of 150 places in 12 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 932 transition count 1082
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 6 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 1502 place count 452 transition count 602
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 1502 rules in 167 ms. Remains 452 /1203 variables (removed 751) and now considering 602/1353 (removed 751) transitions.
// Phase 1: matrix 602 rows 452 cols
[2023-03-23 06:26:21] [INFO ] Computed 121 place invariants in 17 ms
[2023-03-23 06:26:22] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-23 06:26:22] [INFO ] Invariant cache hit.
[2023-03-23 06:26:22] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-23 06:26:22] [INFO ] Invariant cache hit.
[2023-03-23 06:26:23] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 452/1203 places, 602/1353 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1549 ms. Remains : 452/1203 places, 602/1353 transitions.
Discarding 180 transitions out of 602. Remains 422
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 421) seen :391
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-23 06:26:24] [INFO ] Invariant cache hit.
[2023-03-23 06:26:24] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-23 06:26:25] [INFO ] After 1397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-23 06:26:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-23 06:26:26] [INFO ] After 879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 6 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 8 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 15 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1410 ms
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2549 ms
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 940 ms
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 8 places in 1461 ms of which 28 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1814 ms
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 861 ms
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-23 06:26:36] [INFO ] After 10781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 798 ms.
[2023-03-23 06:26:37] [INFO ] After 12036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 2 properties in 3610 ms.
Support contains 74 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 602/602 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 422 transition count 572
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 422 transition count 572
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 109 place count 422 transition count 572
Applied a total of 109 rules in 81 ms. Remains 422 /452 variables (removed 30) and now considering 572/602 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 422/452 places, 572/602 transitions.
Finished random walk after 24609 steps, including 69 resets, run visited all 26 properties in 405 ms. (steps per millisecond=60 )
Able to resolve query QuasiLiveness after proving 422 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 20290 ms.
ITS solved all properties within timeout

BK_STOP 1679552801751

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldRVs-PT-030B"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-030B, 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 r439-tajo-167905985900077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B 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 ;