Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r229-tall-165286034500537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 625K May 10 09:34 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 1653038112683

Running Version 202205111006
[2022-05-20 09:15:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-20 09:15:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:15:14] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-20 09:15:14] [INFO ] Transformed 2003 places.
[2022-05-20 09:15:14] [INFO ] Transformed 2253 transitions.
[2022-05-20 09:15:14] [INFO ] Found NUPN structural information;
[2022-05-20 09:15:14] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 324 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2003/2003 places, 2253/2253 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 2003 transition count 2052
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1802 transition count 2052
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1802 transition count 1802
Deduced a syphon composed of 250 places in 20 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1552 transition count 1802
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 1252 place count 1202 transition count 1452
Iterating global reduction 2 with 350 rules applied. Total rules applied 1602 place count 1202 transition count 1452
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 1602 place count 1202 transition count 1302
Deduced a syphon composed of 150 places in 7 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 1902 place count 1052 transition count 1302
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 3 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 2 with 700 rules applied. Total rules applied 2602 place count 702 transition count 952
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2602 rules in 479 ms. Remains 702 /2003 variables (removed 1301) and now considering 952/2253 (removed 1301) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 09:15:14] [INFO ] Computed 201 place invariants in 25 ms
[2022-05-20 09:15:15] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 09:15:15] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 09:15:15] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 09:15:15] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 09:15:16] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 702/2003 places, 952/2253 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/2003 places, 952/2253 transitions.
Discarding 300 transitions out of 952. Remains 652
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 651) seen :566
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 85) 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 85) 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 84) 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 84) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) 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 82) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 82) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 82) 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 82) 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 82) seen :0
Running SMT prover for 82 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 09:15:17] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 09:15:18] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2022-05-20 09:15:23] [INFO ] After 6004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:82
[2022-05-20 09:15:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 39 ms returned sat
[2022-05-20 09:15:29] [INFO ] After 3863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :82
[2022-05-20 09:15:29] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
[2022-05-20 09:15:29] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-20 09:15:29] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2022-05-20 09:15:29] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-20 09:15:29] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1574 ms
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2022-05-20 09:15:31] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 998 ms
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2022-05-20 09:15:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 699 ms
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2022-05-20 09:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2022-05-20 09:15:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1828 ms
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 3 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2022-05-20 09:15:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 716 ms
[2022-05-20 09:15:36] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 446 ms
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-20 09:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2022-05-20 09:15:38] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 12 ms to minimize.
[2022-05-20 09:15:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:15:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:38] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:15:39] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2022-05-20 09:15:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:43] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:15:44] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:45] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:15:46] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:15:47] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2022-05-20 09:15:48] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:15:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:15:48] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:82
Parikh walk visited 27 properties in 30298 ms.
Support contains 156 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 702 transition count 952
Applied a total of 75 rules in 91 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Finished random walk after 59183 steps, including 99 resets, run visited all 55 properties in 1286 ms. (steps per millisecond=46 )
Able to resolve query QuasiLiveness after proving 652 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 66522 ms.

BK_STOP 1653038180425

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050B, 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 r229-tall-165286034500537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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