Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903719000622.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719000622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 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.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 185K 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 ShieldPPPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679574185933

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 12:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:23:08] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-23 12:23:08] [INFO ] Transformed 783 places.
[2023-03-23 12:23:08] [INFO ] Transformed 713 transitions.
[2023-03-23 12:23:08] [INFO ] Found NUPN structural information;
[2023-03-23 12:23:08] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 13) seen :8
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 713 rows 783 cols
[2023-03-23 12:23:09] [INFO ] Computed 111 place invariants in 15 ms
[2023-03-23 12:23:09] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 12:23:09] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2023-03-23 12:23:10] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 12:23:11] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 29 ms to minimize.
[2023-03-23 12:23:11] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2023-03-23 12:23:12] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 13 ms to minimize.
[2023-03-23 12:23:12] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 4 ms to minimize.
[2023-03-23 12:23:12] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-23 12:23:12] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 0 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-23 12:23:13] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-23 12:23:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2958 ms
[2023-03-23 12:23:14] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2023-03-23 12:23:14] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-23 12:23:14] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-23 12:23:14] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2023-03-23 12:23:15] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:23:15] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2023-03-23 12:23:15] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-23 12:23:15] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2023-03-23 12:23:16] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-23 12:23:16] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 14 ms to minimize.
[2023-03-23 12:23:16] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-23 12:23:16] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-23 12:23:17] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:23:17] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-23 12:23:17] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-23 12:23:17] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-23 12:23:17] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 0 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2023-03-23 12:23:18] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4820 ms
[2023-03-23 12:23:19] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2023-03-23 12:23:19] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 1 ms to minimize.
[2023-03-23 12:23:19] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-23 12:23:20] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2023-03-23 12:23:20] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2023-03-23 12:23:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1230 ms
[2023-03-23 12:23:20] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2023-03-23 12:23:20] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-23 12:23:21] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-23 12:23:22] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2023-03-23 12:23:22] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 13 ms to minimize.
[2023-03-23 12:23:22] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 2 ms to minimize.
[2023-03-23 12:23:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2275 ms
[2023-03-23 12:23:23] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2023-03-23 12:23:23] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-03-23 12:23:23] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-23 12:23:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 562 ms
[2023-03-23 12:23:23] [INFO ] After 13609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 781 ms.
[2023-03-23 12:23:24] [INFO ] After 14749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 154 ms.
Support contains 97 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 783 transition count 581
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 152 rules applied. Total rules applied 284 place count 651 transition count 561
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 303 place count 632 transition count 561
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 303 place count 632 transition count 515
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 395 place count 586 transition count 515
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 452 place count 529 transition count 458
Iterating global reduction 3 with 57 rules applied. Total rules applied 509 place count 529 transition count 458
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 509 place count 529 transition count 439
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 547 place count 510 transition count 439
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 797 place count 385 transition count 314
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 831 place count 368 transition count 314
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 837 place count 368 transition count 308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 843 place count 362 transition count 308
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 860 place count 362 transition count 308
Applied a total of 860 rules in 158 ms. Remains 362 /783 variables (removed 421) and now considering 308/713 (removed 405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 362/783 places, 308/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :4
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 308 rows 362 cols
[2023-03-23 12:23:24] [INFO ] Computed 111 place invariants in 8 ms
[2023-03-23 12:23:24] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:23:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2023-03-23 12:23:25] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:23:25] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-23 12:23:25] [INFO ] After 41ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:23:25] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 24 ms to minimize.
[2023-03-23 12:23:25] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-23 12:23:25] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-23 12:23:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-23 12:23:25] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-23 12:23:25] [INFO ] After 631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 14 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 308/308 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 362 transition count 292
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 346 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 345 transition count 291
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 34 place count 345 transition count 278
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 60 place count 332 transition count 278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 63 place count 329 transition count 275
Iterating global reduction 3 with 3 rules applied. Total rules applied 66 place count 329 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 329 transition count 274
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 328 transition count 274
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 174 place count 275 transition count 221
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 269 transition count 221
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 269 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 267 transition count 219
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 204 place count 267 transition count 219
Applied a total of 204 rules in 79 ms. Remains 267 /362 variables (removed 95) and now considering 219/308 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 267/362 places, 219/308 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 6250 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=520 )
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 17503 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 010B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 783 places, 713 transitions, 1786 arcs.
Final Score: 33063.896
Took : 19 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (tk(P45)) <= ( 1 ) ) | ( ( ( (! ( ( 1 ) <= (tk(P25)) )) & ( ( (! ( (tk(P690)) <= (tk(P687)) )) & ( (! ( ( 1 ) <= (tk(P640)) )) | ( ( (tk(P565)) <= ( 1 ) ) & ( (tk(P82)) <= (tk(P468)) ) ) ) ) | ( (tk(P347)) <= (tk(P771)) ) ) ) | ( ( (! ( (! ( (tk(P12)) <= (tk(P210)) )) & ( ( ( 1 ) <= (tk(P212)) ) & ( (tk(P380)) <= ( 0 ) ) ) )) & ( (tk(P349)) <= (tk(P31)) ) ) & (! ( (! ( ( (tk(P754)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P623)) ) )) | ( (tk(P776)) <= ( 1 ) ) )) ) ) & (! ( (! ( (tk(P319)) <= ( 0 ) )) | ( (tk(P441)) <= (tk(P153)) ) )) ) ) | ( ( ( (tk(P648)) <= ( 1 ) ) & (! ( (tk(P460)) <= ( 0 ) )) ) | (! ( ( (! ( ( ( 1 ) <= (tk(P567)) ) & ( ( ( ( 1 ) <= (tk(P269)) ) | ( ( 1 ) <= (tk(P441)) ) ) & (! ( (tk(P709)) <= ( 1 ) )) ) )) & ( ( 1 ) <= (tk(P288)) ) ) & ( ( (tk(P356)) <= ( 1 ) ) & ( ( ( ( (tk(P656)) <= ( 1 ) ) & ( (tk(P680)) <= ( 1 ) ) ) | (! ( ( (tk(P537)) <= ( 0 ) ) & ( (tk(P599)) <= (tk(P152)) ) )) ) & ( ( (tk(P451)) <= (tk(P183)) ) | ( ( ( (tk(P58)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P748)) ) ) | (! ( (tk(P19)) <= ( 0 ) )) ) ) ) ) )) ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-01 (reachable & potential(( ( 1 ) <= (tk(P370)) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-02 (reachable &!potential( (! ( ( (tk(P164)) <= ( 0 ) ) & ( ( (tk(P196)) <= (tk(P23)) ) & (! ( ( (! ( ( ( (tk(P443)) <= ( 0 ) ) | ( (tk(P154)) <= ( 1 ) ) ) & ( (tk(P152)) <= ( 0 ) ) )) | ( ( ( 1 ) <= (tk(P284)) ) | ( (! ( ( 1 ) <= (tk(P370)) )) & ( (tk(P590)) <= ( 0 ) ) ) ) ) | ( (! ( (! ( ( 1 ) <= (tk(P610)) )) | ( ( (tk(P139)) <= (tk(P189)) ) | ( ( 1 ) <= (tk(P11)) ) ) )) | ( (tk(P485)) <= (tk(P545)) ) ) )) ) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P777)) <= (tk(P67)) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-04 (reachable & potential(( ( ( ( ( 1 ) <= (tk(P726)) ) & ( (! ( ( ( 1 ) <= (tk(P270)) ) | (! ( (tk(P399)) <= ( 0 ) )) )) | ( ( ( ( (! ( ( 1 ) <= (tk(P374)) )) & ( ( ( 1 ) <= (tk(P174)) ) | ( ( 1 ) <= (tk(P771)) ) ) ) & ( (! ( (tk(P675)) <= (tk(P75)) )) & (! ( ( 1 ) <= (tk(P748)) )) ) ) | (! ( (tk(P748)) <= (tk(P136)) )) ) | ( (! ( ( (tk(P253)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P171)) ) | ( (tk(P759)) <= (tk(P232)) ) ) )) & ( ( (tk(P624)) <= (tk(P731)) ) | ( ( 1 ) <= (tk(P99)) ) ) ) ) ) ) & (! ( ( ( ( (tk(P118)) <= (tk(P172)) ) & ( ( (tk(P91)) <= (tk(P135)) ) & (! ( (tk(P321)) <= ( 0 ) )) ) ) & ( ( ( 1 ) <= (tk(P455)) ) | (! ( ( 1 ) <= (tk(P757)) )) ) ) & ( (tk(P585)) <= (tk(P317)) ) )) ) | ( (! ( ( 1 ) <= (tk(P92)) )) & ( ( ( ( 1 ) <= (tk(P74)) ) | ( ( (! ( ( (tk(P696)) <= ( 0 ) ) & ( (tk(P735)) <= ( 1 ) ) )) | ( ( (tk(P265)) <= (tk(P126)) ) | (! ( ( (tk(P419)) <= (tk(P500)) ) | ( (tk(P221)) <= ( 1 ) ) )) ) ) & ( (! ( ( ( (tk(P645)) <= (tk(P644)) ) & ( (tk(P16)) <= ( 1 ) ) ) & ( ( (tk(P22)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P361)) ) ) )) | (! ( ( (tk(P627)) <= ( 1 ) ) | ( (tk(P425)) <= (tk(P116)) ) )) ) ) ) | ( ( (! ( ( ( ( (tk(P78)) <= ( 1 ) ) & ( (tk(P45)) <= ( 1 ) ) ) | ( ( (tk(P440)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P288)) ) ) ) | ( ( ( (tk(P744)) <= ( 0 ) ) & ( (tk(P193)) <= (tk(P304)) ) ) & ( (tk(P690)) <= ( 1 ) ) ) )) & ( ( (! ( (tk(P662)) <= ( 1 ) )) & (! ( (tk(P611)) <= ( 1 ) )) ) | ( ( 1 ) <= (tk(P650)) ) ) ) & ( ( 1 ) <= (tk(P762)) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P531)) <= ( 1 ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-06 (reachable & potential((! ( ( (tk(P57)) <= (tk(P217)) ) | ( ( ( ( ( ( 1 ) <= (tk(P684)) ) | (! ( ( 1 ) <= (tk(P442)) )) ) | (! ( ( ( 1 ) <= (tk(P23)) ) & ( ( (tk(P56)) <= ( 1 ) ) | ( (tk(P267)) <= (tk(P383)) ) ) )) ) & (! ( (tk(P432)) <= ( 1 ) )) ) & ( (tk(P93)) <= (tk(P421)) ) ) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P746)) <= (tk(P105)) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-08 (reachable & potential(( ( ( ( 1 ) <= (tk(P740)) ) | ( (tk(P343)) <= ( 0 ) ) ) & ( ( ( ( ( 1 ) <= (tk(P495)) ) & (! ( ( (tk(P24)) <= (tk(P364)) ) | ( ( (tk(P736)) <= (tk(P313)) ) | ( ( ( ( 1 ) <= (tk(P211)) ) | ( ( 1 ) <= (tk(P64)) ) ) | (! ( (tk(P130)) <= ( 0 ) )) ) ) )) ) & ( (tk(P68)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P660)) ) | ( (tk(P746)) <= (tk(P1)) ) ) ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-09 (reachable &!potential( (! ( ( 1 ) <= (tk(P222)) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-10 (reachable & potential(( (! ( ( ( ( ( ( ( ( 1 ) <= (tk(P645)) ) | ( ( 1 ) <= (tk(P199)) ) ) & ( ( (tk(P757)) <= (tk(P240)) ) & ( (tk(P231)) <= (tk(P118)) ) ) ) | ( ( ( (tk(P309)) <= (tk(P181)) ) | ( (tk(P751)) <= ( 0 ) ) ) & ( ( (tk(P64)) <= (tk(P391)) ) | ( (tk(P754)) <= (tk(P668)) ) ) ) ) & ( (tk(P356)) <= ( 0 ) ) ) & ( ( (! ( (tk(P260)) <= (tk(P31)) )) | ( (tk(P531)) <= (tk(P172)) ) ) & ( (! ( (tk(P598)) <= ( 0 ) )) | ( ( (tk(P385)) <= ( 0 ) ) & ( ( (tk(P124)) <= ( 0 ) ) | ( (tk(P198)) <= ( 1 ) ) ) ) ) ) ) | ( ( ( ( (tk(P281)) <= (tk(P510)) ) & ( (tk(P281)) <= (tk(P344)) ) ) | (! ( (tk(P492)) <= (tk(P407)) )) ) | ( (! ( (tk(P687)) <= ( 0 ) )) & ( ( ( ( ( 1 ) <= (tk(P2)) ) & ( (tk(P688)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P175)) ) & ( (tk(P40)) <= (tk(P96)) ) ) ) | ( ( ( (tk(P427)) <= ( 1 ) ) | ( (tk(P615)) <= (tk(P14)) ) ) & ( (tk(P652)) <= (tk(P200)) ) ) ) ) ) )) & ( ( ( ( ( ( (tk(P243)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P237)) )) ) | ( ( (tk(P95)) <= (tk(P575)) ) | (! ( (tk(P694)) <= ( 1 ) )) ) ) | (! ( ( (! ( ( (tk(P71)) <= (tk(P750)) ) | ( ( 1 ) <= (tk(P718)) ) )) & (! ( (tk(P42)) <= (tk(P72)) )) ) | ( ( (! ( (tk(P430)) <= ( 1 ) )) | (! ( (tk(P71)) <= (tk(P197)) )) ) & ( (! ( (tk(P239)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P132)) ) | ( (tk(P658)) <= ( 0 ) ) ) ) ) )) ) & ( (tk(P658)) <= (tk(P354)) ) ) | ( (tk(P523)) <= ( 0 ) ) ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-11 (reachable & potential((! ( (! ( ( 1 ) <= (tk(P393)) )) | ( ( ( ( ( ( (tk(P742)) <= ( 1 ) ) | (! ( ( 1 ) <= (tk(P774)) )) ) | ( ( ( ( 1 ) <= (tk(P449)) ) & ( (tk(P740)) <= ( 0 ) ) ) | ( (! ( (tk(P691)) <= ( 1 ) )) | (! ( (tk(P184)) <= (tk(P276)) )) ) ) ) | ( ( (tk(P608)) <= (tk(P489)) ) & ( ( 1 ) <= (tk(P657)) ) ) ) | ( ( 1 ) <= (tk(P478)) ) ) | (! ( (tk(P225)) <= ( 1 ) )) ) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-12 (reachable &!potential( (! ( (! ( (tk(P214)) <= ( 0 ) )) & (! ( ( ( ( ( (tk(P487)) <= ( 0 ) ) | ( (tk(P543)) <= (tk(P6)) ) ) & ( ( (! ( (tk(P286)) <= (tk(P572)) )) | ( ( (tk(P405)) <= (tk(P555)) ) & ( ( 1 ) <= (tk(P36)) ) ) ) & ( ( ( ( 1 ) <= (tk(P605)) ) | ( (tk(P559)) <= (tk(P49)) ) ) | ( (tk(P516)) <= ( 0 ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P61)) )) & ( ( ( (tk(P503)) <= (tk(P55)) ) & ( (tk(P768)) <= ( 1 ) ) ) | ( ( (tk(P527)) <= (tk(P2)) ) | ( (tk(P476)) <= (tk(P48)) ) ) ) ) | (! ( ( (tk(P433)) <= ( 0 ) ) & ( (tk(P757)) <= (tk(P476)) ) )) ) ) & ( ( ( ( ( 1 ) <= (tk(P32)) ) & ( ( 1 ) <= (tk(P388)) ) ) | (! ( (tk(P103)) <= ( 1 ) )) ) | ( (tk(P770)) <= ( 0 ) ) ) )) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-13 (reachable & potential((! ( (tk(P183)) <= (tk(P324)) ))))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-14 (reachable &!potential( ( ( (! ( (tk(P605)) <= ( 1 ) )) & ( ( ( ( ( 1 ) <= (tk(P568)) ) | ( (tk(P418)) <= (tk(P287)) ) ) & (! ( ( 1 ) <= (tk(P608)) )) ) & ( ( ( ( ( ( ( (tk(P1)) <= (tk(P545)) ) | ( (tk(P583)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P762)) ) | ( (tk(P702)) <= ( 0 ) ) ) ) | (! ( (tk(P443)) <= ( 0 ) )) ) & ( ( (tk(P585)) <= ( 1 ) ) & (! ( (tk(P514)) <= (tk(P623)) )) ) ) & ( ( 1 ) <= (tk(P512)) ) ) & ( ( ( 1 ) <= (tk(P338)) ) | (! ( (tk(P20)) <= ( 0 ) )) ) ) ) ) | ( (tk(P171)) <= (tk(P279)) ) )))
PROPERTY: ShieldPPPt-PT-010B-ReachabilityCardinality-15 (reachable & potential(( ( (! ( ( (! ( ( 1 ) <= (tk(P184)) )) | ( (tk(P416)) <= ( 0 ) ) ) | ( (! ( (tk(P269)) <= ( 1 ) )) & ( (tk(P495)) <= (tk(P41)) ) ) )) & ( ( (! ( ( 1 ) <= (tk(P108)) )) | ( ( ( ( (tk(P603)) <= (tk(P749)) ) | ( (tk(P562)) <= (tk(P716)) ) ) & ( ( (! ( (tk(P713)) <= (tk(P434)) )) & ( ( (tk(P632)) <= (tk(P308)) ) | ( (tk(P519)) <= ( 1 ) ) ) ) & ( (! ( (tk(P14)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P325)) ) ) ) ) & (! ( ( ( ( (tk(P738)) <= ( 0 ) ) | ( (tk(P11)) <= ( 0 ) ) ) & (! ( (tk(P704)) <= (tk(P296)) )) ) | ( (tk(P623)) <= ( 1 ) ) )) ) ) & ( (tk(P54)) <= (tk(P240)) ) ) ) & ( ( ( 1 ) <= (tk(P27)) ) | (! ( ( (! ( (! ( (tk(P246)) <= ( 1 ) )) | ( (tk(P431)) <= ( 1 ) ) )) & (! ( (tk(P672)) <= ( 1 ) )) ) & ( ( ( (! ( ( (tk(P541)) <= (tk(P716)) ) | ( ( 1 ) <= (tk(P118)) ) )) | ( (tk(P400)) <= (tk(P381)) ) ) & ( (tk(P197)) <= (tk(P733)) ) ) | ( ( ( (tk(P245)) <= (tk(P274)) ) & (! ( ( 1 ) <= (tk(P206)) )) ) & ( ( ( 1 ) <= (tk(P183)) ) & ( (! ( (tk(P271)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P726)) ) ) ) ) ) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8317508 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104720 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:
++ 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
Caught signal 15, terminating.

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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldPPPt-PT-010B, 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 r395-oct2-167903719000622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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