Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 191K 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 1679554971115

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=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 07:02:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-23 07:02:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:02:53] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-23 07:02:53] [INFO ] Transformed 423 places.
[2023-03-23 07:02:53] [INFO ] Transformed 573 transitions.
[2023-03-23 07:02:53] [INFO ] Found NUPN structural information;
[2023-03-23 07:02:53] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 148 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 49 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 422 cols
[2023-03-23 07:02:53] [INFO ] Computed 121 place invariants in 24 ms
[2023-03-23 07:02:53] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-23 07:02:53] [INFO ] Invariant cache hit.
[2023-03-23 07:02:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-23 07:02:54] [INFO ] Invariant cache hit.
[2023-03-23 07:02:54] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/423 places, 572/573 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1232 ms. Remains : 422/423 places, 572/573 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 391) seen :366
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-23 07:02:55] [INFO ] Invariant cache hit.
[2023-03-23 07:02:55] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-23 07:02:56] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-23 07:02:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-23 07:02:58] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 8 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-23 07:02:58] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1140 ms
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-23 07:02:59] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:03:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:03:01] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:03:02] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2023-03-23 07:03:03] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 3 ms to minimize.
[2023-03-23 07:03:04] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2023-03-23 07:03:05] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-23 07:03:06] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-03-23 07:03:07] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-03-23 07:03:08] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:03:09] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:03:10] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2023-03-23 07:03:11] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-23 07:03:12] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:03:13] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:03:14] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:03:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-23 07:03:16] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2023-03-23 07:03:17] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 0 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2023-03-23 07:03:18] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:03:19] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:03:20] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-03-23 07:03:21] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:03:21] [INFO ] After 25079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Parikh walk visited 2 properties in 2125 ms.
Support contains 57 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 422 transition count 572
Applied a total of 54 rules in 110 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 422/422 places, 572/572 transitions.
Finished random walk after 26162 steps, including 72 resets, run visited all 22 properties in 1006 ms. (steps per millisecond=26 )
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 31999 ms.
ITS solved all properties within timeout

BK_STOP 1679555005149

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldRVs-PT-030A, 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 r440-tajo-167905986400072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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