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-167814483200775.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-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483200775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 5.9K Feb 25 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:19 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 4.0K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 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.9M 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-12b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678473452956

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-12b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 18:37:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 18:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:37:34] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2023-03-10 18:37:34] [INFO ] Transformed 4848 places.
[2023-03-10 18:37:34] [INFO ] Transformed 7836 transitions.
[2023-03-10 18:37:34] [INFO ] Found NUPN structural information;
[2023-03-10 18:37:34] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 16) seen :7
FORMULA DLCround-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 7836 rows 4848 cols
[2023-03-10 18:37:36] [INFO ] Computed 277 place invariants in 57 ms
[2023-03-10 18:37:38] [INFO ] [Real]Absence check using 277 positive place invariants in 309 ms returned sat
[2023-03-10 18:37:38] [INFO ] After 1921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-10 18:37:39] [INFO ] [Nat]Absence check using 277 positive place invariants in 280 ms returned sat
[2023-03-10 18:37:45] [INFO ] After 5426ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-10 18:37:50] [INFO ] After 9820ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 2257 ms.
[2023-03-10 18:37:52] [INFO ] After 14239ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA DLCround-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA DLCround-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 630 ms.
Support contains 105 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4249 edges and 4848 vertex of which 683 / 4848 are part of one of the 55 SCC in 16 ms
Free SCC test removed 628 places
Drop transitions removed 705 transitions
Reduce isomorphic transitions removed 705 transitions.
Drop transitions removed 1692 transitions
Trivial Post-agglo rules discarded 1692 transitions
Performed 1692 trivial Post agglomeration. Transition count delta: 1692
Iterating post reduction 0 with 1692 rules applied. Total rules applied 1693 place count 4220 transition count 5439
Reduce places removed 1692 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1763 rules applied. Total rules applied 3456 place count 2528 transition count 5368
Reduce places removed 30 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 34 rules applied. Total rules applied 3490 place count 2498 transition count 5364
Reduce places removed 2 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 3 with 26 rules applied. Total rules applied 3516 place count 2496 transition count 5340
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 3540 place count 2472 transition count 5340
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 3540 place count 2472 transition count 5301
Deduced a syphon composed of 39 places in 44 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 3618 place count 2433 transition count 5301
Discarding 644 places :
Symmetric choice reduction at 5 with 644 rule applications. Total rules 4262 place count 1789 transition count 4657
Iterating global reduction 5 with 644 rules applied. Total rules applied 4906 place count 1789 transition count 4657
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 8 rules applied. Total rules applied 4914 place count 1789 transition count 4649
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 4917 place count 1787 transition count 4648
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 273 Pre rules applied. Total rules applied 4917 place count 1787 transition count 4375
Deduced a syphon composed of 273 places in 31 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 7 with 546 rules applied. Total rules applied 5463 place count 1514 transition count 4375
Discarding 63 places :
Symmetric choice reduction at 7 with 63 rule applications. Total rules 5526 place count 1451 transition count 3394
Iterating global reduction 7 with 63 rules applied. Total rules applied 5589 place count 1451 transition count 3394
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 5606 place count 1451 transition count 3377
Performed 375 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 375 places in 1 ms
Reduce places removed 375 places and 0 transitions.
Iterating global reduction 8 with 750 rules applied. Total rules applied 6356 place count 1076 transition count 2994
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 6365 place count 1076 transition count 2985
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 6368 place count 1073 transition count 2937
Iterating global reduction 9 with 3 rules applied. Total rules applied 6371 place count 1073 transition count 2937
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -260
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 9 with 64 rules applied. Total rules applied 6435 place count 1041 transition count 3197
Drop transitions removed 33 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 9 with 37 rules applied. Total rules applied 6472 place count 1041 transition count 3160
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6476 place count 1037 transition count 3047
Iterating global reduction 10 with 4 rules applied. Total rules applied 6480 place count 1037 transition count 3047
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 6483 place count 1037 transition count 3044
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 6489 place count 1034 transition count 3081
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 11 with 74 rules applied. Total rules applied 6563 place count 1034 transition count 3007
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 6569 place count 1028 transition count 3001
Iterating global reduction 11 with 6 rules applied. Total rules applied 6575 place count 1028 transition count 3001
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 6581 place count 1022 transition count 2903
Iterating global reduction 11 with 6 rules applied. Total rules applied 6587 place count 1022 transition count 2903
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 6593 place count 1022 transition count 2897
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 6617 place count 1010 transition count 2885
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 6627 place count 1000 transition count 2720
Iterating global reduction 12 with 10 rules applied. Total rules applied 6637 place count 1000 transition count 2720
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 6646 place count 1000 transition count 2711
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 6652 place count 997 transition count 2743
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 6653 place count 997 transition count 2742
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 6662 place count 997 transition count 2733
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 6664 place count 996 transition count 2745
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 6665 place count 996 transition count 2744
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 6674 place count 996 transition count 2735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 6676 place count 995 transition count 2747
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 6677 place count 995 transition count 2746
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 16 with 9 rules applied. Total rules applied 6686 place count 995 transition count 2737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 6688 place count 994 transition count 2750
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 6689 place count 994 transition count 2749
Free-agglomeration rule applied 492 times with reduction of 177 identical transitions.
Iterating global reduction 17 with 492 rules applied. Total rules applied 7181 place count 994 transition count 2080
Reduce places removed 492 places and 0 transitions.
Drop transitions removed 514 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 525 transitions.
Iterating post reduction 17 with 1017 rules applied. Total rules applied 8198 place count 502 transition count 1555
Discarding 56 places :
Symmetric choice reduction at 18 with 56 rule applications. Total rules 8254 place count 446 transition count 1396
Iterating global reduction 18 with 56 rules applied. Total rules applied 8310 place count 446 transition count 1396
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 18 with 16 rules applied. Total rules applied 8326 place count 438 transition count 1487
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 18 with 86 rules applied. Total rules applied 8412 place count 438 transition count 1401
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 8414 place count 436 transition count 1369
Iterating global reduction 19 with 2 rules applied. Total rules applied 8416 place count 436 transition count 1369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 8417 place count 436 transition count 1368
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 20 with 90 rules applied. Total rules applied 8507 place count 436 transition count 1278
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 8508 place count 436 transition count 1277
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 20 with 13 rules applied. Total rules applied 8521 place count 435 transition count 1265
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 21 with 7 rules applied. Total rules applied 8528 place count 435 transition count 1265
Applied a total of 8528 rules in 2070 ms. Remains 435 /4848 variables (removed 4413) and now considering 1265/7836 (removed 6571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2070 ms. Remains : 435/4848 places, 1265/7836 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :3
FORMULA DLCround-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:37:55] [INFO ] Flow matrix only has 572 transitions (discarded 693 similar events)
// Phase 1: matrix 572 rows 435 cols
[2023-03-10 18:37:55] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-10 18:37:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:37:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 28 ms returned sat
[2023-03-10 18:37:55] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:37:55] [INFO ] State equation strengthened by 139 read => feed constraints.
[2023-03-10 18:37:55] [INFO ] After 54ms SMT Verify possible using 139 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 18:37:55] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-10 18:37:55] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1265/1265 transitions.
Graph (trivial) has 195 edges and 435 vertex of which 20 / 435 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions removed 20 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 423 transition count 1219
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 408 transition count 1218
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 32 place count 408 transition count 1198
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 72 place count 388 transition count 1198
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 388 transition count 1194
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 379 transition count 1128
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 379 transition count 1128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 379 transition count 1126
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 148 place count 353 transition count 1100
Drop transitions removed 101 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 4 with 109 rules applied. Total rules applied 257 place count 353 transition count 991
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 257 place count 353 transition count 990
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 352 transition count 990
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 352 transition count 988
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 299 place count 314 transition count 860
Iterating global reduction 6 with 38 rules applied. Total rules applied 337 place count 314 transition count 860
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 340 place count 314 transition count 857
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 352 place count 308 transition count 888
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 375 place count 308 transition count 865
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 419 place count 308 transition count 821
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 423 place count 304 transition count 778
Iterating global reduction 8 with 4 rules applied. Total rules applied 427 place count 304 transition count 778
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 431 place count 304 transition count 774
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 435 place count 302 transition count 790
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 439 place count 302 transition count 786
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 454 place count 302 transition count 771
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 456 place count 301 transition count 773
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 460 place count 301 transition count 769
Free-agglomeration rule applied 50 times with reduction of 12 identical transitions.
Iterating global reduction 10 with 50 rules applied. Total rules applied 510 place count 301 transition count 707
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 249 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 252 transitions.
Graph (complete) has 683 edges and 251 vertex of which 197 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 53 output transitions
Drop transitions removed 53 transitions
Iterating post reduction 10 with 303 rules applied. Total rules applied 813 place count 197 transition count 402
Drop transitions removed 25 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 27 rules applied. Total rules applied 840 place count 197 transition count 375
Discarding 60 places :
Symmetric choice reduction at 12 with 60 rule applications. Total rules 900 place count 137 transition count 292
Iterating global reduction 12 with 60 rules applied. Total rules applied 960 place count 137 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 962 place count 136 transition count 291
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 395 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 7 rules applied. Total rules applied 969 place count 135 transition count 285
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 974 place count 130 transition count 279
Iterating global reduction 13 with 5 rules applied. Total rules applied 979 place count 130 transition count 279
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 988 place count 130 transition count 270
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 990 place count 129 transition count 269
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 13 with 12 rules applied. Total rules applied 1002 place count 129 transition count 257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1006 place count 127 transition count 268
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1007 place count 127 transition count 267
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 14 with 13 rules applied. Total rules applied 1020 place count 127 transition count 254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1024 place count 125 transition count 262
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1032 place count 125 transition count 254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1034 place count 124 transition count 260
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1042 place count 124 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1044 place count 123 transition count 258
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1052 place count 123 transition count 250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1054 place count 122 transition count 256
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1062 place count 122 transition count 248
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1064 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 1076 place count 120 transition count 236
Applied a total of 1076 rules in 192 ms. Remains 120 /435 variables (removed 315) and now considering 236/1265 (removed 1029) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 120/435 places, 236/1265 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished Best-First random walk after 426 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=213 )
FORMULA DLCround-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 21659 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_12b
(NrP: 4848 NrTr: 7836 NrArc: 22188)

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

net check time: 0m 0.003sec

init dd package: 0m 2.720sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8602836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101228 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.230sec

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-12b"
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-12b, 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-167814483200775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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