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.r425-tajo-167905978100351.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 ltsminxred
Input is ShieldRVt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 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.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 1.3M 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679313524049

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:58:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:58:46] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-03-20 11:58:46] [INFO ] Transformed 5003 places.
[2023-03-20 11:58:46] [INFO ] Transformed 5003 transitions.
[2023-03-20 11:58:46] [INFO ] Found NUPN structural information;
[2023-03-20 11:58:46] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 5003 rows 5003 cols
[2023-03-20 11:58:47] [INFO ] Computed 401 place invariants in 48 ms
[2023-03-20 11:58:50] [INFO ] After 2408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 11:58:52] [INFO ] [Nat]Absence check using 401 positive place invariants in 233 ms returned sat
[2023-03-20 11:59:15] [INFO ] After 22220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:59:15] [INFO ] After 22227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 11:59:15] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 261 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions removed 1347 transitions
Trivial Post-agglo rules discarded 1347 transitions
Performed 1347 trivial Post agglomeration. Transition count delta: 1347
Iterating post reduction 0 with 1347 rules applied. Total rules applied 1347 place count 5003 transition count 3656
Reduce places removed 1347 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1349 rules applied. Total rules applied 2696 place count 3656 transition count 3654
Reduce places removed 1 places and 0 transitions.
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Iterating post reduction 2 with 94 rules applied. Total rules applied 2790 place count 3655 transition count 3561
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 2883 place count 3562 transition count 3561
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 413 Pre rules applied. Total rules applied 2883 place count 3562 transition count 3148
Deduced a syphon composed of 413 places in 11 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 3709 place count 3149 transition count 3148
Discarding 638 places :
Symmetric choice reduction at 4 with 638 rule applications. Total rules 4347 place count 2511 transition count 2510
Iterating global reduction 4 with 638 rules applied. Total rules applied 4985 place count 2511 transition count 2510
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 241 Pre rules applied. Total rules applied 4985 place count 2511 transition count 2269
Deduced a syphon composed of 241 places in 18 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 4 with 482 rules applied. Total rules applied 5467 place count 2270 transition count 2269
Performed 823 Post agglomeration using F-continuation condition.Transition count delta: 823
Deduced a syphon composed of 823 places in 4 ms
Reduce places removed 823 places and 0 transitions.
Iterating global reduction 4 with 1646 rules applied. Total rules applied 7113 place count 1447 transition count 1446
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7315 place count 1346 transition count 1519
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7517 place count 1245 transition count 1584
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 32 places in 15 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 7581 place count 1213 transition count 1611
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7582 place count 1213 transition count 1610
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 7593 place count 1213 transition count 1599
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 7604 place count 1202 transition count 1599
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 7609 place count 1202 transition count 1594
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 7613 place count 1202 transition count 1594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 7614 place count 1201 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7615 place count 1200 transition count 1593
Applied a total of 7615 rules in 2007 ms. Remains 1200 /5003 variables (removed 3803) and now considering 1593/5003 (removed 3410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2008 ms. Remains : 1200/5003 places, 1593/5003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 13) seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-02 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1593 rows 1200 cols
[2023-03-20 11:59:18] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-20 11:59:18] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 11:59:19] [INFO ] [Nat]Absence check using 400 positive place invariants in 91 ms returned sat
[2023-03-20 11:59:21] [INFO ] After 1728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 11:59:21] [INFO ] State equation strengthened by 597 read => feed constraints.
[2023-03-20 11:59:27] [INFO ] After 5969ms SMT Verify possible using 597 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 11:59:27] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 5 ms to minimize.
[2023-03-20 11:59:27] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 14 ms to minimize.
[2023-03-20 11:59:28] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2023-03-20 11:59:28] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 1 ms to minimize.
[2023-03-20 11:59:28] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-20 11:59:29] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-03-20 11:59:29] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2023-03-20 11:59:29] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2023-03-20 11:59:30] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-20 11:59:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2811 ms
[2023-03-20 11:59:32] [INFO ] Deduced a trap composed of 14 places in 535 ms of which 3 ms to minimize.
[2023-03-20 11:59:33] [INFO ] Deduced a trap composed of 12 places in 431 ms of which 1 ms to minimize.
[2023-03-20 11:59:33] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 0 ms to minimize.
[2023-03-20 11:59:34] [INFO ] Deduced a trap composed of 14 places in 414 ms of which 1 ms to minimize.
[2023-03-20 11:59:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2194 ms
[2023-03-20 11:59:35] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 1 ms to minimize.
[2023-03-20 11:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-20 11:59:36] [INFO ] Deduced a trap composed of 15 places in 357 ms of which 1 ms to minimize.
[2023-03-20 11:59:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2023-03-20 11:59:37] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2023-03-20 11:59:37] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 1 ms to minimize.
[2023-03-20 11:59:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-20 11:59:38] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-20 11:59:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-20 11:59:40] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2023-03-20 11:59:40] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2023-03-20 11:59:40] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2023-03-20 11:59:41] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2023-03-20 11:59:41] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-20 11:59:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1301 ms
[2023-03-20 11:59:41] [INFO ] After 20644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2043 ms.
[2023-03-20 11:59:43] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 435 ms.
Support contains 216 out of 1200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1200/1200 places, 1593/1593 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1200 transition count 1579
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 1186 transition count 1578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 1185 transition count 1578
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 30 place count 1185 transition count 1562
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 62 place count 1169 transition count 1562
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 116 place count 1142 transition count 1535
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 138 place count 1131 transition count 1547
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 1131 transition count 1547
Applied a total of 139 rules in 150 ms. Remains 1131 /1200 variables (removed 69) and now considering 1547/1593 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 1131/1200 places, 1547/1593 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 79514 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79514 steps, saw 50123 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1547 rows 1131 cols
[2023-03-20 11:59:48] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 11:59:48] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 11:59:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 84 ms returned sat
[2023-03-20 11:59:51] [INFO ] After 1892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 11:59:51] [INFO ] State equation strengthened by 643 read => feed constraints.
[2023-03-20 11:59:56] [INFO ] After 5202ms SMT Verify possible using 643 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 11:59:58] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-20 11:59:58] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2023-03-20 11:59:58] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-03-20 11:59:59] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2023-03-20 11:59:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1033 ms
[2023-03-20 12:00:00] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2023-03-20 12:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 483 ms
[2023-03-20 12:00:02] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2023-03-20 12:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-20 12:00:05] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-20 12:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-20 12:00:05] [INFO ] After 14501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 7377 ms.
[2023-03-20 12:00:13] [INFO ] After 24325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 350 ms.
Support contains 216 out of 1131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 1547/1547 transitions.
Applied a total of 0 rules in 77 ms. Remains 1131 /1131 variables (removed 0) and now considering 1547/1547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1131/1131 places, 1547/1547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 1547/1547 transitions.
Applied a total of 0 rules in 59 ms. Remains 1131 /1131 variables (removed 0) and now considering 1547/1547 (removed 0) transitions.
[2023-03-20 12:00:13] [INFO ] Invariant cache hit.
[2023-03-20 12:00:14] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-20 12:00:14] [INFO ] Invariant cache hit.
[2023-03-20 12:00:15] [INFO ] State equation strengthened by 643 read => feed constraints.
[2023-03-20 12:00:20] [INFO ] Implicit Places using invariants and state equation in 6089 ms returned []
Implicit Place search using SMT with State Equation took 6998 ms to find 0 implicit places.
[2023-03-20 12:00:20] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-20 12:00:20] [INFO ] Invariant cache hit.
[2023-03-20 12:00:21] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8024 ms. Remains : 1131/1131 places, 1547/1547 transitions.
Graph (trivial) has 251 edges and 1131 vertex of which 2 / 1131 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1129 transition count 1543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1129 transition count 1542
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1128 transition count 1542
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 1127 transition count 1541
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 72 place count 1127 transition count 1477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 1126 transition count 1477
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 133 place count 1126 transition count 1477
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 174 place count 1126 transition count 1436
Applied a total of 174 rules in 148 ms. Remains 1126 /1131 variables (removed 5) and now considering 1436/1547 (removed 111) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1436 rows 1126 cols
[2023-03-20 12:00:21] [INFO ] Computed 398 place invariants in 6 ms
[2023-03-20 12:00:22] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 12:00:22] [INFO ] [Nat]Absence check using 398 positive place invariants in 88 ms returned sat
[2023-03-20 12:00:24] [INFO ] After 1780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 12:00:25] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-20 12:00:25] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-20 12:00:25] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-20 12:00:25] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2023-03-20 12:00:25] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-20 12:00:26] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-20 12:00:26] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2023-03-20 12:00:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1379 ms
[2023-03-20 12:00:26] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2023-03-20 12:00:26] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-20 12:00:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1172 ms
[2023-03-20 12:00:27] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-20 12:00:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 511 ms
[2023-03-20 12:00:29] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-20 12:00:30] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-20 12:00:30] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2023-03-20 12:00:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2023-03-20 12:00:30] [INFO ] After 7495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1526 ms.
[2023-03-20 12:00:32] [INFO ] After 9621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-20 12:00:32] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 12:00:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1131 places, 1547 transitions and 7591 arcs took 14 ms.
[2023-03-20 12:00:32] [INFO ] Flatten gal took : 301 ms
Total runtime 106788 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/681/inv_0_ --invariant=/tmp/681/inv_1_ --invariant=/tmp/681/inv_2_ --invariant=/tmp/681/inv_3_ --invariant=/tmp/681/inv_4_ --invariant=/tmp/681/inv_5_ --invariant=/tmp/681/inv_6_ --invariant=/tmp/681/inv_7_ --invariant=/tmp/681/inv_8_ --invariant=/tmp/681/inv_9_ --invariant=/tmp/681/inv_10_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12367364 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096264 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-100B, 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 r425-tajo-167905978100351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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