About the Execution of Marcie+red for StigmergyCommit-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5650.752 | 54236.00 | 79040.00 | 1560.20 | TFFTFFTTTFFFFTTF | 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-167912650300423.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650300423
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 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 359K 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-03b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679448210845
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:23:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:23:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:23:35] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-22 01:23:35] [INFO ] Transformed 1231 places.
[2023-03-22 01:23:35] [INFO ] Transformed 1476 transitions.
[2023-03-22 01:23:35] [INFO ] Found NUPN structural information;
[2023-03-22 01:23:35] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 129 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-22 01:23:37] [INFO ] Computed 5 place invariants in 49 ms
[2023-03-22 01:23:38] [INFO ] After 1219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 01:23:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-22 01:23:42] [INFO ] After 2950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 01:23:44] [INFO ] Deduced a trap composed of 490 places in 1020 ms of which 13 ms to minimize.
[2023-03-22 01:23:45] [INFO ] Deduced a trap composed of 398 places in 961 ms of which 4 ms to minimize.
[2023-03-22 01:23:46] [INFO ] Deduced a trap composed of 396 places in 780 ms of which 2 ms to minimize.
[2023-03-22 01:23:47] [INFO ] Deduced a trap composed of 396 places in 744 ms of which 4 ms to minimize.
[2023-03-22 01:23:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3870 ms
[2023-03-22 01:23:48] [INFO ] Deduced a trap composed of 206 places in 1126 ms of which 2 ms to minimize.
[2023-03-22 01:23:49] [INFO ] Deduced a trap composed of 397 places in 622 ms of which 1 ms to minimize.
[2023-03-22 01:23:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1959 ms
[2023-03-22 01:23:50] [INFO ] Deduced a trap composed of 398 places in 576 ms of which 1 ms to minimize.
[2023-03-22 01:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2023-03-22 01:23:51] [INFO ] Deduced a trap composed of 398 places in 556 ms of which 2 ms to minimize.
[2023-03-22 01:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 705 ms
[2023-03-22 01:23:52] [INFO ] After 12751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1936 ms.
[2023-03-22 01:23:54] [INFO ] After 15842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 138 ms.
Support contains 118 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 985 edges and 1231 vertex of which 43 / 1231 are part of one of the 7 SCC in 13 ms
Free SCC test removed 36 places
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 1691 edges and 1195 vertex of which 1189 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 705 transitions
Trivial Post-agglo rules discarded 705 transitions
Performed 705 trivial Post agglomeration. Transition count delta: 705
Iterating post reduction 0 with 707 rules applied. Total rules applied 709 place count 1189 transition count 720
Reduce places removed 705 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 718 rules applied. Total rules applied 1427 place count 484 transition count 707
Reduce places removed 5 places and 0 transitions.
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Iterating post reduction 2 with 80 rules applied. Total rules applied 1507 place count 479 transition count 632
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 1582 place count 404 transition count 632
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1582 place count 404 transition count 582
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1682 place count 354 transition count 582
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1724 place count 312 transition count 540
Iterating global reduction 4 with 42 rules applied. Total rules applied 1766 place count 312 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1769 place count 312 transition count 537
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1775 place count 306 transition count 524
Iterating global reduction 5 with 6 rules applied. Total rules applied 1781 place count 306 transition count 524
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1784 place count 306 transition count 521
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1818 place count 289 transition count 504
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1821 place count 286 transition count 501
Iterating global reduction 6 with 3 rules applied. Total rules applied 1824 place count 286 transition count 501
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1825 place count 285 transition count 500
Iterating global reduction 6 with 1 rules applied. Total rules applied 1826 place count 285 transition count 500
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1827 place count 284 transition count 499
Iterating global reduction 6 with 1 rules applied. Total rules applied 1828 place count 284 transition count 499
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1834 place count 281 transition count 499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1835 place count 281 transition count 498
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1840 place count 281 transition count 493
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1868 place count 281 transition count 465
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 1896 place count 253 transition count 465
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1898 place count 253 transition count 465
Applied a total of 1898 rules in 525 ms. Remains 253 /1231 variables (removed 978) and now considering 465/1476 (removed 1011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 253/1231 places, 465/1476 transitions.
Incomplete random walk after 10000 steps, including 538 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 440473 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{1=1}
Probabilistic random walk after 440473 steps, saw 100154 distinct states, run finished after 3006 ms. (steps per millisecond=146 ) properties seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 465 rows 253 cols
[2023-03-22 01:23:58] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-22 01:23:58] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 01:23:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-22 01:23:59] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 01:23:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 01:23:59] [INFO ] After 351ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 01:24:00] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-22 01:24:00] [INFO ] After 1710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 11 ms.
Support contains 78 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 465/465 transitions.
Graph (trivial) has 68 edges and 253 vertex of which 2 / 253 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 252 transition count 431
Reduce places removed 31 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 47 rules applied. Total rules applied 79 place count 221 transition count 415
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 97 place count 205 transition count 413
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 97 place count 205 transition count 408
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 200 transition count 408
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 195 transition count 403
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 195 transition count 403
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 191 transition count 399
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 187 transition count 395
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 187 transition count 395
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 183 transition count 391
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 183 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 181 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 181 transition count 389
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 181 transition count 382
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 159 place count 174 transition count 382
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 174 transition count 382
Applied a total of 160 rules in 98 ms. Remains 174 /253 variables (removed 79) and now considering 382/465 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 174/253 places, 382/465 transitions.
Incomplete random walk after 10000 steps, including 602 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 677572 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 677572 steps, saw 139095 distinct states, run finished after 3002 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 382 rows 174 cols
[2023-03-22 01:24:04] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-22 01:24:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:24:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-22 01:24:04] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:24:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 01:24:04] [INFO ] After 193ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:24:05] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 1 ms to minimize.
[2023-03-22 01:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-22 01:24:05] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 0 ms to minimize.
[2023-03-22 01:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-22 01:24:05] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-22 01:24:05] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 78 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 382/382 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 174/174 places, 382/382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 382/382 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-22 01:24:05] [INFO ] Invariant cache hit.
[2023-03-22 01:24:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 01:24:05] [INFO ] Invariant cache hit.
[2023-03-22 01:24:05] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 01:24:05] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-22 01:24:06] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-22 01:24:06] [INFO ] Invariant cache hit.
[2023-03-22 01:24:06] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 174/174 places, 382/382 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 01:24:06] [INFO ] Invariant cache hit.
[2023-03-22 01:24:06] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:24:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-22 01:24:06] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:24:06] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-22 01:24:07] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:24:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 01:24:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 382 transitions and 1944 arcs took 3 ms.
[2023-03-22 01:24:07] [INFO ] Flatten gal took : 105 ms
Total runtime 32589 ms.
There are residual formulas that ITS could not solve within timeout
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=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: StigmergyCommit_PT_03b
(NrP: 174 NrTr: 382 NrArc: 1944)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.018sec
net check time: 0m 0.000sec
init dd package: 0m 3.489sec
RS generation: 0m 1.361sec
-> reachability set: #nodes 6168 (6.2e+03) #states 2,526,979 (6)
starting MCC model checker
--------------------------
checking: EF [[[[[[[p127<=1 & 1<=p127] | [p51<=1 & 1<=p51]] | [[[p154<=0 & 0<=p154] & [[p60<=0 & 0<=p60] | [[p69<=1 & 1<=p69] & [p64<=1 & 1<=p64]]]] | [[[p120<=1 & 1<=p120] & [[[p163<=0 & 0<=p163] | [p36<=0 & 0<=p36]] | [[p173<=0 & 0<=p173] | [p102<=0 & 0<=p102]]]] | [[p12<=1 & 1<=p12] & [[p173<=1 & 1<=p173] & [p31<=1 & 1<=p31]]]]]] & [[[[p95<=0 & 0<=p95] | [p75<=0 & 0<=p75]] | [[p24<=0 & 0<=p24] | [[p107<=1 & 1<=p107] & [p118<=1 & 1<=p118]]]] & [[[p113<=1 & 1<=p113] | [p104<=1 & 1<=p104]] | [[[[p9<=1 & 1<=p9] & [p65<=1 & 1<=p65]] & [[p99<=1 & 1<=p99] & [p149<=1 & 1<=p149]]] | [[[p5<=1 & 1<=p5] & [p46<=1 & 1<=p46]] & [[p91<=1 & 1<=p91] & [p132<=1 & 1<=p132]]]]]]] & [[p2<=0 & 0<=p2] & [[[p29<=0 & 0<=p29] | [p108<=0 & 0<=p108]] | [[[p168<=1 & 1<=p168] & [p173<=1 & 1<=p173]] | [[p116<=1 & 1<=p116] & [[[p93<=0 & 0<=p93] | [p80<=0 & 0<=p80]] | [[p106<=1 & 1<=p106] | [p34<=1 & 1<=p34]]]]]]]] & [[[p109<=0 & 0<=p109] & [p53<=0 & 0<=p53]] & [[p147<=1 & 1<=p147] & [[p122<=0 & 0<=p122] & [p101<=0 & 0<=p101]]]]]]
normalized: E [true U [[[[p109<=0 & 0<=p109] & [p53<=0 & 0<=p53]] & [[p147<=1 & 1<=p147] & [[p122<=0 & 0<=p122] & [p101<=0 & 0<=p101]]]] & [[[[[[p95<=0 & 0<=p95] | [p75<=0 & 0<=p75]] | [[[p118<=1 & 1<=p118] & [p107<=1 & 1<=p107]] | [p24<=0 & 0<=p24]]] & [[[[[p9<=1 & 1<=p9] & [p65<=1 & 1<=p65]] & [[p149<=1 & 1<=p149] & [p99<=1 & 1<=p99]]] | [[[p132<=1 & 1<=p132] & [p91<=1 & 1<=p91]] & [[p46<=1 & 1<=p46] & [p5<=1 & 1<=p5]]]] | [[p104<=1 & 1<=p104] | [p113<=1 & 1<=p113]]]] & [[[[[p60<=0 & 0<=p60] | [[p69<=1 & 1<=p69] & [p64<=1 & 1<=p64]]] & [p154<=0 & 0<=p154]] | [[[[p31<=1 & 1<=p31] & [p173<=1 & 1<=p173]] & [p12<=1 & 1<=p12]] | [[[[p36<=0 & 0<=p36] | [p163<=0 & 0<=p163]] | [[p102<=0 & 0<=p102] | [p173<=0 & 0<=p173]]] & [p120<=1 & 1<=p120]]]] | [[p51<=1 & 1<=p51] | [p127<=1 & 1<=p127]]]] & [[[[p108<=0 & 0<=p108] | [p29<=0 & 0<=p29]] | [[[[[p106<=1 & 1<=p106] | [p34<=1 & 1<=p34]] | [[p80<=0 & 0<=p80] | [p93<=0 & 0<=p93]]] & [p116<=1 & 1<=p116]] | [[p173<=1 & 1<=p173] & [p168<=1 & 1<=p168]]]] & [p2<=0 & 0<=p2]]]]]
abstracting: (0<=p2)
states: 2,526,979 (6)
abstracting: (p2<=0)
states: 2,515,249 (6)
abstracting: (1<=p168)
states: 18,000 (4)
abstracting: (p168<=1)
states: 2,526,979 (6)
abstracting: (1<=p173)
states: 842,326 (5)
abstracting: (p173<=1)
states: 2,526,979 (6)
abstracting: (1<=p116)
states: 68,208 (4)
abstracting: (p116<=1)
states: 2,526,979 (6)
abstracting: (0<=p93)
states: 2,526,979 (6)
abstracting: (p93<=0)
states: 2,423,053 (6)
abstracting: (0<=p80)
states: 2,526,979 (6)
abstracting: (p80<=0)
states: 2,461,123 (6)
abstracting: (1<=p34)
states: 31,680 (4)
abstracting: (p34<=1)
states: 2,526,979 (6)
abstracting: (1<=p106)
states: 68,208 (4)
abstracting: (p106<=1)
states: 2,526,979 (6)
abstracting: (0<=p29)
states: 2,526,979 (6)
abstracting: (p29<=0)
states: 2,458,771 (6)
abstracting: (0<=p108)
states: 2,526,979 (6)
abstracting: (p108<=0)
states: 2,458,771 (6)
abstracting: (1<=p127)
states: 33,750 (4)
abstracting: (p127<=1)
states: 2,526,979 (6)
abstracting: (1<=p51)
states: 6,336 (3)
abstracting: (p51<=1)
states: 2,526,979 (6)
abstracting: (1<=p120)
states: 68,208 (4)
abstracting: (p120<=1)
states: 2,526,979 (6)
abstracting: (0<=p173)
states: 2,526,979 (6)
abstracting: (p173<=0)
states: 1,684,653 (6)
abstracting: (0<=p102)
states: 2,526,979 (6)
abstracting: (p102<=0)
states: 2,458,771 (6)
abstracting: (0<=p163)
states: 2,526,979 (6)
abstracting: (p163<=0)
states: 2,438,374 (6)
abstracting: (0<=p36)
states: 2,526,979 (6)
abstracting: (p36<=0)
states: 2,495,299 (6)
abstracting: (1<=p12)
states: 68,208 (4)
abstracting: (p12<=1)
states: 2,526,979 (6)
abstracting: (1<=p173)
states: 842,326 (5)
abstracting: (p173<=1)
states: 2,526,979 (6)
abstracting: (1<=p31)
states: 68,208 (4)
abstracting: (p31<=1)
states: 2,526,979 (6)
abstracting: (0<=p154)
states: 2,526,979 (6)
abstracting: (p154<=0)
states: 2,458,771 (6)
abstracting: (1<=p64)
states: 92,346 (4)
abstracting: (p64<=1)
states: 2,526,979 (6)
abstracting: (1<=p69)
states: 65,856 (4)
abstracting: (p69<=1)
states: 2,526,979 (6)
abstracting: (0<=p60)
states: 2,526,979 (6)
abstracting: (p60<=0)
states: 2,434,633 (6)
abstracting: (1<=p113)
states: 68,208 (4)
abstracting: (p113<=1)
states: 2,526,979 (6)
abstracting: (1<=p104)
states: 68,208 (4)
abstracting: (p104<=1)
states: 2,526,979 (6)
abstracting: (1<=p5)
states: 106,392 (5)
abstracting: (p5<=1)
states: 2,526,979 (6)
abstracting: (1<=p46)
states: 92,346 (4)
abstracting: (p46<=1)
states: 2,526,979 (6)
abstracting: (1<=p91)
states: 103,926 (5)
abstracting: (p91<=1)
states: 2,526,979 (6)
abstracting: (1<=p132)
states: 88,605 (4)
abstracting: (p132<=1)
states: 2,526,979 (6)
abstracting: (1<=p99)
states: 103,926 (5)
abstracting: (p99<=1)
states: 2,526,979 (6)
abstracting: (1<=p149)
states: 88,605 (4)
abstracting: (p149<=1)
states: 2,526,979 (6)
abstracting: (1<=p65)
states: 92,346 (4)
abstracting: (p65<=1)
states: 2,526,979 (6)
abstracting: (1<=p9)
states: 106,392 (5)
abstracting: (p9<=1)
states: 2,526,979 (6)
abstracting: (0<=p24)
states: 2,526,979 (6)
abstracting: (p24<=0)
states: 2,458,771 (6)
abstracting: (1<=p107)
states: 68,208 (4)
abstracting: (p107<=1)
states: 2,526,979 (6)
abstracting: (1<=p118)
states: 68,208 (4)
abstracting: (p118<=1)
states: 2,526,979 (6)
abstracting: (0<=p75)
states: 2,526,979 (6)
abstracting: (p75<=0)
states: 2,461,123 (6)
abstracting: (0<=p95)
states: 2,526,979 (6)
abstracting: (p95<=0)
states: 2,514,883 (6)
abstracting: (0<=p101)
states: 2,526,979 (6)
abstracting: (p101<=0)
states: 2,458,771 (6)
abstracting: (0<=p122)
states: 2,526,979 (6)
abstracting: (p122<=0)
states: 2,493,229 (6)
abstracting: (1<=p147)
states: 88,605 (4)
abstracting: (p147<=1)
states: 2,526,979 (6)
abstracting: (0<=p53)
states: 2,526,979 (6)
abstracting: (p53<=0)
states: 2,520,643 (6)
abstracting: (0<=p109)
states: 2,526,979 (6)
abstracting: (p109<=0)
states: 2,458,771 (6)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.962sec
checking: AG [[[[[[[[[[[1<=p132 & p132<=1] & [[[p14<=0 & 0<=p14] | [[p79<=0 & 0<=p79] & [p136<=0 & 0<=p136]]] | [0<=p62 & p62<=0]]] & [[p49<=1 & 1<=p49] & [p90<=1 & 1<=p90]]] & [[p82<=1 & 1<=p82] & [[p173<=1 & 1<=p173] & [p6<=1 & 1<=p6]]]] | [[[p5<=1 & 1<=p5] & [[p50<=1 & 1<=p50] & [p94<=1 & 1<=p94]]] & [[p134<=1 & 1<=p134] & [[p96<=0 & 0<=p96] & [[[p9<=0 & 0<=p9] | [p58<=0 & 0<=p58]] | [[p99<=0 & 0<=p99] | [p149<=0 & 0<=p149]]]]]]] | [p48<=0 & 0<=p48]] | [[p143<=0 & 0<=p143] | [p129<=1 & 1<=p129]]] & [p138<=0 & 0<=p138]] | [[[[p19<=0 & 0<=p19] & [p42<=0 & 0<=p42]] & [[p164<=0 & 0<=p164] & [p80<=0 & 0<=p80]]] & [[[[p166<=0 & 0<=p166] | [p173<=0 & 0<=p173]] & [[[[p6<=0 & 0<=p6] | [p50<=0 & 0<=p50]] | [[p91<=0 & 0<=p91] | [p134<=0 & 0<=p134]]] | [[[p111<=1 & 1<=p111] | [p44<=1 & 1<=p44]] | [[p156<=0 & 0<=p156] | [[p173<=0 & 0<=p173] | [[[p5<=1 & 1<=p5] & [p49<=1 & 1<=p49]] & [[p94<=1 & 1<=p94] & [p134<=1 & 1<=p134]]]]]]]] & [[[p87<=0 & 0<=p87] | [[p56<=1 & 1<=p56] | [[p40<=0 & 0<=p40] & [p11<=0 & 0<=p11]]]] & [[[[p151<=1 & 1<=p151] & [[p16<=1 & 1<=p16] & [p7<=1 & 1<=p7]]] & [[p46<=1 & 1<=p46] & [[p94<=1 & 1<=p94] & [p141<=1 & 1<=p141]]]] | [[p77<=1 & 1<=p77] & [[p140<=0 & 0<=p140] & [p67<=0 & 0<=p67]]]]]]]] | [p71<=0 & 0<=p71]]]
normalized: ~ [E [true U ~ [[[[[[[p129<=1 & 1<=p129] | [p143<=0 & 0<=p143]] | [[p48<=0 & 0<=p48] | [[[[[[[p149<=0 & 0<=p149] | [p99<=0 & 0<=p99]] | [[p58<=0 & 0<=p58] | [p9<=0 & 0<=p9]]] & [p96<=0 & 0<=p96]] & [p134<=1 & 1<=p134]] & [[[p94<=1 & 1<=p94] & [p50<=1 & 1<=p50]] & [p5<=1 & 1<=p5]]] | [[[[p6<=1 & 1<=p6] & [p173<=1 & 1<=p173]] & [p82<=1 & 1<=p82]] & [[[p90<=1 & 1<=p90] & [p49<=1 & 1<=p49]] & [[[0<=p62 & p62<=0] | [[[p136<=0 & 0<=p136] & [p79<=0 & 0<=p79]] | [p14<=0 & 0<=p14]]] & [1<=p132 & p132<=1]]]]]]] & [p138<=0 & 0<=p138]] | [[[[[[[p44<=1 & 1<=p44] | [p111<=1 & 1<=p111]] | [[[[[p5<=1 & 1<=p5] & [p49<=1 & 1<=p49]] & [[p134<=1 & 1<=p134] & [p94<=1 & 1<=p94]]] | [p173<=0 & 0<=p173]] | [p156<=0 & 0<=p156]]] | [[[p134<=0 & 0<=p134] | [p91<=0 & 0<=p91]] | [[p50<=0 & 0<=p50] | [p6<=0 & 0<=p6]]]] & [[p173<=0 & 0<=p173] | [p166<=0 & 0<=p166]]] & [[[[[p11<=0 & 0<=p11] & [p40<=0 & 0<=p40]] | [p56<=1 & 1<=p56]] | [p87<=0 & 0<=p87]] & [[[[[p94<=1 & 1<=p94] & [p141<=1 & 1<=p141]] & [p46<=1 & 1<=p46]] & [[[p7<=1 & 1<=p7] & [p16<=1 & 1<=p16]] & [p151<=1 & 1<=p151]]] | [[[p140<=0 & 0<=p140] & [p67<=0 & 0<=p67]] & [p77<=1 & 1<=p77]]]]] & [[[p80<=0 & 0<=p80] & [p164<=0 & 0<=p164]] & [[p42<=0 & 0<=p42] & [p19<=0 & 0<=p19]]]]] | [p71<=0 & 0<=p71]]]]]
abstracting: (0<=p71)
states: 2,526,979 (6)
abstracting: (p71<=0)
states: 2,461,123 (6)
abstracting: (0<=p19)
states: 2,526,979 (6)
abstracting: (p19<=0)
states: 2,458,771 (6)
abstracting: (0<=p42)
states: 2,526,979 (6)
abstracting: (p42<=0)
states: 2,502,499 (6)
abstracting: (0<=p164)
states: 2,526,979 (6)
abstracting: (p164<=0)
states: 2,508,979 (6)
abstracting: (0<=p80)
states: 2,526,979 (6)
abstracting: (p80<=0)
states: 2,461,123 (6)
abstracting: (1<=p77)
states: 65,856 (4)
abstracting: (p77<=1)
states: 2,526,979 (6)
abstracting: (0<=p67)
states: 2,526,979 (6)
abstracting: (p67<=0)
states: 2,461,123 (6)
abstracting: (0<=p140)
states: 2,526,979 (6)
abstracting: (p140<=0)
states: 2,438,374 (6)
abstracting: (1<=p151)
states: 5,544 (3)
abstracting: (p151<=1)
states: 2,526,979 (6)
abstracting: (1<=p16)
states: 68,208 (4)
abstracting: (p16<=1)
states: 2,526,979 (6)
abstracting: (1<=p7)
states: 106,392 (5)
abstracting: (p7<=1)
states: 2,526,979 (6)
abstracting: (1<=p46)
states: 92,346 (4)
abstracting: (p46<=1)
states: 2,526,979 (6)
abstracting: (1<=p141)
states: 88,605 (4)
abstracting: (p141<=1)
states: 2,526,979 (6)
abstracting: (1<=p94)
states: 103,926 (5)
abstracting: (p94<=1)
states: 2,526,979 (6)
abstracting: (0<=p87)
states: 2,526,979 (6)
abstracting: (p87<=0)
states: 2,515,249 (6)
abstracting: (1<=p56)
states: 6,336 (3)
abstracting: (p56<=1)
states: 2,526,979 (6)
abstracting: (0<=p40)
states: 2,526,979 (6)
abstracting: (p40<=0)
states: 2,495,299 (6)
abstracting: (0<=p11)
states: 2,526,979 (6)
abstracting: (p11<=0)
states: 2,420,587 (6)
abstracting: (0<=p166)
states: 2,526,979 (6)
abstracting: (p166<=0)
states: 2,508,979 (6)
abstracting: (0<=p173)
states: 2,526,979 (6)
abstracting: (p173<=0)
states: 1,684,653 (6)
abstracting: (0<=p6)
states: 2,526,979 (6)
abstracting: (p6<=0)
states: 2,420,587 (6)
abstracting: (0<=p50)
states: 2,526,979 (6)
abstracting: (p50<=0)
states: 2,434,633 (6)
abstracting: (0<=p91)
states: 2,526,979 (6)
abstracting: (p91<=0)
states: 2,423,053 (6)
abstracting: (0<=p134)
states: 2,526,979 (6)
abstracting: (p134<=0)
states: 2,438,374 (6)
abstracting: (0<=p156)
states: 2,526,979 (6)
abstracting: (p156<=0)
states: 2,458,771 (6)
abstracting: (0<=p173)
states: 2,526,979 (6)
abstracting: (p173<=0)
states: 1,684,653 (6)
abstracting: (1<=p94)
states: 103,926 (5)
abstracting: (p94<=1)
states: 2,526,979 (6)
abstracting: (1<=p134)
states: 88,605 (4)
abstracting: (p134<=1)
states: 2,526,979 (6)
abstracting: (1<=p49)
states: 92,346 (4)
abstracting: (p49<=1)
states: 2,526,979 (6)
abstracting: (1<=p5)
states: 106,392 (5)
abstracting: (p5<=1)
states: 2,526,979 (6)
abstracting: (1<=p111)
states: 68,208 (4)
abstracting: (p111<=1)
states: 2,526,979 (6)
abstracting: (1<=p44)
states: 6,900 (3)
abstracting: (p44<=1)
states: 2,526,979 (6)
abstracting: (0<=p138)
states: 2,526,979 (6)
abstracting: (p138<=0)
states: 2,438,374 (6)
abstracting: (p132<=1)
states: 2,526,979 (6)
abstracting: (1<=p132)
states: 88,605 (4)
abstracting: (0<=p14)
states: 2,526,979 (6)
abstracting: (p14<=0)
states: 2,458,771 (6)
abstracting: (0<=p79)
states: 2,526,979 (6)
abstracting: (p79<=0)
states: 2,461,123 (6)
abstracting: (0<=p136)
states: 2,526,979 (6)
abstracting: (p136<=0)
states: 2,438,374 (6)
abstracting: (p62<=0)
states: 2,434,633 (6)
abstracting: (0<=p62)
states: 2,526,979 (6)
abstracting: (1<=p49)
states: 92,346 (4)
abstracting: (p49<=1)
states: 2,526,979 (6)
abstracting: (1<=p90)
states: 103,926 (5)
abstracting: (p90<=1)
states: 2,526,979 (6)
abstracting: (1<=p82)
states: 24,480 (4)
abstracting: (p82<=1)
states: 2,526,979 (6)
abstracting: (1<=p173)
states: 842,326 (5)
abstracting: (p173<=1)
states: 2,526,979 (6)
abstracting: (1<=p6)
states: 106,392 (5)
abstracting: (p6<=1)
states: 2,526,979 (6)
abstracting: (1<=p5)
states: 106,392 (5)
abstracting: (p5<=1)
states: 2,526,979 (6)
abstracting: (1<=p50)
states: 92,346 (4)
abstracting: (p50<=1)
states: 2,526,979 (6)
abstracting: (1<=p94)
states: 103,926 (5)
abstracting: (p94<=1)
states: 2,526,979 (6)
abstracting: (1<=p134)
states: 88,605 (4)
abstracting: (p134<=1)
states: 2,526,979 (6)
abstracting: (0<=p96)
states: 2,526,979 (6)
abstracting: (p96<=0)
states: 2,514,883 (6)
abstracting: (0<=p9)
states: 2,526,979 (6)
abstracting: (p9<=0)
states: 2,420,587 (6)
abstracting: (0<=p58)
states: 2,526,979 (6)
abstracting: (p58<=0)
states: 2,434,633 (6)
abstracting: (0<=p99)
states: 2,526,979 (6)
abstracting: (p99<=0)
states: 2,423,053 (6)
abstracting: (0<=p149)
states: 2,526,979 (6)
abstracting: (p149<=0)
states: 2,438,374 (6)
abstracting: (0<=p48)
states: 2,526,979 (6)
abstracting: (p48<=0)
states: 2,434,633 (6)
abstracting: (0<=p143)
states: 2,526,979 (6)
abstracting: (p143<=0)
states: 2,521,435 (6)
abstracting: (1<=p129)
states: 5,100 (3)
abstracting: (p129<=1)
states: 2,526,979 (6)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.986sec
totally nodes used: 2963567 (3.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8609142 21416616 30025758
used/not used/entry size/cache size: 20192355 46916509 16 1024MB
basic ops cache: hits/miss/sum: 1830796 3156056 4986852
used/not used/entry size/cache size: 4947137 11830079 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: 30805 74550 105355
used/not used/entry size/cache size: 74364 8314244 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 64521320
1 2271217
2 264682
3 44535
4 6262
5 760
6 83
7 5
8 0
9 0
>= 10 0
Total processing time: 0m16.259sec
BK_STOP 1679448265081
--------------------
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 ReachabilityFireability -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.001sec
iterations count:44108 (115), effective:1328 (3)
initing FirstDep: 0m 0.001sec
7166 8760
iterations count:269626 (705), effective:6392 (16)
7794 8758
iterations count:267482 (700), effective:6341 (16)
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-03b"
export BK_EXAMINATION="ReachabilityFireability"
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-03b, examination is ReachabilityFireability"
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-167912650300423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03b.tgz
mv StigmergyCommit-PT-03b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;