fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r514-smll-171654416900162
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
615.600 21848.00 63666.00 176.20 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/mcc2024-input.r514-smll-171654416900162.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 Peterson-PT-3, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416900162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 1717244577906

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:23:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 12:23:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:23:00] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 12:23:01] [INFO ] Transformed 244 places.
[2024-06-01 12:23:01] [INFO ] Transformed 332 transitions.
[2024-06-01 12:23:01] [INFO ] Found NUPN structural information;
[2024-06-01 12:23:01] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 548 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 165 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-06-01 12:23:01] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-06-01 12:23:01] [INFO ] Computed 15 invariants in 17 ms
[2024-06-01 12:23:01] [INFO ] Implicit Places using invariants in 443 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 496 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 702 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
RANDOM walk for 40000 steps (8 resets) in 2245 ms. (17 steps per ms) remains 45/172 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 36/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
[2024-06-01 12:23:02] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2024-06-01 12:23:02] [INFO ] Computed 11 invariants in 8 ms
[2024-06-01 12:23:02] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 12:23:03] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 10 ms to minimize.
[2024-06-01 12:23:03] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:23:03] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:23:03] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:23:03] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:23:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 5 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 12:23:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 12:23:07] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/84 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SMT process timed out in 5088ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 84/84 places, 176/176 transitions.
RANDOM walk for 4000000 steps (8 resets) in 21321 ms. (187 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 428 ms. (932 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 430 ms. (928 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 413 ms. (966 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 434 ms. (919 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 426 ms. (936 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 429 ms. (930 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 435 ms. (917 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 443 ms. (900 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 443 ms. (900 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 441 ms. (904 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 445 ms. (896 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 456 ms. (875 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 445 ms. (896 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 444 ms. (898 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 449 ms. (888 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 494 ms. (808 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 449 ms. (888 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 448 ms. (890 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 444 ms. (898 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 495 ms. (806 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 616 ms. (648 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 655 ms. (609 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 432 ms. (923 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 442 ms. (902 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 461 ms. (865 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 438 ms. (911 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 447 ms. (892 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 441 ms. (904 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 428 ms. (932 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 121825 steps, run visited all 29 properties in 869 ms. (steps per millisecond=140 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 877 ms. (steps per millisecond=138 ) properties seen :29
Able to resolve query QuasiLiveness after proving 172 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 19241 ms.
ITS solved all properties within timeout

BK_STOP 1717244599754

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r514-smll-171654416900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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