Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r407-oct2-167903726300087.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r407-oct2-167903726300087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 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 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 675K 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 1679762565998

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=ShieldIIPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-25 16:42:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 16:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 16:42:48] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-03-25 16:42:48] [INFO ] Transformed 2403 places.
[2023-03-25 16:42:48] [INFO ] Transformed 2363 transitions.
[2023-03-25 16:42:48] [INFO ] Found NUPN structural information;
[2023-03-25 16:42:48] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 468 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2403 transition count 2162
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 2202 transition count 2162
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 2202 transition count 1961
Deduced a syphon composed of 201 places in 19 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 2001 transition count 1961
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 3 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2724 place count 1041 transition count 1001
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2724 rules in 329 ms. Remains 1041 /2403 variables (removed 1362) and now considering 1001/2363 (removed 1362) transitions.
// Phase 1: matrix 1001 rows 1041 cols
[2023-03-25 16:42:48] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-25 16:42:50] [INFO ] Implicit Places using invariants in 1364 ms returned [1026]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1407 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1040/2403 places, 1001/2363 transitions.
Applied a total of 0 rules in 15 ms. Remains 1040 /1040 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1752 ms. Remains : 1040/2403 places, 1001/2363 transitions.
Discarding 240 transitions out of 1001. Remains 761
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 760) seen :719
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) 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 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) 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 40) 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 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 40) 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 40) 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 40) 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 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) seen :1
Running SMT prover for 38 properties.
// Phase 1: matrix 1001 rows 1040 cols
[2023-03-25 16:42:51] [INFO ] Computed 360 place invariants in 8 ms
[2023-03-25 16:42:52] [INFO ] [Real]Absence check using 360 positive place invariants in 145 ms returned sat
[2023-03-25 16:42:58] [INFO ] After 6837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-25 16:42:59] [INFO ] [Nat]Absence check using 360 positive place invariants in 65 ms returned sat
[2023-03-25 16:43:06] [INFO ] After 5383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-25 16:43:06] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 15 ms to minimize.
[2023-03-25 16:43:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2023-03-25 16:43:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 10 ms to minimize.
[2023-03-25 16:43:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 2 ms to minimize.
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 13 ms to minimize.
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-03-25 16:43:07] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-03-25 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2182 ms
[2023-03-25 16:43:09] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-25 16:43:09] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-25 16:43:09] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-25 16:43:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-03-25 16:43:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 13 ms to minimize.
[2023-03-25 16:43:10] [INFO ] Deduced a trap composed of 17 places in 592 ms of which 0 ms to minimize.
[2023-03-25 16:43:11] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2023-03-25 16:43:11] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2023-03-25 16:43:11] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-25 16:43:11] [INFO ] Deduced a trap composed of 38 places in 484 ms of which 1 ms to minimize.
[2023-03-25 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2656 ms
[2023-03-25 16:43:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-25 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-25 16:43:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-25 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-25 16:43:13] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2023-03-25 16:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-25 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 415 ms
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-25 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-25 16:43:14] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-25 16:43:15] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 26 ms to minimize.
[2023-03-25 16:43:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-25 16:43:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 720 ms
[2023-03-25 16:43:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-25 16:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-25 16:43:16] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
[2023-03-25 16:43:16] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-25 16:43:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-25 16:43:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 27 ms to minimize.
[2023-03-25 16:43:17] [INFO ] Deduced a trap composed of 9 places in 981 ms of which 0 ms to minimize.
[2023-03-25 16:43:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1788 ms
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-25 16:43:18] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 932 ms
[2023-03-25 16:43:19] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-03-25 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 622 ms
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 13 ms to minimize.
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-25 16:43:20] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-25 16:43:21] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-25 16:43:21] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-25 16:43:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1334 ms
[2023-03-25 16:43:21] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 15 ms to minimize.
[2023-03-25 16:43:21] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-25 16:43:21] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-25 16:43:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2023-03-25 16:43:22] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-25 16:43:22] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 3 ms to minimize.
[2023-03-25 16:43:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2023-03-25 16:43:22] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 10 ms to minimize.
[2023-03-25 16:43:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-25 16:43:23] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-25 16:43:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-25 16:43:23] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 677 ms
[2023-03-25 16:43:23] [INFO ] After 22658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-25 16:43:23] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
Parikh walk visited 12 properties in 27361 ms.
Support contains 74 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 1001/1001 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1000 transition count 961
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1000 transition count 961
Partial Free-agglomeration rule applied 233 times.
Drop transitions removed 233 transitions
Iterating global reduction 0 with 233 rules applied. Total rules applied 313 place count 1000 transition count 961
Applied a total of 313 rules in 153 ms. Remains 1000 /1040 variables (removed 40) and now considering 961/1001 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 1000/1040 places, 961/1001 transitions.
Finished random walk after 52908 steps, including 17 resets, run visited all 26 properties in 858 ms. (steps per millisecond=61 )
Able to resolve query QuasiLiveness after proving 761 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 63892 ms.
ITS solved all properties within timeout

BK_STOP 1679762632048

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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 r407-oct2-167903726300087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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