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.r459-smll-167912651200406.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 StigmergyCommit-PT-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651200406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 231K 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 StigmergyCommit-PT-02b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679345972796

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=StigmergyCommit-PT-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 20:59:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 20:59:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:59:36] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-20 20:59:36] [INFO ] Transformed 928 places.
[2023-03-20 20:59:36] [INFO ] Transformed 1040 transitions.
[2023-03-20 20:59:36] [INFO ] Found NUPN structural information;
[2023-03-20 20:59:36] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 164 resets, run finished after 1310 ms. (steps per millisecond=7 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 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 40 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 40 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1040 rows 928 cols
[2023-03-20 20:59:39] [INFO ] Computed 4 place invariants in 42 ms
[2023-03-20 20:59:40] [INFO ] After 1037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 20:59:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 20:59:42] [INFO ] After 1457ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 401 places in 935 ms of which 25 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1114 ms
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 396 places in 490 ms of which 2 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 397 places in 490 ms of which 3 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 654 ms
[2023-03-20 20:59:46] [INFO ] After 5038ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 857 ms.
[2023-03-20 20:59:47] [INFO ] After 6873ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 194 ms.
Support contains 81 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 750 edges and 928 vertex of which 36 / 928 are part of one of the 7 SCC in 11 ms
Free SCC test removed 29 places
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 1205 edges and 899 vertex of which 894 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 894 transition count 478
Reduce places removed 521 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 526 rules applied. Total rules applied 1051 place count 373 transition count 473
Reduce places removed 2 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 58 rules applied. Total rules applied 1109 place count 371 transition count 417
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1165 place count 315 transition count 417
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1165 place count 315 transition count 379
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1241 place count 277 transition count 379
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1274 place count 244 transition count 346
Iterating global reduction 4 with 33 rules applied. Total rules applied 1307 place count 244 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1308 place count 244 transition count 345
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1308 place count 244 transition count 343
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1312 place count 242 transition count 343
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1321 place count 233 transition count 300
Iterating global reduction 5 with 9 rules applied. Total rules applied 1330 place count 233 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1331 place count 232 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 1332 place count 232 transition count 299
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1333 place count 231 transition count 298
Iterating global reduction 5 with 1 rules applied. Total rules applied 1334 place count 231 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1335 place count 231 transition count 297
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1363 place count 217 transition count 283
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1366 place count 214 transition count 280
Iterating global reduction 6 with 3 rules applied. Total rules applied 1369 place count 214 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1381 place count 208 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1383 place count 208 transition count 303
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1386 place count 208 transition count 300
Free-agglomeration rule applied 22 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1408 place count 208 transition count 276
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1432 place count 186 transition count 274
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1433 place count 186 transition count 273
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1435 place count 186 transition count 273
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1436 place count 186 transition count 272
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1437 place count 186 transition count 272
Applied a total of 1437 rules in 360 ms. Remains 186 /928 variables (removed 742) and now considering 272/1040 (removed 768) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 186/928 places, 272/1040 transitions.
Incomplete random walk after 10000 steps, including 926 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 9) seen :3
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 172 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 272 rows 186 cols
[2023-03-20 20:59:48] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-20 20:59:48] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 20:59:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 20:59:48] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 20:59:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-20 20:59:49] [INFO ] After 124ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-20 20:59:49] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-20 20:59:49] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 20 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 272/272 transitions.
Graph (trivial) has 164 edges and 186 vertex of which 17 / 186 are part of one of the 5 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 345 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 173 transition count 167
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 98 rules applied. Total rules applied 185 place count 89 transition count 153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 188 place count 86 transition count 153
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 188 place count 86 transition count 145
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 204 place count 78 transition count 145
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 217 place count 65 transition count 132
Iterating global reduction 3 with 13 rules applied. Total rules applied 230 place count 65 transition count 132
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 236 place count 59 transition count 125
Iterating global reduction 3 with 6 rules applied. Total rules applied 242 place count 59 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 246 place count 55 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 55 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 54 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 54 transition count 120
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 262 place count 49 transition count 113
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 268 place count 49 transition count 107
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 274 place count 43 transition count 101
Iterating global reduction 4 with 6 rules applied. Total rules applied 280 place count 43 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 284 place count 43 transition count 97
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 288 place count 39 transition count 93
Iterating global reduction 5 with 4 rules applied. Total rules applied 292 place count 39 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 298 place count 39 transition count 87
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 36 transition count 84
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 36 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 312 place count 36 transition count 76
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 317 place count 36 transition count 71
Free-agglomeration rule applied 15 times with reduction of 4 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 332 place count 36 transition count 52
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 356 place count 21 transition count 43
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 359 place count 18 transition count 40
Iterating global reduction 8 with 3 rules applied. Total rules applied 362 place count 18 transition count 40
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 368 place count 18 transition count 34
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 371 place count 18 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 373 place count 18 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 374 place count 18 transition count 31
Applied a total of 374 rules in 78 ms. Remains 18 /186 variables (removed 168) and now considering 31/272 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 18/186 places, 31/272 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13253 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 02b
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: 928 places, 1040 transitions, 2439 arcs.
Final Score: 51071.368
Took : 34 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-00 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P293)) ) & ( (! ( ( (! ( ( 1 ) <= (tk(P833)) )) | (! ( (tk(P72)) <= ( 1 ) )) ) | ( ( ( (tk(P584)) <= ( 1 ) ) & ( (tk(P219)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P857)) ) ) )) | ( ( ( 1 ) <= (tk(P648)) ) | ( (! ( ( 1 ) <= (tk(P339)) )) & ( ( 1 ) <= (tk(P882)) ) ) ) ) ))))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P895)) <= (tk(P827)) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-02 (reachable & potential((! ( ( (tk(P748)) <= ( 1 ) ) | ( (tk(P797)) <= (tk(P751)) ) ))))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( ( (tk(P637)) <= ( 1 ) ) & ( (tk(P356)) <= ( 0 ) ) ) & ( (tk(P80)) <= (tk(P825)) ) ) | ( ( (tk(P364)) <= ( 0 ) ) | (! ( (tk(P263)) <= ( 0 ) )) ) ) | ( ( ( (tk(P244)) <= ( 1 ) ) & ( (tk(P208)) <= (tk(P129)) ) ) & (! ( ( ( (! ( ( (tk(P856)) <= ( 1 ) ) | ( (tk(P210)) <= ( 0 ) ) )) | ( ( ( ( (tk(P138)) <= ( 0 ) ) | ( (tk(P329)) <= (tk(P871)) ) ) & ( ( ( 1 ) <= (tk(P461)) ) & ( (tk(P884)) <= (tk(P231)) ) ) ) | ( ( (tk(P320)) <= (tk(P917)) ) & ( ( (tk(P488)) <= ( 1 ) ) & ( (tk(P885)) <= (tk(P858)) ) ) ) ) ) | (! ( ( (tk(P14)) <= (tk(P651)) ) & ( ( 1 ) <= (tk(P466)) ) )) ) | ( ( 1 ) <= (tk(P626)) ) )) ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-04 (reachable &!potential( ( ( (tk(P842)) <= ( 0 ) ) & ( ( (! ( ( (! ( ( (tk(P400)) <= ( 0 ) ) | ( (tk(P1)) <= (tk(P663)) ) )) & ( ( (tk(P91)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P542)) )) ) ) & ( (tk(P895)) <= (tk(P731)) ) )) & ( (! ( (tk(P733)) <= ( 0 ) )) | ( ( ( ( (! ( ( 1 ) <= (tk(P728)) )) & ( ( (tk(P376)) <= ( 1 ) ) | ( (tk(P807)) <= ( 0 ) ) ) ) | ( (! ( ( 1 ) <= (tk(P867)) )) | ( (tk(P710)) <= (tk(P277)) ) ) ) & (! ( (tk(P207)) <= ( 1 ) )) ) | (! ( ( (! ( (tk(P517)) <= (tk(P477)) )) | ( ( (tk(P294)) <= ( 1 ) ) | ( (tk(P118)) <= ( 0 ) ) ) ) | ( ( (tk(P441)) <= ( 1 ) ) & (! ( (tk(P405)) <= ( 1 ) )) ) )) ) ) ) | ( (! ( ( 1 ) <= (tk(P314)) )) | (! ( ( ( ( (tk(P479)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P760)) ) ) | ( (tk(P41)) <= (tk(P106)) ) ) | ( (! ( ( (tk(P554)) <= ( 1 ) ) & (! ( (tk(P313)) <= (tk(P848)) )) )) & (! ( ( ( ( 1 ) <= (tk(P659)) ) | ( (tk(P391)) <= (tk(P816)) ) ) | ( ( (tk(P188)) <= (tk(P642)) ) & ( (tk(P368)) <= (tk(P699)) ) ) )) ) )) ) ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P887)) <= ( 0 ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-06 (reachable & potential(( ( ( ( (! ( (! ( ( ( (tk(P874)) <= (tk(P588)) ) | ( (tk(P241)) <= (tk(P24)) ) ) & (! ( (tk(P444)) <= (tk(P256)) )) )) | ( ( (! ( ( 1 ) <= (tk(P658)) )) & (! ( (tk(P253)) <= (tk(P7)) )) ) & (! ( ( ( 1 ) <= (tk(P171)) ) | ( ( 1 ) <= (tk(P679)) ) )) ) )) & ( ( ( ( (tk(P671)) <= (tk(P257)) ) | ( ( 1 ) <= (tk(P431)) ) ) | ( (tk(P856)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P922)) ) ) ) | ( ( ( ( (tk(P564)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P693)) )) ) & ( (tk(P433)) <= ( 1 ) ) ) | ( (! ( (tk(P146)) <= ( 0 ) )) | ( ( (tk(P536)) <= ( 0 ) ) & (! ( ( ( ( 1 ) <= (tk(P274)) ) | ( (tk(P849)) <= (tk(P847)) ) ) & ( ( (tk(P544)) <= ( 1 ) ) | ( (tk(P621)) <= (tk(P172)) ) ) )) ) ) ) ) | (! ( (! ( ( 1 ) <= (tk(P838)) )) & ( (! ( ( (tk(P228)) <= ( 1 ) ) | (! ( ( (tk(P400)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P571)) ) )) )) & ( ( 1 ) <= (tk(P20)) ) ) )) ) & (! ( (! ( ( ( ( (! ( ( 1 ) <= (tk(P364)) )) | ( ( ( 1 ) <= (tk(P659)) ) & ( ( 1 ) <= (tk(P470)) ) ) ) & ( (tk(P645)) <= ( 1 ) ) ) | ( (tk(P52)) <= ( 0 ) ) ) | (! ( (tk(P708)) <= (tk(P148)) )) )) | ( ( ( ( ( (! ( ( 1 ) <= (tk(P494)) )) | (! ( ( 1 ) <= (tk(P835)) )) ) | ( ( ( (tk(P83)) <= (tk(P844)) ) & ( (tk(P868)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) & (! ( ( ( (tk(P392)) <= ( 0 ) ) & ( (tk(P321)) <= ( 1 ) ) ) | (! ( (tk(P476)) <= ( 1 ) )) )) ) & (! ( (tk(P489)) <= ( 0 ) )) ) | (! ( ( 1 ) <= (tk(P513)) )) ) )) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-07 (reachable & potential(( ( 1 ) <= (tk(P532)) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-08 (reachable & potential(( ( 1 ) <= (tk(P736)) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-09 (reachable & potential(( (! ( (! ( ( ( (tk(P753)) <= (tk(P599)) ) | ( (tk(P502)) <= (tk(P312)) ) ) | ( ( 1 ) <= (tk(P788)) ) )) | ( ( (tk(P359)) <= (tk(P395)) ) | ( ( ( (tk(P716)) <= (tk(P532)) ) | ( ( 1 ) <= (tk(P656)) ) ) | ( (! ( ( (tk(P314)) <= (tk(P615)) ) & ( (tk(P727)) <= (tk(P710)) ) )) | (! ( ( ( ( 1 ) <= (tk(P700)) ) & ( ( 1 ) <= (tk(P178)) ) ) | ( ( ( 1 ) <= (tk(P813)) ) & ( (tk(P921)) <= (tk(P77)) ) ) )) ) ) ) )) & ( ( 1 ) <= (tk(P916)) ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-10 (reachable & potential((! ( (! ( ( 1 ) <= (tk(P908)) )) | ( (tk(P274)) <= ( 1 ) ) ))))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-11 (reachable & potential((! ( (! ( (! ( ( ( ( 1 ) <= (tk(P435)) ) & (! ( (tk(P540)) <= ( 0 ) )) ) & ( (tk(P424)) <= ( 0 ) ) )) & ( ( ( ( ( (tk(P638)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P840)) ) ) & ( ( (tk(P612)) <= (tk(P387)) ) | ( (tk(P792)) <= (tk(P260)) ) ) ) | ( (tk(P837)) <= (tk(P690)) ) ) & (! ( ( ( ( 1 ) <= (tk(P688)) ) & ( (tk(P67)) <= (tk(P487)) ) ) | ( (tk(P458)) <= (tk(P749)) ) )) ) )) | (! ( ( ( (tk(P538)) <= (tk(P353)) ) | ( ( ( 1 ) <= (tk(P283)) ) | ( ( 1 ) <= (tk(P713)) ) ) ) & ( ( ( (tk(P54)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P824)) ) ) | ( ( ( 1 ) <= (tk(P821)) ) | ( (tk(P85)) <= ( 1 ) ) ) ) )) ))))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P750)) <= ( 0 ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-13 (reachable &!potential( ( ( (tk(P138)) <= ( 1 ) ) | ( (tk(P840)) <= ( 0 ) ) )))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-14 (reachable & potential((! ( (tk(P528)) <= (tk(P421)) ))))
PROPERTY: StigmergyCommit-PT-02b-ReachabilityCardinality-15 (reachable & potential(( ( ( (! ( ( 1 ) <= (tk(P393)) )) | ( ( (tk(P225)) <= (tk(P381)) ) | (! ( (! ( ( ( ( 1 ) <= (tk(P314)) ) | ( ( 1 ) <= (tk(P482)) ) ) | (! ( (tk(P649)) <= (tk(P794)) )) )) & ( (tk(P766)) <= (tk(P585)) ) )) ) ) & ( ( ( 1 ) <= (tk(P6)) ) & ( ( 1 ) <= (tk(P353)) ) ) ) & ( ( 1 ) <= (tk(P418)) ) )))
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679346185386

--------------------
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 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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, 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 r459-smll-167912651200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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 ;