About the Execution of Marcie+red for StigmergyCommit-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7042.796 | 266088.00 | 291764.00 | 6450.70 | FTFTFTFFFFTTTFTF | normal |
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.r458-smll-167912650300494.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 marciexred
Input is StigmergyCommit-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650300494
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 17M 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-08a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679482391387
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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 10:53:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 10:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:53:17] [INFO ] Load time of PNML (sax parser for PT used): 1445 ms
[2023-03-22 10:53:17] [INFO ] Transformed 328 places.
[2023-03-22 10:53:17] [INFO ] Transformed 18744 transitions.
[2023-03-22 10:53:17] [INFO ] Found NUPN structural information;
[2023-03-22 10:53:18] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1743 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1308 ms. (steps per millisecond=7 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 10:53:21] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-22 10:53:21] [INFO ] Computed 10 place invariants in 51 ms
[2023-03-22 10:53:22] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-22 10:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 10:53:26] [INFO ] After 2960ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-22 10:53:26] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-22 10:53:29] [INFO ] After 2909ms SMT Verify possible using 1147 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-22 10:53:30] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 8 ms to minimize.
[2023-03-22 10:53:30] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 2 ms to minimize.
[2023-03-22 10:53:31] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 2 ms to minimize.
[2023-03-22 10:53:32] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2023-03-22 10:53:32] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 2 ms to minimize.
[2023-03-22 10:53:33] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 2 ms to minimize.
[2023-03-22 10:53:33] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2023-03-22 10:53:34] [INFO ] Deduced a trap composed of 17 places in 464 ms of which 4 ms to minimize.
[2023-03-22 10:53:34] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 1 ms to minimize.
[2023-03-22 10:53:35] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 1 ms to minimize.
[2023-03-22 10:53:35] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 1 ms to minimize.
[2023-03-22 10:53:36] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-22 10:53:36] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-22 10:53:36] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 1 ms to minimize.
[2023-03-22 10:53:37] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 0 ms to minimize.
[2023-03-22 10:53:37] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2023-03-22 10:53:37] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-22 10:53:38] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2023-03-22 10:53:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8617 ms
[2023-03-22 10:53:38] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 1 ms to minimize.
[2023-03-22 10:53:39] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2023-03-22 10:53:40] [INFO ] Deduced a trap composed of 16 places in 424 ms of which 1 ms to minimize.
[2023-03-22 10:53:40] [INFO ] Deduced a trap composed of 16 places in 442 ms of which 2 ms to minimize.
[2023-03-22 10:53:40] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-22 10:53:41] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2023-03-22 10:53:41] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-22 10:53:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3192 ms
[2023-03-22 10:53:42] [INFO ] Deduced a trap composed of 17 places in 564 ms of which 1 ms to minimize.
[2023-03-22 10:53:43] [INFO ] Deduced a trap composed of 16 places in 541 ms of which 1 ms to minimize.
[2023-03-22 10:53:43] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 1 ms to minimize.
[2023-03-22 10:53:44] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 0 ms to minimize.
[2023-03-22 10:53:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2229 ms
[2023-03-22 10:53:44] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 1 ms to minimize.
[2023-03-22 10:53:45] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 1 ms to minimize.
[2023-03-22 10:53:45] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2023-03-22 10:53:46] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 1 ms to minimize.
[2023-03-22 10:53:46] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 2 ms to minimize.
[2023-03-22 10:53:46] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2023-03-22 10:53:47] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-22 10:53:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2737 ms
[2023-03-22 10:53:47] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-22 10:53:47] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-22 10:53:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 576 ms
[2023-03-22 10:53:47] [INFO ] After 21364ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 10:53:47] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 107 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 320 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.39 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 320 transition count 1407
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 20 rules applied. Total rules applied 55 place count 309 transition count 1398
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 67 place count 306 transition count 1389
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 81 place count 297 transition count 1384
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 81 place count 297 transition count 1355
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 139 place count 268 transition count 1355
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 175 place count 232 transition count 1319
Iterating global reduction 4 with 36 rules applied. Total rules applied 211 place count 232 transition count 1319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 232 transition count 1318
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 224 place count 220 transition count 1305
Iterating global reduction 5 with 12 rules applied. Total rules applied 236 place count 220 transition count 1305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 240 place count 220 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 219 transition count 1300
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 219 transition count 1300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 244 place count 219 transition count 1298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 254 place count 214 transition count 1293
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 257 place count 211 transition count 1290
Iterating global reduction 7 with 3 rules applied. Total rules applied 260 place count 211 transition count 1290
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 279 place count 211 transition count 1271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 287 place count 207 transition count 1267
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 289 place count 205 transition count 1265
Iterating global reduction 7 with 2 rules applied. Total rules applied 291 place count 205 transition count 1265
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 300 place count 205 transition count 1256
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 309 place count 196 transition count 1256
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 311 place count 196 transition count 1256
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 196 transition count 1254
Applied a total of 313 rules in 1738 ms. Remains 196 /328 variables (removed 132) and now considering 1254/1449 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1741 ms. Remains : 196/328 places, 1254/1449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 904 ms. (steps per millisecond=11 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1254 rows 196 cols
[2023-03-22 10:53:51] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-22 10:53:51] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 10:53:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-22 10:53:52] [INFO ] After 1335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 10:53:53] [INFO ] State equation strengthened by 1123 read => feed constraints.
[2023-03-22 10:53:55] [INFO ] After 1743ms SMT Verify possible using 1123 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 15 places in 763 ms of which 1 ms to minimize.
[2023-03-22 10:53:56] [INFO ] Deduced a trap composed of 13 places in 591 ms of which 1 ms to minimize.
[2023-03-22 10:53:57] [INFO ] Deduced a trap composed of 8 places in 553 ms of which 1 ms to minimize.
[2023-03-22 10:53:57] [INFO ] Deduced a trap composed of 12 places in 500 ms of which 1 ms to minimize.
[2023-03-22 10:53:58] [INFO ] Deduced a trap composed of 10 places in 423 ms of which 1 ms to minimize.
[2023-03-22 10:53:58] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 1 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
[2023-03-22 10:53:59] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2023-03-22 10:54:00] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 0 ms to minimize.
[2023-03-22 10:54:01] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 0 ms to minimize.
[2023-03-22 10:54:01] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 0 ms to minimize.
[2023-03-22 10:54:01] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 2 ms to minimize.
[2023-03-22 10:54:02] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2023-03-22 10:54:02] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2023-03-22 10:54:02] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-22 10:54:02] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-22 10:54:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7636 ms
[2023-03-22 10:54:03] [INFO ] Deduced a trap composed of 12 places in 497 ms of which 0 ms to minimize.
[2023-03-22 10:54:04] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 2 ms to minimize.
[2023-03-22 10:54:04] [INFO ] Deduced a trap composed of 14 places in 510 ms of which 2 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2023-03-22 10:54:05] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 1 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 0 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-22 10:54:06] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2023-03-22 10:54:07] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 3 ms to minimize.
[2023-03-22 10:54:07] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-22 10:54:07] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2023-03-22 10:54:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4825 ms
[2023-03-22 10:54:08] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2023-03-22 10:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 2 ms to minimize.
[2023-03-22 10:54:09] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2023-03-22 10:54:10] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 0 ms to minimize.
[2023-03-22 10:54:10] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2023-03-22 10:54:10] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2023-03-22 10:54:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2285 ms
[2023-03-22 10:54:11] [INFO ] After 17990ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-22 10:54:11] [INFO ] After 20595ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 233 steps, including 2 resets, run visited all 4 properties in 8 ms. (steps per millisecond=29 )
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 55748 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: StigmergyCommit_PT_08a
(NrP: 328 NrTr: 18744 NrArc: 330279)
parse formulas
formulas created successfully
place and transition orderings generation:0m14.246sec
net check time: 0m 0.048sec
init dd package: 0m 3.431sec
RS generation: 0m53.597sec
-> reachability set: #nodes 201269 (2.0e+05) #states 54,098,675 (7)
starting MCC model checker
--------------------------
checking: AG [~ [1<=p217]]
normalized: ~ [E [true U 1<=p217]]
abstracting: (1<=p217)
states: 390,625 (5)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m54.088sec
checking: EF [1<=p123]
normalized: E [true U 1<=p123]
abstracting: (1<=p123)
states: 1
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.811sec
checking: AG [~ [1<=p94]]
normalized: ~ [E [true U 1<=p94]]
abstracting: (1<=p94)
states: 1
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.616sec
checking: EF [~ [p203<=p127]]
normalized: E [true U ~ [p203<=p127]]
abstracting: (p203<=p127)
states: 54,098,674 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.636sec
checking: AG [p74<=p151]
normalized: ~ [E [true U ~ [p74<=p151]]]
abstracting: (p74<=p151)
states: 53,708,050 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.670sec
checking: EF [~ [[p136<=0 & p27<=p281]]]
normalized: E [true U ~ [[p136<=0 & p27<=p281]]]
abstracting: (p27<=p281)
states: 54,098,674 (7)
abstracting: (p136<=0)
states: 54,098,674 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.832sec
checking: AG [[p79<=0 | ~ [[p183<=p257 | p110<=p79]]]]
normalized: ~ [E [true U ~ [[p79<=0 | ~ [[p183<=p257 | p110<=p79]]]]]]
abstracting: (p110<=p79)
states: 53,708,050 (7)
abstracting: (p183<=p257)
states: 53,708,050 (7)
abstracting: (p79<=0)
states: 54,033,139 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.671sec
checking: AG [~ [[p110<=p5 & [[p48<=p311 & 1<=p23] & p198<=p300]]]]
normalized: ~ [E [true U [p110<=p5 & [p198<=p300 & [p48<=p311 & 1<=p23]]]]]
abstracting: (1<=p23)
states: 1
abstracting: (p48<=p311)
states: 54,098,674 (7)
abstracting: (p198<=p300)
states: 54,098,674 (7)
abstracting: (p110<=p5)
states: 53,708,050 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.913sec
checking: AG [[p85<=p275 | [[[[[[1<=p67 & p193<=1] | [[~ [p162<=p314] & ~ [1<=p206]] & [~ [1<=p288] & ~ [1<=p199]]]] | p79<=0] & ~ [p24<=p238]] | 1<=p58] | [~ [[p103<=1 & ~ [[[p314<=p74 & p199<=p205] & 1<=p85]]]] | ~ [p326<=1]]]]]
normalized: ~ [E [true U ~ [[[[~ [p326<=1] | ~ [[~ [[[p314<=p74 & p199<=p205] & 1<=p85]] & p103<=1]]] | [[~ [p24<=p238] & [[[[~ [1<=p199] & ~ [1<=p288]] & [~ [1<=p206] & ~ [p162<=p314]]] | [1<=p67 & p193<=1]] | p79<=0]] | 1<=p58]] | p85<=p275]]]]
abstracting: (p85<=p275)
states: 54,098,674 (7)
abstracting: (1<=p58)
states: 1
abstracting: (p79<=0)
states: 54,033,139 (7)
abstracting: (p193<=1)
states: 54,098,675 (7)
abstracting: (1<=p67)
states: 7,411,887 (6)
abstracting: (p162<=p314)
states: 54,098,674 (7)
abstracting: (1<=p206)
states: 1
abstracting: (1<=p288)
states: 7,411,887 (6)
abstracting: (1<=p199)
states: 1
abstracting: (p24<=p238)
states: 54,098,674 (7)
abstracting: (p103<=1)
states: 54,098,675 (7)
abstracting: (1<=p85)
states: 1
abstracting: (p199<=p205)
states: 54,098,674 (7)
abstracting: (p314<=p74)
states: 54,098,674 (7)
abstracting: (p326<=1)
states: 54,098,675 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.839sec
checking: EF [[[1<=p148 | [~ [[1<=p49 & ~ [[~ [1<=p120] & [~ [1<=p116] & [p278<=1 | 1<=p225]]]]]] | ~ [[~ [[p325<=1 & [1<=p282 | [p239<=0 & p20<=p49]]]] | ~ [[[[1<=p137 & p143<=0] & [p156<=0 | p18<=0]] & [p281<=p6 | ~ [p243<=p88]]]]]]]] & [p37<=1 & ~ [[p7<=p195 | p181<=p258]]]]]
normalized: E [true U [[~ [[p7<=p195 | p181<=p258]] & p37<=1] & [[~ [[~ [[[~ [p243<=p88] | p281<=p6] & [[p156<=0 | p18<=0] & [1<=p137 & p143<=0]]]] | ~ [[[[p239<=0 & p20<=p49] | 1<=p282] & p325<=1]]]] | ~ [[~ [[[[p278<=1 | 1<=p225] & ~ [1<=p116]] & ~ [1<=p120]]] & 1<=p49]]] | 1<=p148]]]
abstracting: (1<=p148)
states: 390,625 (5)
abstracting: (1<=p49)
states: 1
abstracting: (1<=p120)
states: 1
abstracting: (1<=p116)
states: 1
abstracting: (1<=p225)
states: 1
abstracting: (p278<=1)
states: 54,098,675 (7)
abstracting: (p325<=1)
states: 54,098,675 (7)
abstracting: (1<=p282)
states: 7,868,222 (6)
abstracting: (p20<=p49)
states: 54,098,674 (7)
abstracting: (p239<=0)
states: 54,098,674 (7)
abstracting: (p143<=0)
states: 46,686,788 (7)
abstracting: (1<=p137)
states: 1
abstracting: (p18<=0)
states: 54,098,674 (7)
abstracting: (p156<=0)
states: 54,098,674 (7)
abstracting: (p281<=p6)
states: 54,098,674 (7)
abstracting: (p243<=p88)
states: 54,098,674 (7)
abstracting: (p37<=1)
states: 54,098,675 (7)
abstracting: (p181<=p258)
states: 53,708,050 (7)
abstracting: (p7<=p195)
states: 54,033,139 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.132sec
checking: AG [[p48<=p130 | [~ [[[~ [[[p67<=p228 & p239<=0] | [1<=p143 & p105<=p214]]] & p325<=0] & [[[[~ [p138<=p29] & [p220<=p95 | p223<=1]] | [[1<=p169 & 1<=p103] | ~ [p35<=0]]] | 1<=p162] | [~ [p323<=p270] | ~ [[p261<=p233 | 1<=p303]]]]]] | ~ [[p239<=1 & ~ [p257<=p157]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [p257<=p157] & p239<=1]] | ~ [[[[~ [[p261<=p233 | 1<=p303]] | ~ [p323<=p270]] | [[[~ [p35<=0] | [1<=p169 & 1<=p103]] | [[p220<=p95 | p223<=1] & ~ [p138<=p29]]] | 1<=p162]] & [~ [[[1<=p143 & p105<=p214] | [p67<=p228 & p239<=0]]] & p325<=0]]]] | p48<=p130]]]]
abstracting: (p48<=p130)
states: 54,098,674 (7)
abstracting: (p325<=0)
states: 48,333,874 (7)
abstracting: (p239<=0)
states: 54,098,674 (7)
abstracting: (p67<=p228)
states: 46,686,788 (7)
abstracting: (p105<=p214)
states: 47,745,629 (7)
abstracting: (1<=p143)
states: 7,411,887 (6)
abstracting: (1<=p162)
states: 1
abstracting: (p138<=p29)
states: 46,230,454 (7)
abstracting: (p223<=1)
states: 54,098,675 (7)
abstracting: (p220<=p95)
states: 53,708,050 (7)
abstracting: (1<=p103)
states: 7,411,887 (6)
abstracting: (1<=p169)
states: 1
abstracting: (p35<=0)
states: 46,686,788 (7)
abstracting: (p323<=p270)
states: 48,333,874 (7)
abstracting: (1<=p303)
states: 1
abstracting: (p261<=p233)
states: 54,098,674 (7)
abstracting: (p239<=1)
states: 54,098,675 (7)
abstracting: (p257<=p157)
states: 54,033,139 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.551sec
checking: EF [[[[[p101<=p45 | [p63<=0 & ~ [[~ [p132<=0] & [~ [p172<=p146] | ~ [p173<=0]]]]]] & p98<=0] & [~ [1<=p37] & [1<=p83 & p83<=0]]] & ~ [[[~ [[[~ [p98<=p71] | [p315<=p73 | p14<=p111]] | [~ [p294<=0] & [1<=p28 | p266<=1]]]] & p155<=0] & [1<=p72 | ~ [[[[[1<=p287 | 1<=p267] & [1<=p40 | 1<=p271]] & [[p42<=p229 & 1<=p3] & [p60<=1 | 1<=p206]]] | [[[p169<=p217 | p211<=0] & [p138<=1 & 1<=p315]] & p168<=1]]]]]]]]
normalized: E [true U [~ [[[~ [[[[[p138<=1 & 1<=p315] & [p169<=p217 | p211<=0]] & p168<=1] | [[[p60<=1 | 1<=p206] & [p42<=p229 & 1<=p3]] & [[1<=p40 | 1<=p271] & [1<=p287 | 1<=p267]]]]] | 1<=p72] & [~ [[[[1<=p28 | p266<=1] & ~ [p294<=0]] | [[p315<=p73 | p14<=p111] | ~ [p98<=p71]]]] & p155<=0]]] & [[[1<=p83 & p83<=0] & ~ [1<=p37]] & [[[~ [[[~ [p173<=0] | ~ [p172<=p146]] & ~ [p132<=0]]] & p63<=0] | p101<=p45] & p98<=0]]]]
abstracting: (p98<=0)
states: 54,098,674 (7)
abstracting: (p101<=p45)
states: 54,098,674 (7)
abstracting: (p63<=0)
states: 54,098,674 (7)
abstracting: (p132<=0)
states: 54,098,674 (7)
abstracting: (p172<=p146)
states: 54,098,674 (7)
abstracting: (p173<=0)
states: 54,098,674 (7)
abstracting: (1<=p37)
states: 390,625 (5)
abstracting: (p83<=0)
states: 54,098,674 (7)
abstracting: (1<=p83)
states: 1
abstracting: (p155<=0)
states: 54,098,674 (7)
abstracting: (p98<=p71)
states: 54,098,674 (7)
abstracting: (p14<=p111)
states: 54,098,674 (7)
abstracting: (p315<=p73)
states: 54,098,674 (7)
abstracting: (p294<=0)
states: 54,033,139 (7)
abstracting: (p266<=1)
states: 54,098,675 (7)
abstracting: (1<=p28)
states: 1
abstracting: (1<=p72)
states: 7,411,887 (6)
abstracting: (1<=p267)
states: 1
abstracting: (1<=p287)
states: 7,411,887 (6)
abstracting: (1<=p271)
states: 1
abstracting: (1<=p40)
states: 390,625 (5)
abstracting: (1<=p3)
states: 390,625 (5)
abstracting: (p42<=p229)
states: 54,033,139 (7)
abstracting: (1<=p206)
states: 1
abstracting: (p60<=1)
states: 54,098,675 (7)
abstracting: (p168<=1)
states: 54,098,675 (7)
abstracting: (p211<=0)
states: 46,686,788 (7)
abstracting: (p169<=p217)
states: 54,098,674 (7)
abstracting: (1<=p315)
states: 1
abstracting: (p138<=1)
states: 54,098,675 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.576sec
checking: EF [[[~ [p142<=p289] & 1<=p205] & [[[~ [[[[~ [p17<=p187] | [1<=p278 | 1<=p211]] | [~ [p118<=p23] | p317<=p212]] & [1<=p243 | [[p302<=p35 & p122<=p195] | ~ [1<=p115]]]]] & p123<=1] & ~ [[p291<=1 & [[[p156<=p57 & p84<=p73] & 1<=p284] & [[1<=p28 | p181<=0] & ~ [[p324<=0 & 1<=p2]]]]]]] | ~ [[[[[1<=p155 & p143<=p41] & p86<=p159] | [p289<=p141 | ~ [1<=p269]]] & p244<=p312]]]]]
normalized: E [true U [[~ [[[[~ [1<=p269] | p289<=p141] | [[1<=p155 & p143<=p41] & p86<=p159]] & p244<=p312]] | [~ [[[[~ [[p324<=0 & 1<=p2]] & [1<=p28 | p181<=0]] & [[p156<=p57 & p84<=p73] & 1<=p284]] & p291<=1]] & [~ [[[[~ [1<=p115] | [p302<=p35 & p122<=p195]] | 1<=p243] & [[~ [p118<=p23] | p317<=p212] | [[1<=p278 | 1<=p211] | ~ [p17<=p187]]]]] & p123<=1]]] & [~ [p142<=p289] & 1<=p205]]]
abstracting: (1<=p205)
states: 1
abstracting: (p142<=p289)
states: 46,686,788 (7)
abstracting: (p123<=1)
states: 54,098,675 (7)
abstracting: (p17<=p187)
states: 54,098,674 (7)
abstracting: (1<=p211)
states: 7,411,887 (6)
abstracting: (1<=p278)
states: 1
abstracting: (p317<=p212)
states: 54,098,674 (7)
abstracting: (p118<=p23)
states: 54,098,674 (7)
abstracting: (1<=p243)
states: 1
abstracting: (p122<=p195)
states: 54,098,674 (7)
abstracting: (p302<=p35)
states: 54,098,674 (7)
abstracting: (1<=p115)
states: 65,536 (4)
abstracting: (p291<=1)
states: 54,098,675 (7)
abstracting: (1<=p284)
states: 7,411,887 (6)
abstracting: (p84<=p73)
states: 54,098,674 (7)
abstracting: (p156<=p57)
states: 54,098,674 (7)
abstracting: (p181<=0)
states: 53,708,050 (7)
abstracting: (1<=p28)
states: 1
abstracting: (1<=p2)
states: 390,625 (5)
abstracting: (p324<=0)
states: 48,333,874 (7)
abstracting: (p244<=p312)
states: 54,098,674 (7)
abstracting: (p86<=p159)
states: 54,098,674 (7)
abstracting: (p143<=p41)
states: 46,686,788 (7)
abstracting: (1<=p155)
states: 1
abstracting: (p289<=p141)
states: 53,708,050 (7)
abstracting: (1<=p269)
states: 1
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.035sec
checking: AG [[[p167<=1 & [p246<=p323 | [~ [[p230<=p307 & [~ [1<=p119] | ~ [p180<=p316]]]] | ~ [p60<=p289]]]] | [[[p140<=0 | [[p209<=0 & p300<=p102] | ~ [[[1<=p295 & p178<=0] | [p81<=p2 & p97<=0]]]]] & [~ [[p291<=p270 & ~ [[[p128<=0 | p36<=0] | 1<=p27]]]] | [~ [p159<=1] | [p112<=0 & ~ [[1<=p44 & p121<=0]]]]]] & [p298<=1 | [1<=p302 | [p32<=p128 & [[~ [[p202<=0 | 1<=p317]] | [[1<=p97 | 1<=p90] | [p264<=0 | 1<=p25]]] | ~ [[p101<=p79 | ~ [1<=p199]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[p298<=1 | [1<=p302 | [p32<=p128 & [~ [[p101<=p79 | ~ [1<=p199]]] | [[[p264<=0 | 1<=p25] | [1<=p97 | 1<=p90]] | ~ [[p202<=0 | 1<=p317]]]]]]] & [[[[p112<=0 & ~ [[1<=p44 & p121<=0]]] | ~ [p159<=1]] | ~ [[p291<=p270 & ~ [[1<=p27 | [p128<=0 | p36<=0]]]]]] & [p140<=0 | [~ [[[p81<=p2 & p97<=0] | [1<=p295 & p178<=0]]] | [p209<=0 & p300<=p102]]]]] | [p167<=1 & [p246<=p323 | [~ [p60<=p289] | ~ [[p230<=p307 & [~ [p180<=p316] | ~ [1<=p119]]]]]]]]]]]
abstracting: (1<=p119)
states: 1
abstracting: (p180<=p316)
states: 46,686,788 (7)
abstracting: (p230<=p307)
states: 54,098,674 (7)
abstracting: (p60<=p289)
states: 54,098,674 (7)
abstracting: (p246<=p323)
states: 47,053,996 (7)
abstracting: (p167<=1)
states: 54,098,675 (7)
abstracting: (p300<=p102)
states: 54,098,675 (7)
abstracting: (p209<=0)
states: 54,098,674 (7)
abstracting: (p178<=0)
states: 46,686,788 (7)
abstracting: (1<=p295)
states: 65,536 (4)
abstracting: (p97<=0)
states: 54,098,674 (7)
abstracting: (p81<=p2)
states: 54,098,674 (7)
abstracting: (p140<=0)
states: 46,686,788 (7)
abstracting: (p36<=0)
states: 46,686,788 (7)
abstracting: (p128<=0)
states: 54,098,674 (7)
abstracting: (1<=p27)
states: 1
abstracting: (p291<=p270)
states: 53,708,050 (7)
abstracting: (p159<=1)
states: 54,098,675 (7)
abstracting: (p121<=0)
states: 54,098,674 (7)
abstracting: (1<=p44)
states: 1
abstracting: (p112<=0)
states: 53,708,050 (7)
abstracting: (1<=p317)
states: 1
abstracting: (p202<=0)
states: 54,098,674 (7)
abstracting: (1<=p90)
states: 1
abstracting: (1<=p97)
states: 1
abstracting: (1<=p25)
states: 1
abstracting: (p264<=0)
states: 54,098,674 (7)
abstracting: (1<=p199)
states: 1
abstracting: (p101<=p79)
states: 54,098,674 (7)
abstracting: (p32<=p128)
states: 46,686,788 (7)
abstracting: (1<=p302)
states: 1
abstracting: (p298<=1)
states: 54,098,675 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.964sec
checking: AG [~ [[[~ [[p181<=1 | ~ [p133<=1]]] & ~ [1<=p5]] | [[[[~ [[[p11<=p159 | p46<=p257] & p100<=p87]] | [~ [p281<=1] & [1<=p62 | [p31<=p204 & p212<=0]]]] | ~ [p262<=p310]] | ~ [[~ [[~ [p70<=0] | ~ [1<=p24]]] | ~ [[p114<=p301 | p204<=1]]]]] & [~ [[~ [[p27<=1 | [1<=p34 | p55<=0]]] | [[[1<=p307 & p282<=p324] | ~ [1<=p199]] | [[p193<=1 & 1<=p106] & ~ [p113<=0]]]]] | [[[1<=p38 & p193<=p195] | ~ [[p219<=0 & p152<=0]]] & [[~ [1<=p287] | [[1<=p160 | p245<=p105] | [p262<=p169 | 1<=p19]]] | [[p17<=1 & 1<=p141] & [p14<=p74 & [p6<=1 | p62<=p293]]]]]]]]]]
normalized: ~ [E [true U [[[[[[[p14<=p74 & [p6<=1 | p62<=p293]] & [p17<=1 & 1<=p141]] | [[[p262<=p169 | 1<=p19] | [1<=p160 | p245<=p105]] | ~ [1<=p287]]] & [~ [[p219<=0 & p152<=0]] | [1<=p38 & p193<=p195]]] | ~ [[[[~ [p113<=0] & [p193<=1 & 1<=p106]] | [~ [1<=p199] | [1<=p307 & p282<=p324]]] | ~ [[p27<=1 | [1<=p34 | p55<=0]]]]]] & [~ [[~ [[p114<=p301 | p204<=1]] | ~ [[~ [1<=p24] | ~ [p70<=0]]]]] | [~ [p262<=p310] | [[[1<=p62 | [p31<=p204 & p212<=0]] & ~ [p281<=1]] | ~ [[p100<=p87 & [p11<=p159 | p46<=p257]]]]]]] | [~ [1<=p5] & ~ [[p181<=1 | ~ [p133<=1]]]]]]]
abstracting: (p133<=1)
states: 54,098,675 (7)
abstracting: (p181<=1)
states: 54,098,675 (7)
abstracting: (1<=p5)
states: 65,536 (4)
abstracting: (p46<=p257)
states: 54,098,674 (7)
abstracting: (p11<=p159)
states: 54,098,674 (7)
abstracting: (p100<=p87)
states: 54,098,674 (7)
abstracting: (p281<=1)
states: 54,098,675 (7)
abstracting: (p212<=0)
states: 46,686,788 (7)
abstracting: (p31<=p204)
states: 46,686,788 (7)
abstracting: (1<=p62)
states: 1
abstracting: (p262<=p310)
states: 54,098,674 (7)
abstracting: (p70<=0)
states: 46,686,788 (7)
abstracting: (1<=p24)
states: 1
abstracting: (p204<=1)
states: 54,098,675 (7)
abstracting: (p114<=p301)
states: 54,033,139 (7)
abstracting: (p55<=0)
states: 54,098,674 (7)
abstracting: (1<=p34)
states: 7,411,887 (6)
abstracting: (p27<=1)
states: 54,098,675 (7)
abstracting: (p282<=p324)
states: 47,053,996 (7)
abstracting: (1<=p307)
states: 1
abstracting: (1<=p199)
states: 1
abstracting: (1<=p106)
states: 7,411,887 (6)
abstracting: (p193<=1)
states: 54,098,675 (7)
abstracting: (p113<=0)
states: 54,033,139 (7)
abstracting: (p193<=p195)
states: 54,098,674 (7)
abstracting: (1<=p38)
states: 390,625 (5)
abstracting: (p152<=0)
states: 54,098,674 (7)
abstracting: (p219<=0)
states: 53,708,050 (7)
abstracting: (1<=p287)
states: 7,411,887 (6)
abstracting: (p245<=p105)
states: 54,098,674 (7)
abstracting: (1<=p160)
states: 1
abstracting: (1<=p19)
states: 1
abstracting: (p262<=p169)
states: 54,098,674 (7)
abstracting: (1<=p141)
states: 7,411,887 (6)
abstracting: (p17<=1)
states: 54,098,675 (7)
abstracting: (p62<=p293)
states: 54,098,674 (7)
abstracting: (p6<=1)
states: 54,098,675 (7)
abstracting: (p14<=p74)
states: 54,098,674 (7)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24.687sec
checking: AG [[~ [[[[[~ [[1<=p318 & 1<=p248]] & p226<=1] | [1<=p321 | [[[p97<=1 | p211<=p107] & [1<=p161 & 1<=p21]] & ~ [[1<=p262 | p226<=p7]]]]] & [[[[[p103<=0 & p104<=1] & [1<=p135 | p17<=0]] & [~ [1<=p97] | ~ [p125<=p327]]] & [~ [[p240<=p22 & p16<=p61]] | [[1<=p43 | p7<=0] & p137<=p22]]] & p239<=p84]] & ~ [p25<=p59]]] | [p286<=0 & [[~ [[p107<=p152 & ~ [[[1<=p288 | p112<=0] | p76<=p187]]]] | p316<=1] | [[1<=p129 | [~ [[p105<=p249 | p156<=p135]] | [p57<=p278 & [[p268<=p209 & p52<=p187] | ~ [p164<=1]]]]] | ~ [[p148<=p245 & [~ [p293<=0] | ~ [[p246<=0 | p217<=p137]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[p239<=p84 & [[[[1<=p135 | p17<=0] & [p103<=0 & p104<=1]] & [~ [p125<=p327] | ~ [1<=p97]]] & [[p137<=p22 & [1<=p43 | p7<=0]] | ~ [[p240<=p22 & p16<=p61]]]]] & [[1<=p321 | [~ [[1<=p262 | p226<=p7]] & [[1<=p161 & 1<=p21] & [p97<=1 | p211<=p107]]]] | [p226<=1 & ~ [[1<=p318 & 1<=p248]]]]] & ~ [p25<=p59]]] | [p286<=0 & [[p316<=1 | ~ [[p107<=p152 & ~ [[p76<=p187 | [1<=p288 | p112<=0]]]]]] | [[1<=p129 | [[p57<=p278 & [~ [p164<=1] | [p268<=p209 & p52<=p187]]] | ~ [[p105<=p249 | p156<=p135]]]] | ~ [[p148<=p245 & [~ [[p246<=0 | p217<=p137]] | ~ [p293<=0]]]]]]]]]]]
abstracting: (p293<=0)
states: 54,033,139 (7)
abstracting: (p217<=p137)
states: 53,708,050 (7)
abstracting: (p246<=0)
states: 46,230,453 (7)
abstracting: (p148<=p245)
states: 53,708,050 (7)
abstracting: (p156<=p135)
states: 54,098,674 (7)
abstracting: (p105<=p249)
states: 47,745,629 (7)
abstracting: (p52<=p187)
states: 54,098,674 (7)
abstracting: (p268<=p209)
states: 54,098,674 (7)
abstracting: (p164<=1)
states: 54,098,675 (7)
abstracting: (p57<=p278)
states: 54,098,674 (7)
abstracting: (1<=p129)
states: 1
abstracting: (p112<=0)
states: 53,708,050 (7)
abstracting: (1<=p288)
states: 7,411,887 (6)
abstracting: (p76<=p187)
states: 53,708,050 (7)
abstracting: (p107<=p152)
states: 46,686,788 (7)
abstracting: (p316<=1)
states: 54,098,675 (7)
abstracting: (p286<=0)
states: 46,686,788 (7)
abstracting: (p25<=p59)
states: 54,098,674 (7)
abstracting: (1<=p248)
states: 7,411,887 (6)
abstracting: (1<=p318)
states: 6,221,136 (6)
abstracting: (p226<=1)
states: 54,098,675 (7)
abstracting: (p211<=p107)
states: 47,745,629 (7)
abstracting: (p97<=1)
states: 54,098,675 (7)
abstracting: (1<=p21)
states: 1
abstracting: (1<=p161)
states: 1
abstracting: (p226<=p7)
states: 54,098,674 (7)
abstracting: (1<=p262)
states: 1
abstracting: (1<=p321)
states: 5,764,801 (6)
abstracting: (p16<=p61)
states: 54,098,674 (7)
abstracting: (p240<=p22)
states: 54,098,674 (7)
abstracting: (p7<=0)
states: 54,033,139 (7)
abstracting: (1<=p43)
states: 65,536 (4)
abstracting: (p137<=p22)
states: 54,098,674 (7)
abstracting: (1<=p97)
states: 1
abstracting: (p125<=p327)
states: 54,098,675 (7)
abstracting: (p104<=1)
states: 54,098,675 (7)
abstracting: (p103<=0)
states: 46,686,788 (7)
abstracting: (p17<=0)
states: 54,098,674 (7)
abstracting: (1<=p135)
states: 1
abstracting: (p239<=p84)
states: 54,098,674 (7)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.494sec
totally nodes used: 21494728 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 55683394 273396790 329080184
used/not used/entry size/cache size: 65955173 1153691 16 1024MB
basic ops cache: hits/miss/sum: 11673691 66819632 78493323
used/not used/entry size/cache size: 16567165 210051 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 344264 2101318 2445582
used/not used/entry size/cache size: 1861550 6527058 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 51723201
1 10828956
2 3332136
3 955123
4 220025
5 41710
6 6652
7 933
8 114
9 14
>= 10 0
Total processing time: 3m24.017sec
BK_STOP 1679482657475
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.253sec
134758 149323 149713 150193 150504 151075 151201 151621 152039 152261 152461 152715 153140 153537 154091 154644 155129 155586 155984 156303 156638 157652 158670 159264 160547 160974 161744 162106 163176 163572 164010 164965 165847 167076 168111 168917 169553 170988 171687 172933 173325 174424 176404 175085 177181 179054 181246 182762 185076 187400 189488 190290 191848 194128 195116 196960 198713 200681 204089
iterations count:5957951 (317), effective:2158 (0)
initing FirstDep: 0m 0.250sec
198068
iterations count:152663 (8), effective:309 (0)
198068
iterations count:152836 (8), effective:309 (0)
198068
iterations count:152783 (8), effective:309 (0)
198068
iterations count:152859 (8), effective:309 (0)
198068
iterations count:152651 (8), effective:309 (0)
198068
iterations count:152761 (8), effective:308 (0)
199497
iterations count:152445 (8), effective:309 (0)
198068
iterations count:153066 (8), effective:309 (0)
198068
iterations count:152985 (8), effective:307 (0)
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-08a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is StigmergyCommit-PT-08a, 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 r458-smll-167912650300494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a 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 '
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 ;