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.r439-tajo-167905985900082.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 ltsminxred
Input is ShieldRVs-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-tajo-167905985900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 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 256K 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 1679552780866

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=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:26:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-23 06:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:26:22] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-23 06:26:22] [INFO ] Transformed 563 places.
[2023-03-23 06:26:22] [INFO ] Transformed 763 transitions.
[2023-03-23 06:26:22] [INFO ] Found NUPN structural information;
[2023-03-23 06:26:22] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 155 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 47 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-23 06:26:22] [INFO ] Computed 161 place invariants in 25 ms
[2023-03-23 06:26:23] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-23 06:26:23] [INFO ] Invariant cache hit.
[2023-03-23 06:26:23] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2023-03-23 06:26:23] [INFO ] Invariant cache hit.
[2023-03-23 06:26:24] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 562/563 places, 762/763 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1494 ms. Remains : 562/563 places, 762/763 transitions.
Discarding 240 transitions out of 762. Remains 522
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 701 ms. (steps per millisecond=14 ) properties (out of 521) seen :473
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) seen :0
Running SMT prover for 45 properties.
[2023-03-23 06:26:25] [INFO ] Invariant cache hit.
[2023-03-23 06:26:25] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2023-03-23 06:26:27] [INFO ] After 2264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:45
[2023-03-23 06:26:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-23 06:26:30] [INFO ] After 2294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :45
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 9 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 864 ms
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 16 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-23 06:26:32] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 0 ms to minimize.
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-23 06:26:33] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-23 06:26:34] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-23 06:26:35] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 13 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-23 06:26:36] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-23 06:26:37] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2023-03-23 06:26:38] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-23 06:26:38] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 0 ms to minimize.
[2023-03-23 06:26:38] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-23 06:26:38] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2023-03-23 06:26:38] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-23 06:26:39] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-23 06:26:39] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-23 06:26:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-23 06:26:39] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-23 06:26:39] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 10 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-23 06:26:40] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:41] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 14 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 4 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-23 06:26:42] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-23 06:26:43] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-23 06:26:44] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2023-03-23 06:26:45] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-23 06:26:46] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2023-03-23 06:26:47] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-03-23 06:26:48] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-23 06:26:49] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 0 ms to minimize.
[2023-03-23 06:26:49] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 1 ms to minimize.
[2023-03-23 06:26:49] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2023-03-23 06:26:49] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2023-03-23 06:26:49] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-23 06:26:50] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-23 06:26:50] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 0 ms to minimize.
[2023-03-23 06:26:50] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-23 06:26:50] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-23 06:26:50] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 4 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-23 06:26:51] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-23 06:26:52] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-23 06:26:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-23 06:26:52] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-23 06:26:52] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-23 06:26:53] [INFO ] Deduced a trap composed of 3 places in 379 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 06:26:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 06:26:53] [INFO ] After 25395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:45
Parikh walk visited 3 properties in 8285 ms.
Support contains 115 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 562 transition count 762
Applied a total of 60 rules in 87 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 562/562 places, 762/762 transitions.
Finished random walk after 24271 steps, including 50 resets, run visited all 42 properties in 491 ms. (steps per millisecond=49 )
Able to resolve query QuasiLiveness after proving 522 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 39497 ms.
ITS solved all properties within timeout

BK_STOP 1679552822122

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040A"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-040A, 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 r439-tajo-167905985900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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