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-167905976500286.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 ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 239K 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 ShieldRVt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679245571068

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:06:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:06:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:06:14] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-19 17:06:14] [INFO ] Transformed 1003 places.
[2023-03-19 17:06:14] [INFO ] Transformed 1003 transitions.
[2023-03-19 17:06:14] [INFO ] Found NUPN structural information;
[2023-03-19 17:06:14] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 14) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-19 17:06:15] [INFO ] Computed 81 place invariants in 21 ms
[2023-03-19 17:06:15] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:06:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 51 ms returned sat
[2023-03-19 17:06:17] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:06:17] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 11 ms to minimize.
[2023-03-19 17:06:18] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 14 ms to minimize.
[2023-03-19 17:06:18] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 14 ms to minimize.
[2023-03-19 17:06:21] [INFO ] Deduced a trap composed of 41 places in 2410 ms of which 1 ms to minimize.
[2023-03-19 17:06:21] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 2 ms to minimize.
[2023-03-19 17:06:21] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 1 ms to minimize.
[2023-03-19 17:06:22] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 1 ms to minimize.
[2023-03-19 17:06:22] [INFO ] Deduced a trap composed of 34 places in 318 ms of which 2 ms to minimize.
[2023-03-19 17:06:22] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 1 ms to minimize.
[2023-03-19 17:06:23] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 1 ms to minimize.
[2023-03-19 17:06:23] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:06:23] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 1 ms to minimize.
[2023-03-19 17:06:23] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-19 17:06:24] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2023-03-19 17:06:24] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 1 ms to minimize.
[2023-03-19 17:06:24] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 14 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 1 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 0 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 2 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 0 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 1 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 2 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 12054 ms
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 2 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 0 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 0 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 0 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 40 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6756 ms
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 1 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1269 ms
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 14 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1722 ms
[2023-03-19 17:06:40] [INFO ] After 23908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 373 ms.
[2023-03-19 17:06:40] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 155 ms.
Support contains 109 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1003 transition count 773
Reduce places removed 230 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 260 rules applied. Total rules applied 490 place count 773 transition count 743
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 520 place count 743 transition count 743
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 520 place count 743 transition count 665
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 676 place count 665 transition count 665
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 778 place count 563 transition count 563
Iterating global reduction 3 with 102 rules applied. Total rules applied 880 place count 563 transition count 563
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 880 place count 563 transition count 529
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 948 place count 529 transition count 529
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1268 place count 369 transition count 369
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1334 place count 336 transition count 385
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1335 place count 336 transition count 384
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1341 place count 336 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1347 place count 330 transition count 378
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1348 place count 330 transition count 378
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1349 place count 330 transition count 378
Applied a total of 1349 rules in 339 ms. Remains 330 /1003 variables (removed 673) and now considering 378/1003 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 330/1003 places, 378/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) 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 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 378 rows 330 cols
[2023-03-19 17:06:41] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-19 17:06:41] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:06:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-19 17:06:41] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:06:41] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 17:06:42] [INFO ] After 132ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 387 ms
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-19 17:06:42] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-19 17:06:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 499 ms
[2023-03-19 17:06:43] [INFO ] After 1126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-19 17:06:43] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 52 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 378/378 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 330 transition count 358
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 310 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 308 transition count 356
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 44 place count 308 transition count 343
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 70 place count 295 transition count 343
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 144 place count 258 transition count 306
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 247 transition count 316
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 247 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 246 transition count 315
Applied a total of 168 rules in 89 ms. Remains 246 /330 variables (removed 84) and now considering 315/378 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 246/330 places, 315/378 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 246 cols
[2023-03-19 17:06:43] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-19 17:06:43] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:44] [INFO ] [Nat]Absence check using 81 positive place invariants in 553 ms returned sat
[2023-03-19 17:06:44] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 17:06:44] [INFO ] After 123ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-19 17:06:45] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-19 17:06:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 296 ms
[2023-03-19 17:06:45] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-19 17:06:45] [INFO ] After 1450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 35 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 315/315 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 311
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 242 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 242 transition count 306
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 237 transition count 306
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 44 place count 224 transition count 293
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 220 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 218 transition count 294
Applied a total of 54 rules in 49 ms. Remains 218 /246 variables (removed 28) and now considering 294/315 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 218/246 places, 294/315 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 689994 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 689994 steps, saw 429626 distinct states, run finished after 3003 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 218 cols
[2023-03-19 17:06:48] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 17:06:48] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2023-03-19 17:06:48] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:48] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-19 17:06:48] [INFO ] After 148ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:48] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-19 17:06:49] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-19 17:06:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-19 17:06:49] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-19 17:06:49] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 35 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 218 /218 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 218/218 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 294/294 transitions.
Applied a total of 0 rules in 12 ms. Remains 218 /218 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-19 17:06:49] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2023-03-19 17:06:49] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 218/218 places, 294/294 transitions.
Graph (trivial) has 56 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 683 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 216 transition count 285
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 216 transition count 285
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 216 transition count 278
Applied a total of 24 rules in 29 ms. Remains 216 /218 variables (removed 2) and now considering 278/294 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 216 cols
[2023-03-19 17:06:49] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-19 17:06:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:06:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 21 ms returned sat
[2023-03-19 17:06:50] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:50] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 17:06:50] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:06:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2023-03-19 17:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 218 places, 294 transitions and 1432 arcs took 3 ms.
[2023-03-19 17:06:50] [INFO ] Flatten gal took : 65 ms
Total runtime 36661 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality

FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679245610952

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for ShieldRVt-PT-020B-ReachabilityCardinality-04
lola: result : true
lola: markings : 40
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for ShieldRVt-PT-020B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 5 (type EQUN) for ShieldRVt-PT-020B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldRVt-PT-020B-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-020B-ReachabilityCardinality-04: AG false tandem / insertion


Time elapsed: 0 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="ShieldRVt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVt-PT-020B, examination is ReachabilityCardinality"
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-167905976500286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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