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.r222-tall-165286025800823.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-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.4K Apr 30 06:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 06:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.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.2K 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 11K Apr 30 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 30 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 30 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 30 06:56 ReachabilityFireability.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 191K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654279834775

Running Version 202205111006
[2022-06-03 18:10:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2022-06-03 18:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:10:36] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-03 18:10:36] [INFO ] Transformed 423 places.
[2022-06-03 18:10:36] [INFO ] Transformed 573 transitions.
[2022-06-03 18:10:36] [INFO ] Found NUPN structural information;
[2022-06-03 18:10:36] [INFO ] Parsed PT model containing 423 places and 573 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 24 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 16) seen :12
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 573 rows 423 cols
[2022-06-03 18:10:37] [INFO ] Computed 121 place invariants in 26 ms
[2022-06-03 18:10:37] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 18:10:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2022-06-03 18:10:38] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 3 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 368 ms
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:10:39] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:10:40] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-06-03 18:10:41] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2022-06-03 18:10:42] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2022-06-03 18:10:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4384 ms
[2022-06-03 18:10:43] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 4384 ms
[2022-06-03 18:10:43] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 4 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:10:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-06-03 18:10:45] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-06-03 18:10:45] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:10:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1258 ms
[2022-06-03 18:10:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:10:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2022-06-03 18:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2022-06-03 18:10:45] [INFO ] After 7861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 801 ms.
[2022-06-03 18:10:46] [INFO ] After 8897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3806 ms.
Support contains 178 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 27 place count 422 transition count 572
Applied a total of 27 rules in 87 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/423 places, 572/573 transitions.
Incomplete random walk after 1000000 steps, including 2621 resets, run finished after 20644 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 252 resets, run finished after 4810 ms. (steps per millisecond=207 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 277 resets, run finished after 2839 ms. (steps per millisecond=352 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 337 resets, run finished after 3610 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 959439 steps, including 268 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2022-06-03 18:11:27] [INFO ] Computed 121 place invariants in 11 ms
[2022-06-03 18:11:27] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:11:27] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-06-03 18:11:27] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:11:28] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-06-03 18:11:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:11:30] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:11:31] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2022-06-03 18:11:32] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2022-06-03 18:11:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2022-06-03 18:11:34] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-06-03 18:11:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2022-06-03 18:11:36] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2022-06-03 18:11:37] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2022-06-03 18:11:37] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2022-06-03 18:11:37] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-06-03 18:11:37] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-06-03 18:11:37] [INFO ] Trap strengthening (SAT) tested/added 98/97 trap constraints in 9244 ms
[2022-06-03 18:11:37] [INFO ] After 9726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-06-03 18:11:37] [INFO ] After 9977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 198 ms.
Support contains 28 out of 422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 422 transition count 572
Applied a total of 29 rules in 59 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Incomplete random walk after 1000000 steps, including 2821 resets, run finished after 4135 ms. (steps per millisecond=241 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 368 resets, run finished after 2907 ms. (steps per millisecond=343 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5317 steps, run visited all 1 properties in 42 ms. (steps per millisecond=126 )
Probabilistic random walk after 5317 steps, saw 5088 distinct states, run finished after 43 ms. (steps per millisecond=123 ) properties seen :1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 68795 ms.

BK_STOP 1654279904844

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityFireability -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 3600 -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-030A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-030A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025800823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;