fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814483100743
Last Updated
May 14, 2023

About the Execution of Marcie+red for DLCround-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7472.407 3600000.00 3644678.00 9257.60 FTFFTTFTTTTTTTTT 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.r106-tall-167814483100743.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 DLCround-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 18:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 DLCround-PT-10b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678465516891

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=DLCround-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 16:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 16:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:25:18] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-10 16:25:18] [INFO ] Transformed 3924 places.
[2023-03-10 16:25:18] [INFO ] Transformed 6192 transitions.
[2023-03-10 16:25:18] [INFO ] Found NUPN structural information;
[2023-03-10 16:25:18] [INFO ] Parsed PT model containing 3924 places and 6192 transitions and 17304 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
FORMULA DLCround-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 6192 rows 3924 cols
[2023-03-10 16:25:20] [INFO ] Computed 213 place invariants in 64 ms
[2023-03-10 16:25:21] [INFO ] After 1338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 16:25:22] [INFO ] [Nat]Absence check using 213 positive place invariants in 186 ms returned sat
[2023-03-10 16:25:27] [INFO ] After 4072ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-10 16:25:27] [INFO ] Deduced a trap composed of 183 places in 505 ms of which 8 ms to minimize.
[2023-03-10 16:25:28] [INFO ] Deduced a trap composed of 305 places in 454 ms of which 3 ms to minimize.
[2023-03-10 16:25:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1518 ms
[2023-03-10 16:25:30] [INFO ] Deduced a trap composed of 217 places in 553 ms of which 2 ms to minimize.
[2023-03-10 16:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 935 ms
[2023-03-10 16:25:32] [INFO ] After 8982ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1608 ms.
[2023-03-10 16:25:33] [INFO ] After 12081ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA DLCround-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA DLCround-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 545 ms.
Support contains 108 out of 3924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3924/3924 places, 6192/6192 transitions.
Graph (trivial) has 3418 edges and 3924 vertex of which 530 / 3924 are part of one of the 50 SCC in 14 ms
Free SCC test removed 480 places
Drop transitions removed 544 transitions
Reduce isomorphic transitions removed 544 transitions.
Drop transitions removed 1388 transitions
Trivial Post-agglo rules discarded 1388 transitions
Performed 1388 trivial Post agglomeration. Transition count delta: 1388
Iterating post reduction 0 with 1388 rules applied. Total rules applied 1389 place count 3444 transition count 4260
Reduce places removed 1388 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 1449 rules applied. Total rules applied 2838 place count 2056 transition count 4199
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 32 rules applied. Total rules applied 2870 place count 2028 transition count 4195
Reduce places removed 2 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 3 with 41 rules applied. Total rules applied 2911 place count 2026 transition count 4156
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 2952 place count 1987 transition count 4154
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 2952 place count 1987 transition count 4107
Deduced a syphon composed of 47 places in 20 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 3046 place count 1940 transition count 4107
Discarding 503 places :
Symmetric choice reduction at 5 with 503 rule applications. Total rules 3549 place count 1437 transition count 3604
Iterating global reduction 5 with 503 rules applied. Total rules applied 4052 place count 1437 transition count 3604
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 4062 place count 1437 transition count 3594
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4065 place count 1435 transition count 3593
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 209 Pre rules applied. Total rules applied 4065 place count 1435 transition count 3384
Deduced a syphon composed of 209 places in 17 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 7 with 418 rules applied. Total rules applied 4483 place count 1226 transition count 3384
Discarding 50 places :
Symmetric choice reduction at 7 with 50 rule applications. Total rules 4533 place count 1176 transition count 2709
Iterating global reduction 7 with 50 rules applied. Total rules applied 4583 place count 1176 transition count 2709
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 4593 place count 1176 transition count 2699
Performed 300 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 300 places in 2 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 8 with 600 rules applied. Total rules applied 5193 place count 876 transition count 2392
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 5199 place count 876 transition count 2386
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 5202 place count 873 transition count 2344
Iterating global reduction 9 with 3 rules applied. Total rules applied 5205 place count 873 transition count 2344
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -709
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 9 with 134 rules applied. Total rules applied 5339 place count 806 transition count 3053
Drop transitions removed 78 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 9 with 81 rules applied. Total rules applied 5420 place count 806 transition count 2972
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 5436 place count 790 transition count 2514
Iterating global reduction 10 with 16 rules applied. Total rules applied 5452 place count 790 transition count 2514
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 5460 place count 790 transition count 2506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 5464 place count 788 transition count 2524
Drop transitions removed 183 transitions
Redundant transition composition rules discarded 183 transitions
Iterating global reduction 11 with 183 rules applied. Total rules applied 5647 place count 788 transition count 2341
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 5653 place count 782 transition count 2240
Iterating global reduction 11 with 6 rules applied. Total rules applied 5659 place count 782 transition count 2240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 5666 place count 782 transition count 2233
Free-agglomeration rule applied 346 times with reduction of 109 identical transitions.
Iterating global reduction 12 with 346 rules applied. Total rules applied 6012 place count 782 transition count 1778
Reduce places removed 346 places and 0 transitions.
Drop transitions removed 361 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 369 transitions.
Graph (complete) has 1627 edges and 436 vertex of which 433 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 716 rules applied. Total rules applied 6728 place count 433 transition count 1409
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 6731 place count 433 transition count 1406
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 6748 place count 416 transition count 1351
Iterating global reduction 14 with 17 rules applied. Total rules applied 6765 place count 416 transition count 1351
Drop transitions removed 101 transitions
Redundant transition composition rules discarded 101 transitions
Iterating global reduction 14 with 101 rules applied. Total rules applied 6866 place count 416 transition count 1250
Discarding 11 places :
Symmetric choice reduction at 14 with 11 rule applications. Total rules 6877 place count 405 transition count 1213
Iterating global reduction 14 with 11 rules applied. Total rules applied 6888 place count 405 transition count 1213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 6890 place count 404 transition count 1225
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 6902 place count 404 transition count 1213
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 6903 place count 404 transition count 1212
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 6905 place count 404 transition count 1238
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 15 with 24 rules applied. Total rules applied 6929 place count 402 transition count 1216
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 16 with 17 rules applied. Total rules applied 6946 place count 402 transition count 1199
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 16 with 11 rules applied. Total rules applied 6957 place count 402 transition count 1199
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 6960 place count 402 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 6961 place count 401 transition count 1195
Iterating global reduction 16 with 1 rules applied. Total rules applied 6962 place count 401 transition count 1195
Applied a total of 6962 rules in 1186 ms. Remains 401 /3924 variables (removed 3523) and now considering 1195/6192 (removed 4997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1186 ms. Remains : 401/3924 places, 1195/6192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :3
FORMULA DLCround-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:25:35] [INFO ] Flow matrix only has 623 transitions (discarded 572 similar events)
// Phase 1: matrix 623 rows 401 cols
[2023-03-10 16:25:35] [INFO ] Computed 183 place invariants in 5 ms
[2023-03-10 16:25:35] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:25:35] [INFO ] [Nat]Absence check using 183 positive place invariants in 33 ms returned sat
[2023-03-10 16:25:36] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:25:36] [INFO ] State equation strengthened by 129 read => feed constraints.
[2023-03-10 16:25:36] [INFO ] After 131ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:25:36] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-10 16:25:36] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 59 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1195/1195 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 401 transition count 1186
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 392 transition count 1186
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 392 transition count 1174
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 42 place count 380 transition count 1174
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 380 transition count 1172
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 49 place count 375 transition count 1153
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 375 transition count 1153
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 82 place count 361 transition count 1139
Drop transitions removed 13 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 97 place count 361 transition count 1124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 101 place count 357 transition count 1099
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 357 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 357 transition count 1098
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 114 place count 353 transition count 1129
Drop transitions removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 134 place count 353 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 135 place count 352 transition count 1097
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 352 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 137 place count 352 transition count 1096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 139 place count 351 transition count 1106
Drop transitions removed 11 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 151 place count 351 transition count 1094
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 169 place count 351 transition count 1076
Graph (complete) has 1302 edges and 351 vertex of which 348 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 8 with 1 rules applied. Total rules applied 170 place count 348 transition count 1074
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 172 place count 348 transition count 1072
Free-agglomeration rule applied 24 times with reduction of 3 identical transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 196 place count 348 transition count 1045
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 73 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 74 transitions.
Graph (complete) has 1157 edges and 324 vertex of which 320 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 99 rules applied. Total rules applied 295 place count 320 transition count 971
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 305 place count 320 transition count 961
Discarding 14 places :
Symmetric choice reduction at 12 with 14 rule applications. Total rules 319 place count 306 transition count 925
Iterating global reduction 12 with 14 rules applied. Total rules applied 333 place count 306 transition count 925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 334 place count 306 transition count 924
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 341 place count 306 transition count 917
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 344 place count 306 transition count 917
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 345 place count 306 transition count 916
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 347 place count 305 transition count 915
Applied a total of 347 rules in 169 ms. Remains 305 /401 variables (removed 96) and now considering 915/1195 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 305/401 places, 915/1195 transitions.
Finished random walk after 6199 steps, including 1 resets, run visited all 2 properties in 38 ms. (steps per millisecond=163 )
FORMULA DLCround-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18444 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_10b
(NrP: 3924 NrTr: 6192 NrArc: 17304)

parse formulas
formulas created successfully
place and transition orderings generation:0m 2.355sec

net check time: 0m 0.003sec

init dd package: 0m 2.783sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8678012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104980 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.139sec

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="DLCround-PT-10b"
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 DLCround-PT-10b, 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 r106-tall-167814483100743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10b.tgz
mv DLCround-PT-10b 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;