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.r365-tall-171683779500517.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 itstools
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 r365-tall-171683779500517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 370K 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 1716917059783

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-28 17:24:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-28 17:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:24:21] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-28 17:24:21] [INFO ] Transformed 1203 places.
[2024-05-28 17:24:21] [INFO ] Transformed 1353 transitions.
[2024-05-28 17:24:21] [INFO ] Found NUPN structural information;
[2024-05-28 17:24:21] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 352 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 13 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 259 ms. Remains 452 /1203 variables (removed 751) and now considering 602/1353 (removed 751) transitions.
// Phase 1: matrix 602 rows 452 cols
[2024-05-28 17:24:21] [INFO ] Computed 121 invariants in 18 ms
[2024-05-28 17:24:22] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-28 17:24:22] [INFO ] Invariant cache hit.
[2024-05-28 17:24:23] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-28 17:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 121/572 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 11 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:24:36] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-28 17:24:37] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 12 ms to minimize.
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/593 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:24:38] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:24:39] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/613 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 5 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:40] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:24:41] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:24:42] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 17:24:42] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:24:42] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/633 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:24:46] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:24:47] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/653 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:24:48] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:24:49] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/673 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-28 17:24:50] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:24:51] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:24:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:24:52] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:24:53] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
SMT process timed out in 30377ms, After SMT, problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 30401ms
Starting structural reductions in LIVENESS mode, iteration 1 : 452/1203 places, 602/1353 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 32328 ms. Remains : 452/1203 places, 602/1353 transitions.
Discarding 180 transitions out of 602. Remains 422
Initial state reduction rules removed 1 formulas.
[2024-05-28 17:24:54] [INFO ] Flatten gal took : 181 ms
[2024-05-28 17:24:54] [INFO ] Flatten gal took : 101 ms
[2024-05-28 17:24:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17719758776849825206.gal : 34 ms
RANDOM walk for 40000 steps (96 resets) in 3176 ms. (12 steps per ms) remains 1/421 properties
[2024-05-28 17:24:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5885687193469314514.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17719758776849825206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5885687193469314514.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 12707 steps (2 resets) in 97 ms. (129 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 422 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 33967 ms.

BK_STOP 1716917095099

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="itstools"
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 itstools"
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 r365-tall-171683779500517"
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 ;