Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976300151.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679243080119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:24:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:24:41] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-19 16:24:41] [INFO ] Transformed 703 places.
[2023-03-19 16:24:41] [INFO ] Transformed 953 transitions.
[2023-03-19 16:24:41] [INFO ] Found NUPN structural information;
[2023-03-19 16:24:41] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:24:42] [INFO ] Computed 201 place invariants in 34 ms
[2023-03-19 16:24:43] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:24:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-19 16:24:44] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 6 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 3 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1361 ms
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:24:49] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:24:50] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 13 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:24:51] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-19 16:24:52] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 6625 ms
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:24:53] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:24:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-19 16:24:55] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2248 ms
[2023-03-19 16:24:55] [INFO ] After 12313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1592 ms.
[2023-03-19 16:24:57] [INFO ] After 14166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 192 ms.
Support contains 187 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 703 transition count 953
Applied a total of 79 rules in 234 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 703/703 places, 953/953 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 220643 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220643 steps, saw 51548 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:25:01] [INFO ] Computed 201 place invariants in 16 ms
[2023-03-19 16:25:01] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:25:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:25:02] [INFO ] After 1053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2162 ms
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 7674 ms
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 17 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3596 ms
[2023-03-19 16:25:17] [INFO ] After 16089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1481 ms.
[2023-03-19 16:25:19] [INFO ] After 17768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 162 ms.
Support contains 187 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 75 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 703/703 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 46 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:25:19] [INFO ] Invariant cache hit.
[2023-03-19 16:25:20] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 16:25:20] [INFO ] Invariant cache hit.
[2023-03-19 16:25:21] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-19 16:25:21] [INFO ] Redundant transitions in 193 ms returned []
[2023-03-19 16:25:21] [INFO ] Invariant cache hit.
[2023-03-19 16:25:21] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1988 ms. Remains : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 28 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-19 16:25:21] [INFO ] Invariant cache hit.
[2023-03-19 16:25:21] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:25:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-19 16:25:23] [INFO ] After 1236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:25:24] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-19 16:25:24] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:25:24] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:25:24] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-19 16:25:25] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:25:25] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-19 16:25:25] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:25:25] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:25:25] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:25:26] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:25:26] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:25:26] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:25:26] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:25:27] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:25:27] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:25:27] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:25:27] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:25:27] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:25:28] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:25:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4257 ms
[2023-03-19 16:25:28] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:25:28] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:25:29] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:25:29] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-19 16:25:29] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-19 16:25:29] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:25:30] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:25:30] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:25:30] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:25:30] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:25:31] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:25:31] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:25:31] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:25:31] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:25:31] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:25:32] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:25:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:25:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-19 16:25:33] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-19 16:25:33] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:25:33] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:25:34] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:25:34] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-19 16:25:34] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:25:34] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:25:34] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:25:35] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:25:35] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:25:35] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:25:35] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:25:35] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:25:36] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:25:37] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:25:37] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:25:37] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:25:37] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:25:37] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:25:38] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-19 16:25:39] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:25:39] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-19 16:25:39] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-19 16:25:39] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 10895 ms
[2023-03-19 16:25:39] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:25:39] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:25:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2023-03-19 16:25:40] [INFO ] After 17922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1422 ms.
[2023-03-19 16:25:41] [INFO ] After 19538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 16:25:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-19 16:25:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4756 arcs took 8 ms.
[2023-03-19 16:25:41] [INFO ] Flatten gal took : 142 ms
Total runtime 60085 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityFireability

FORMULA ShieldRVs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679243144044

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 0 ShieldRVs-PT-050A-ReachabilityFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 ShieldRVs-PT-050A-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ShieldRVs-PT-050A-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 15 (type SRCH) for 0 ShieldRVs-PT-050A-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 9 (type FNDP) for ShieldRVs-PT-050A-ReachabilityFireability-04
lola: result : true
lola: fired transitions : 73
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 10 (type EQUN) for ShieldRVs-PT-050A-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 15 (type SRCH) for ShieldRVs-PT-050A-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldRVs-PT-050A-ReachabilityFireability-04 (obsolete)
lola: LAUNCH task # 19 (type EXCL) for 3 ShieldRVs-PT-050A-ReachabilityFireability-06
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 20 (type FNDP) for 6 ShieldRVs-PT-050A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type EQUN) for 6 ShieldRVs-PT-050A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type SRCH) for 6 ShieldRVs-PT-050A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 23 (type SRCH) for ShieldRVs-PT-050A-ReachabilityFireability-15
lola: result : true
lola: markings : 152
lola: fired transitions : 151
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 20 (type FNDP) for ShieldRVs-PT-050A-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 21 (type EQUN) for ShieldRVs-PT-050A-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 11 (type FNDP) for 3 ShieldRVs-PT-050A-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type EQUN) for 3 ShieldRVs-PT-050A-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 3 ShieldRVs-PT-050A-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 20 (type FNDP) for ShieldRVs-PT-050A-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 150
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 18 (type SRCH) for ShieldRVs-PT-050A-ReachabilityFireability-06
lola: result : true
lola: markings : 118
lola: fired transitions : 117
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 11 (type FNDP) for ShieldRVs-PT-050A-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 12 (type EQUN) for ShieldRVs-PT-050A-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 19 (type EXCL) for ShieldRVs-PT-050A-ReachabilityFireability-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050A-ReachabilityFireability-04: EF true findpath
ShieldRVs-PT-050A-ReachabilityFireability-06: EF true tandem / insertion
ShieldRVs-PT-050A-ReachabilityFireability-15: EF true tandem / insertion


Time elapsed: 2 secs. Pages in use: 2

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-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVs-PT-050A, 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 r423-tajo-167905976300151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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