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-167903718600270.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 ShieldIIPt-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-167903718600270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 167K 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 ShieldIIPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679560427992

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=ShieldIIPt-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:33:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:33:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:33:51] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-23 08:33:51] [INFO ] Transformed 703 places.
[2023-03-23 08:33:51] [INFO ] Transformed 653 transitions.
[2023-03-23 08:33:51] [INFO ] Found NUPN structural information;
[2023-03-23 08:33:51] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 14) seen :7
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-23 08:33:52] [INFO ] Computed 91 place invariants in 20 ms
[2023-03-23 08:33:53] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:33:53] [INFO ] [Nat]Absence check using 91 positive place invariants in 21 ms returned sat
[2023-03-23 08:33:54] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-23 08:33:54] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 9 ms to minimize.
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-23 08:33:55] [INFO ] Deduced a trap composed of 22 places in 405 ms of which 4 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 1 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 41 ms to minimize.
[2023-03-23 08:33:56] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 3 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-23 08:33:57] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 0 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2023-03-23 08:33:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3863 ms
[2023-03-23 08:33:58] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2023-03-23 08:33:59] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 1 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 0 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-23 08:34:00] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 0 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2023-03-23 08:34:01] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-23 08:34:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3934 ms
[2023-03-23 08:34:02] [INFO ] Deduced a trap composed of 21 places in 324 ms of which 1 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 0 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 13 ms to minimize.
[2023-03-23 08:34:03] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 0 ms to minimize.
[2023-03-23 08:34:04] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 0 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 14 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-23 08:34:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2968 ms
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 1 ms to minimize.
[2023-03-23 08:34:06] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 0 ms to minimize.
[2023-03-23 08:34:07] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2789 ms
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2023-03-23 08:34:08] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2023-03-23 08:34:09] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 1 ms to minimize.
[2023-03-23 08:34:09] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2023-03-23 08:34:10] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2023-03-23 08:34:10] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2023-03-23 08:34:10] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2023-03-23 08:34:10] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-23 08:34:11] [INFO ] Deduced a trap composed of 29 places in 637 ms of which 1 ms to minimize.
[2023-03-23 08:34:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2403 ms
[2023-03-23 08:34:11] [INFO ] After 18045ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-23 08:34:12] [INFO ] After 18803ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 224 ms.
Support contains 105 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 703 transition count 553
Reduce places removed 100 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 102 rules applied. Total rules applied 202 place count 603 transition count 551
Reduce places removed 1 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 218 place count 602 transition count 536
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 233 place count 587 transition count 536
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 233 place count 587 transition count 488
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 329 place count 539 transition count 488
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 380 place count 488 transition count 437
Iterating global reduction 4 with 51 rules applied. Total rules applied 431 place count 488 transition count 437
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 431 place count 488 transition count 418
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 469 place count 469 transition count 418
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 723 place count 342 transition count 291
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 755 place count 326 transition count 295
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 760 place count 326 transition count 290
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 765 place count 321 transition count 290
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 770 place count 321 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 771 place count 320 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 773 place count 318 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 773 place count 318 transition count 288
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 775 place count 317 transition count 288
Applied a total of 775 rules in 213 ms. Remains 317 /703 variables (removed 386) and now considering 288/653 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 317/703 places, 288/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 288 rows 317 cols
[2023-03-23 08:34:12] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-23 08:34:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:34:13] [INFO ] [Nat]Absence check using 89 positive place invariants in 13 ms returned sat
[2023-03-23 08:34:13] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-23 08:34:13] [INFO ] After 191ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:34:13] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 15 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 833 ms
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-23 08:34:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 392 ms
[2023-03-23 08:34:15] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-23 08:34:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-23 08:34:15] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-23 08:34:15] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-23 08:34:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2023-03-23 08:34:15] [INFO ] After 2257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-23 08:34:15] [INFO ] After 2833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 60 ms.
Support contains 55 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 288/288 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 317 transition count 275
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 304 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 301 transition count 272
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 32 place count 301 transition count 264
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 48 place count 293 transition count 264
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 290 transition count 261
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 290 transition count 261
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 102 place count 266 transition count 237
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 260 transition count 239
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 260 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 258 transition count 237
Applied a total of 118 rules in 90 ms. Remains 258 /317 variables (removed 59) and now considering 237/288 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 258/317 places, 237/288 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 237 rows 258 cols
[2023-03-23 08:34:16] [INFO ] Computed 89 place invariants in 3 ms
[2023-03-23 08:34:16] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 08:34:16] [INFO ] [Nat]Absence check using 89 positive place invariants in 15 ms returned sat
[2023-03-23 08:34:16] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:34:16] [INFO ] After 124ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:16] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-23 08:34:17] [INFO ] Deduced a trap composed of 8 places in 614 ms of which 0 ms to minimize.
[2023-03-23 08:34:17] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-03-23 08:34:17] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-23 08:34:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-23 08:34:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1060 ms
[2023-03-23 08:34:18] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-03-23 08:34:18] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-23 08:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-03-23 08:34:18] [INFO ] After 1582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-23 08:34:18] [INFO ] After 2008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 54 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 237/237 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 236
Applied a total of 2 rules in 22 ms. Remains 257 /258 variables (removed 1) and now considering 236/237 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 257/258 places, 236/237 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 343260 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343260 steps, saw 205580 distinct states, run finished after 3003 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 236 rows 257 cols
[2023-03-23 08:34:21] [INFO ] Computed 89 place invariants in 3 ms
[2023-03-23 08:34:21] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 08:34:21] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2023-03-23 08:34:21] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:34:22] [INFO ] After 89ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-03-23 08:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-23 08:34:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 10 places in 529 ms of which 1 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2023-03-23 08:34:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1577 ms
[2023-03-23 08:34:23] [INFO ] After 1895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-23 08:34:23] [INFO ] After 2244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 54 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 236/236 transitions.
Applied a total of 0 rules in 12 ms. Remains 257 /257 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 257/257 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 236/236 transitions.
Applied a total of 0 rules in 9 ms. Remains 257 /257 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-23 08:34:24] [INFO ] Invariant cache hit.
[2023-03-23 08:34:24] [INFO ] Implicit Places using invariants in 190 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/257 places, 236/236 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 235
Applied a total of 2 rules in 9 ms. Remains 255 /256 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 255 cols
[2023-03-23 08:34:24] [INFO ] Computed 88 place invariants in 3 ms
[2023-03-23 08:34:24] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-23 08:34:24] [INFO ] Invariant cache hit.
[2023-03-23 08:34:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:34:24] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/257 places, 235/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 641 ms. Remains : 255/257 places, 235/236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 376189 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376189 steps, saw 213044 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 08:34:27] [INFO ] Invariant cache hit.
[2023-03-23 08:34:27] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 08:34:28] [INFO ] [Nat]Absence check using 88 positive place invariants in 19 ms returned sat
[2023-03-23 08:34:28] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:34:28] [INFO ] After 81ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:28] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-23 08:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-23 08:34:28] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-23 08:34:28] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-23 08:34:28] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2023-03-23 08:34:29] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2023-03-23 08:34:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 424 ms
[2023-03-23 08:34:29] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-23 08:34:29] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 54 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 235/235 transitions.
Applied a total of 0 rules in 13 ms. Remains 255 /255 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 255/255 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 235/235 transitions.
Applied a total of 0 rules in 21 ms. Remains 255 /255 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2023-03-23 08:34:29] [INFO ] Invariant cache hit.
[2023-03-23 08:34:29] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-23 08:34:29] [INFO ] Invariant cache hit.
[2023-03-23 08:34:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:34:30] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-23 08:34:30] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 08:34:30] [INFO ] Invariant cache hit.
[2023-03-23 08:34:30] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 958 ms. Remains : 255/255 places, 235/235 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 255 transition count 235
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 255 transition count 234
Applied a total of 18 rules in 19 ms. Remains 255 /255 variables (removed 0) and now considering 234/235 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 234 rows 255 cols
[2023-03-23 08:34:30] [INFO ] Computed 88 place invariants in 1 ms
[2023-03-23 08:34:30] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 08:34:30] [INFO ] [Nat]Absence check using 88 positive place invariants in 12 ms returned sat
[2023-03-23 08:34:30] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:30] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-23 08:34:30] [INFO ] After 64ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:30] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-23 08:34:30] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 839 ms
[2023-03-23 08:34:31] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-23 08:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-23 08:34:31] [INFO ] After 1103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-23 08:34:31] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 08:34:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-23 08:34:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 255 places, 235 transitions and 922 arcs took 4 ms.
[2023-03-23 08:34:32] [INFO ] Flatten gal took : 55 ms
Total runtime 40737 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (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: 255 places, 235 transitions, 922 arcs.
Final Score: 2312.888
Took : 8 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-010B-ReachabilityCardinality-08 (reachable & potential(( ( ( ( (tk(P109)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P109)) ) ) & ( ( (tk(P204)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P204)) ) ) ) & ( ( ( (tk(P46)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P46)) ) ) & ( ( ( ( (tk(P198)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P198)) ) ) | ( ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) | ( ( ( ( (tk(P126)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P126)) ) ) | ( ( (tk(P187)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P187)) ) ) ) & ( ( ( ( (tk(P98)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P98)) ) ) | ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) ) | ( ( ( ( (tk(P130)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P130)) ) ) & ( ( (tk(P104)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P104)) ) ) ) | ( ( ( (tk(P90)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P90)) ) ) & ( ( ( (tk(P231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P231)) ) ) & ( ( ( (tk(P177)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P177)) ) ) | ( ( ( (tk(P226)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P226)) ) ) & ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) ) ) ) ) ) ) ) ) & ( ( ( (tk(P74)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P74)) ) ) | ( ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) | ( ( ( ( (tk(P252)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P252)) ) ) & ( ( (tk(P80)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P80)) ) ) ) & ( ( ( (tk(P126)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P126)) ) ) & ( ( (tk(P246)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P246)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-010B-ReachabilityCardinality-15 (reachable & potential(( ( ( ( ( (tk(P218)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P218)) ) ) & ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) & ( ( ( (tk(P186)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P186)) ) ) & ( ( (tk(P82)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P82)) ) ) ) ) & ( ( ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) & ( ( ( (tk(P249)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P249)) ) ) | ( ( (tk(P212)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P212)) ) ) ) ) & ( ( ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) | ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( ( (tk(P144)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P144)) ) ) | ( ( ( (tk(P171)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P171)) ) ) | ( ( ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P85)) ) ) ) & ( ( ( (tk(P30)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P30)) ) ) | ( ( ( ( (tk(P214)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P214)) ) ) & ( ( (tk(P181)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P181)) ) ) ) | ( ( ( (tk(P184)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P184)) ) ) & ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) | ( ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) & ( ( ( ( (tk(P175)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P175)) ) ) | ( ( ( (tk(P178)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P178)) ) ) & ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P95)) ) ) ) ) & ( ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) | ( ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) | ( ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) & ( ( ( (tk(P252)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P252)) ) ) | ( ( (tk(P129)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P129)) ) ) ) ) ) ) ) ) ) & ( ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) | ( ( ( ( (tk(P229)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P229)) ) ) & ( ( (tk(P140)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P140)) ) ) ) | ( ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P132)) ) ) & ( ( ( (tk(P115)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P115)) ) ) | ( ( ( (tk(P173)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P173)) ) ) & ( ( (tk(P76)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P76)) ) ) ) ) ) ) ) ) ) ) )))
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679560481902

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

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="ShieldIIPt-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 ShieldIIPt-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-167903718600270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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