fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r469-smll-167912658600252
Last Updated
May 14, 2023

About the Execution of LoLa+red for StigmergyCommit-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.804 12763.00 25078.00 632.70 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r469-smll-167912658600252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is StigmergyCommit-PT-02b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r469-smll-167912658600252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 231K 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 1679381771172

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=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-02b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 06:56:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-21 06:56:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:56:15] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2023-03-21 06:56:15] [INFO ] Transformed 928 places.
[2023-03-21 06:56:15] [INFO ] Transformed 1040 transitions.
[2023-03-21 06:56:15] [INFO ] Found NUPN structural information;
[2023-03-21 06:56:15] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 446 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 921 edges and 928 vertex of which 63 / 928 are part of one of the 9 SCC in 16 ms
Free SCC test removed 54 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 697 place count 874 transition count 284
Reduce places removed 696 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 708 rules applied. Total rules applied 1405 place count 178 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1408 place count 175 transition count 272
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1408 place count 175 transition count 239
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1474 place count 142 transition count 239
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1566 place count 96 transition count 193
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1584 place count 87 transition count 225
Applied a total of 1584 rules in 115 ms. Remains 87 /928 variables (removed 841) and now considering 225/1040 (removed 815) transitions.
[2023-03-21 06:56:15] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
// Phase 1: matrix 216 rows 87 cols
[2023-03-21 06:56:15] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-21 06:56:16] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-21 06:56:16] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2023-03-21 06:56:16] [INFO ] Invariant cache hit.
[2023-03-21 06:56:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-21 06:56:16] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-21 06:56:16] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2023-03-21 06:56:16] [INFO ] Invariant cache hit.
[2023-03-21 06:56:17] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 87/928 places, 225/1040 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1622 ms. Remains : 87/928 places, 225/1040 transitions.
Discarding 97 transitions out of 225. Remains 128
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1968 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 127) seen :56
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 71) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 70) seen :2
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 68) seen :5
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 63) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 62) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :1
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 59) seen :2
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :7
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 06:56:18] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2023-03-21 06:56:18] [INFO ] Invariant cache hit.
[2023-03-21 06:56:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-21 06:56:19] [INFO ] After 698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:11
[2023-03-21 06:56:19] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-21 06:56:19] [INFO ] After 186ms SMT Verify possible using 64 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-21 06:56:19] [INFO ] After 1275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-21 06:56:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-21 06:56:20] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-21 06:56:20] [INFO ] After 387ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-21 06:56:20] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 7 ms to minimize.
[2023-03-21 06:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-21 06:56:21] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2023-03-21 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-21 06:56:21] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2023-03-21 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-21 06:56:21] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 5 ms to minimize.
[2023-03-21 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-21 06:56:21] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2023-03-21 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-21 06:56:21] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-21 06:56:21] [INFO ] After 1310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-21 06:56:22] [INFO ] After 2534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 210 ms.
Support contains 26 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 225/225 transitions.
Graph (complete) has 288 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 86 transition count 215
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 23 place count 73 transition count 183
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 73 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 73 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 64 transition count 169
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 64 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 58 transition count 163
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 58 transition count 163
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 87 place count 58 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 55 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 55 transition count 138
Free-agglomeration rule applied 8 times with reduction of 3 identical transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 55 transition count 127
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 113 place count 47 transition count 126
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 130 place count 47 transition count 109
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 133 place count 47 transition count 109
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 47 transition count 108
Applied a total of 134 rules in 108 ms. Remains 47 /87 variables (removed 40) and now considering 108/225 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 47/87 places, 108/225 transitions.
Finished random walk after 3884 steps, including 586 resets, run visited all 21 properties in 137 ms. (steps per millisecond=28 )
Able to resolve query QuasiLiveness after proving 128 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 7720 ms.
ITS solved all properties within timeout

BK_STOP 1679381783935

--------------------
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="StigmergyCommit-PT-02b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is StigmergyCommit-PT-02b, 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 r469-smll-167912658600252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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 ;