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-165286034500522.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-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.4K Apr 30 06:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 06:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 06:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 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 256K 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 1653038009689

Running Version 202205111006
[2022-05-20 09:13:30] [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:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:13:31] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-20 09:13:31] [INFO ] Transformed 563 places.
[2022-05-20 09:13:31] [INFO ] Transformed 763 transitions.
[2022-05-20 09:13:31] [INFO ] Found NUPN structural information;
[2022-05-20 09:13:31] [INFO ] Parsed PT model containing 563 places and 763 transitions in 225 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 11 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 115 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:13:31] [INFO ] Computed 161 place invariants in 21 ms
[2022-05-20 09:13:31] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:13:31] [INFO ] Computed 161 place invariants in 10 ms
[2022-05-20 09:13:32] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:13:32] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 09:13:32] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 562/563 places, 762/763 transitions.
Finished structural reductions, in 1 iterations. 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 667 ms. (steps per millisecond=14 ) properties (out of 521) seen :467
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) 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 54) 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 54) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 53) 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 53) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Running SMT prover for 52 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:13:33] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 09:13:34] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2022-05-20 09:13:37] [INFO ] After 3532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2022-05-20 09:13:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 38 ms returned sat
[2022-05-20 09:13:41] [INFO ] After 2823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2022-05-20 09:13:41] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 5 ms to minimize.
[2022-05-20 09:13:41] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 2 ms to minimize.
[2022-05-20 09:13:41] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-05-20 09:13:42] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2022-05-20 09:13:43] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-05-20 09:13:44] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 09:13:44] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 20 places in 435 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-20 09:13:45] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5279 ms
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-05-20 09:13:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2022-05-20 09:13:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1057 ms
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:48] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 5 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-20 09:13:52] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:13:55] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 0 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2022-05-20 09:13:56] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-05-20 09:13:57] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:58] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:13:59] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2022-05-20 09:14:00] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:14:01] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-20 09:14:02] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:14:02] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2022-05-20 09:14:02] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:14:02] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2022-05-20 09:14:02] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:14:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:14:02] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:52
Parikh walk visited 24 properties in 12504 ms.
Support contains 79 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 0 with 65 rules applied. Total rules applied 65 place count 562 transition count 762
Applied a total of 65 rules in 78 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Finished random walk after 25107 steps, including 52 resets, run visited all 28 properties in 496 ms. (steps per millisecond=50 )
Able to resolve query QuasiLiveness after proving 522 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 44849 ms.

BK_STOP 1653038055736

--------------------
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-040A"
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-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 r229-tall-165286034500522"
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 ;