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.r457-smll-167912649300406.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 ltsminxred
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 r457-smll-167912649300406
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:53:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:53:43] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-21 21:53:43] [INFO ] Transformed 928 places.
[2023-03-21 21:53:43] [INFO ] Transformed 1040 transitions.
[2023-03-21 21:53:43] [INFO ] Found NUPN structural information;
[2023-03-21 21:53:43] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 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 161 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 13) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
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 10001 steps, including 42 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1040 rows 928 cols
[2023-03-21 21:53:45] [INFO ] Computed 4 place invariants in 44 ms
[2023-03-21 21:53:46] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 21:53:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-21 21:53:48] [INFO ] After 1124ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-21 21:53:49] [INFO ] Deduced a trap composed of 401 places in 536 ms of which 36 ms to minimize.
[2023-03-21 21:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 653 ms
[2023-03-21 21:53:49] [INFO ] Deduced a trap composed of 396 places in 338 ms of which 2 ms to minimize.
[2023-03-21 21:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-21 21:53:50] [INFO ] Deduced a trap composed of 397 places in 335 ms of which 2 ms to minimize.
[2023-03-21 21:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-21 21:53:51] [INFO ] After 3449ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 563 ms.
[2023-03-21 21:53:51] [INFO ] After 4788ms 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 97 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 8 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.4 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 1 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 1 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 269 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 270 ms. Remains : 186/928 places, 272/1040 transitions.
Incomplete random walk after 10000 steps, including 905 resets, run finished after 204 ms. (steps per millisecond=49 ) 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 170 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 272 rows 186 cols
[2023-03-21 21:53:52] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 21:53:52] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 21:53:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 21:53:52] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 21:53:52] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-21 21:53:52] [INFO ] After 94ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 21:53:53] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2023-03-21 21:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-21 21:53:53] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-21 21:53:53] [INFO ] After 672ms 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-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 10 ms.
Support contains 15 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 272/272 transitions.
Graph (trivial) has 133 edges and 186 vertex of which 13 / 186 are part of one of the 4 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 351 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 176 transition count 197
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 66 rules applied. Total rules applied 129 place count 116 transition count 191
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 115 transition count 187
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 111 transition count 187
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 138 place count 111 transition count 178
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 156 place count 102 transition count 178
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 166 place count 92 transition count 168
Iterating global reduction 4 with 10 rules applied. Total rules applied 176 place count 92 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 178 place count 92 transition count 166
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 181 place count 89 transition count 163
Iterating global reduction 5 with 3 rules applied. Total rules applied 184 place count 89 transition count 163
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 187 place count 86 transition count 160
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 86 transition count 160
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 202 place count 80 transition count 152
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 207 place count 80 transition count 147
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 212 place count 75 transition count 142
Iterating global reduction 6 with 5 rules applied. Total rules applied 217 place count 75 transition count 142
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 221 place count 71 transition count 138
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 71 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 231 place count 71 transition count 132
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 234 place count 68 transition count 129
Iterating global reduction 7 with 3 rules applied. Total rules applied 237 place count 68 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 245 place count 68 transition count 121
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 253 place count 68 transition count 113
Free-agglomeration rule applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 270 place count 68 transition count 92
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 288 place count 51 transition count 91
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 291 place count 48 transition count 88
Iterating global reduction 9 with 3 rules applied. Total rules applied 294 place count 48 transition count 88
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 302 place count 48 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 304 place count 48 transition count 80
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 305 place count 48 transition count 79
Applied a total of 305 rules in 64 ms. Remains 48 /186 variables (removed 138) and now considering 79/272 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 48/186 places, 79/272 transitions.
Finished random walk after 667 steps, including 31 resets, run visited all 2 properties in 4 ms. (steps per millisecond=166 )
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10188 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/475/inv_0_ --invariant=/tmp/475/inv_1_ --invariant=/tmp/475/inv_2_ --invariant=/tmp/475/inv_3_ --invariant=/tmp/475/inv_4_ --invariant=/tmp/475/inv_5_ --invariant=/tmp/475/inv_6_ --invariant=/tmp/475/inv_7_ --invariant=/tmp/475/inv_8_ --invariant=/tmp/475/inv_9_ --invariant=/tmp/475/inv_10_ --invariant=/tmp/475/inv_11_ --invariant=/tmp/475/inv_12_ --invariant=/tmp/475/inv_13_ --invariant=/tmp/475/inv_14_ --invariant=/tmp/475/inv_15_ --inv-par
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679435647968

--------------------
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
mcc2023
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_0_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_1_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_2_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_3_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_4_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_5_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_6_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_7_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_8_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_9_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_10_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_11_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_12_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_13_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_14_
rfs formula name StigmergyCommit-PT-02b-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 928 places, 1040 transitions and 2439 arcs
pnml2lts-sym: Petri net StigmergyCommit-PT-02b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1040->1040 groups
pnml2lts-sym: Regrouping took 0.520 real 0.520 user 0.010 sys
pnml2lts-sym: state vector length is 928; there are 1040 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 899263 group checks and 0 next state calls
pnml2lts-sym: reachability took 12.190 real 48.430 user 0.230 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.060 user 0.000 sys
pnml2lts-sym: state space has 192124708 states, 59759 nodes
pnml2lts-sym: group_next: 4697 nodes total
pnml2lts-sym: group_explored: 2436 nodes, 2560 short vectors total
pnml2lts-sym: max token count: 1

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r457-smll-167912649300406"
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 ;