Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r534-smll-171683819200027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d0m96, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819200027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 19:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 1717247985506

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:19:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:19:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:19:47] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-06-01 13:19:47] [INFO ] Transformed 262 places.
[2024-06-01 13:19:47] [INFO ] Transformed 73 transitions.
[2024-06-01 13:19:47] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 339 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 34 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-06-01 13:19:48] [INFO ] Computed 5 invariants in 12 ms
[2024-06-01 13:19:48] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 13:19:48] [INFO ] Invariant cache hit.
[2024-06-01 13:19:48] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:19:49] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:19:49] [INFO ] Invariant cache hit.
[2024-06-01 13:19:49] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 15 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:19:51] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 181 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4387 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
After SMT, in 9006ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9031ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 10190 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8948 resets) in 2627 ms. (15 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4004 steps (205 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (192 resets) in 83 ms. (47 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (192 resets) in 79 ms. (50 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (197 resets) in 95 ms. (41 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (218 resets) in 66 ms. (59 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4002 steps (179 resets) in 77 ms. (51 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (200 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (191 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (186 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (189 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (184 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (201 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (184 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (173 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (199 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (203 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (199 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (198 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (201 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (459 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (410 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (412 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (410 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (409 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (386 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (401 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (399 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (404 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (437 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (403 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (385 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (406 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (429 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
[2024-06-01 13:19:59] [INFO ] Invariant cache hit.
[2024-06-01 13:19:59] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/143 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 141 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 4013ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 32 different solutions.
Parikh walk visited 16 properties in 9393 ms.
Support contains 25 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 63 transition count 65
Applied a total of 15 rules in 55 ms. Remains 63 /70 variables (removed 7) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 63/70 places, 65/73 transitions.
RANDOM walk for 4000000 steps (895129 resets) in 21198 ms. (188 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19173 resets) in 835 ms. (478 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19302 resets) in 692 ms. (577 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (19160 resets) in 681 ms. (586 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19214 resets) in 686 ms. (582 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19307 resets) in 692 ms. (577 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19302 resets) in 696 ms. (573 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (19118 resets) in 659 ms. (606 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19275 resets) in 870 ms. (459 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19286 resets) in 781 ms. (511 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19390 resets) in 682 ms. (585 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1046 ms. (382 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (42106 resets) in 840 ms. (475 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41071 resets) in 822 ms. (486 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41295 resets) in 842 ms. (474 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (41043 resets) in 827 ms. (483 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (40960 resets) in 821 ms. (486 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41089 resets) in 821 ms. (486 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41206 resets) in 843 ms. (473 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41233 resets) in 830 ms. (481 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 1620 steps, run visited all 18 properties in 34 ms. (steps per millisecond=47 )
Probabilistic random walk after 1620 steps, saw 849 distinct states, run finished after 41 ms. (steps per millisecond=39 ) properties seen :18
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 36707 ms.
ITS solved all properties within timeout

BK_STOP 1717248024295

--------------------
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="SieveSingleMsgMbox-PT-d0m96"
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 SieveSingleMsgMbox-PT-d0m96, 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 r534-smll-171683819200027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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