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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 14:55 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.2K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 DLCflexbar-PT-4b-ReachabilityFireability-00
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-01
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-02
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-03
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-04
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-05
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-06
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-07
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-08
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-09
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-10
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-11
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-12
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-13
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-14
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678426990050

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=DLCflexbar-PT-4b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 05:43:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 05:43:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 05:43:11] [INFO ] Load time of PNML (sax parser for PT used): 394 ms
[2023-03-10 05:43:12] [INFO ] Transformed 11440 places.
[2023-03-10 05:43:12] [INFO ] Transformed 17128 transitions.
[2023-03-10 05:43:12] [INFO ] Found NUPN structural information;
[2023-03-10 05:43:12] [INFO ] Parsed PT model containing 11440 places and 17128 transitions and 46731 arcs in 819 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 17128 rows 11440 cols
[2023-03-10 05:43:14] [INFO ] Computed 608 place invariants in 126 ms
[2023-03-10 05:43:18] [INFO ] After 3982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 05:43:22] [INFO ] [Nat]Absence check using 608 positive place invariants in 1159 ms returned sat
[2023-03-10 05:43:43] [INFO ] After 18808ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-10 05:43:43] [INFO ] After 18827ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 05:43:43] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 249 ms.
Support contains 139 out of 11440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11440/11440 places, 17128/17128 transitions.
Graph (trivial) has 10263 edges and 11440 vertex of which 875 / 11440 are part of one of the 63 SCC in 30 ms
Free SCC test removed 812 places
Drop transitions removed 919 transitions
Reduce isomorphic transitions removed 919 transitions.
Drop transitions removed 5102 transitions
Trivial Post-agglo rules discarded 5102 transitions
Performed 5102 trivial Post agglomeration. Transition count delta: 5102
Iterating post reduction 0 with 5102 rules applied. Total rules applied 5103 place count 10628 transition count 11107
Reduce places removed 5102 places and 0 transitions.
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 1 with 5363 rules applied. Total rules applied 10466 place count 5526 transition count 10846
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 202 rules applied. Total rules applied 10668 place count 5397 transition count 10773
Reduce places removed 36 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 3 with 87 rules applied. Total rules applied 10755 place count 5361 transition count 10722
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 10807 place count 5310 transition count 10721
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 123 Pre rules applied. Total rules applied 10807 place count 5310 transition count 10598
Deduced a syphon composed of 123 places in 210 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 11053 place count 5187 transition count 10598
Discarding 1431 places :
Symmetric choice reduction at 5 with 1431 rule applications. Total rules 12484 place count 3756 transition count 9167
Iterating global reduction 5 with 1431 rules applied. Total rules applied 13915 place count 3756 transition count 9167
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 5 with 28 rules applied. Total rules applied 13943 place count 3756 transition count 9139
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 13961 place count 3744 transition count 9133
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 572 Pre rules applied. Total rules applied 13961 place count 3744 transition count 8561
Deduced a syphon composed of 572 places in 138 ms
Reduce places removed 572 places and 0 transitions.
Iterating global reduction 7 with 1144 rules applied. Total rules applied 15105 place count 3172 transition count 8561
Discarding 99 places :
Symmetric choice reduction at 7 with 99 rule applications. Total rules 15204 place count 3073 transition count 6816
Iterating global reduction 7 with 99 rules applied. Total rules applied 15303 place count 3073 transition count 6816
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 7 with 76 rules applied. Total rules applied 15379 place count 3073 transition count 6740
Performed 772 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 772 places in 2 ms
Reduce places removed 772 places and 0 transitions.
Iterating global reduction 8 with 1544 rules applied. Total rules applied 16923 place count 2301 transition count 5964
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 16927 place count 2301 transition count 5960
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 16928 place count 2300 transition count 5911
Iterating global reduction 9 with 1 rules applied. Total rules applied 16929 place count 2300 transition count 5911
Performed 101 Post agglomeration using F-continuation condition with reduction of 138 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 17131 place count 2199 transition count 6539
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 17136 place count 2199 transition count 6534
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 17163 place count 2172 transition count 6210
Iterating global reduction 10 with 27 rules applied. Total rules applied 17190 place count 2172 transition count 6210
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 10 with 133 rules applied. Total rules applied 17323 place count 2172 transition count 6077
Performed 75 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 11 with 150 rules applied. Total rules applied 17473 place count 2097 transition count 6651
Drop transitions removed 57 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 11 with 59 rules applied. Total rules applied 17532 place count 2097 transition count 6592
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 17540 place count 2089 transition count 6493
Iterating global reduction 12 with 8 rules applied. Total rules applied 17548 place count 2089 transition count 6493
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 17586 place count 2089 transition count 6455
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 13 with 82 rules applied. Total rules applied 17668 place count 2089 transition count 6373
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 17674 place count 2083 transition count 6367
Iterating global reduction 13 with 6 rules applied. Total rules applied 17680 place count 2083 transition count 6367
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 17686 place count 2077 transition count 6055
Iterating global reduction 13 with 6 rules applied. Total rules applied 17692 place count 2077 transition count 6055
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 17698 place count 2077 transition count 6049
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 17708 place count 2072 transition count 6044
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 17712 place count 2068 transition count 5835
Iterating global reduction 14 with 4 rules applied. Total rules applied 17716 place count 2068 transition count 5835
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 17720 place count 2068 transition count 5831
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 17722 place count 2067 transition count 5841
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 17723 place count 2067 transition count 5840
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 16 with 9 rules applied. Total rules applied 17732 place count 2067 transition count 5831
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 17734 place count 2066 transition count 5841
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17735 place count 2066 transition count 5840
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 17 with 9 rules applied. Total rules applied 17744 place count 2066 transition count 5831
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 17 with 2 rules applied. Total rules applied 17746 place count 2065 transition count 5843
Free-agglomeration rule applied 1108 times with reduction of 545 identical transitions.
Iterating global reduction 17 with 1108 rules applied. Total rules applied 18854 place count 2065 transition count 4190
Reduce places removed 1108 places and 0 transitions.
Drop transitions removed 1249 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 1261 transitions.
Graph (complete) has 3433 edges and 957 vertex of which 905 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Iterating post reduction 17 with 2370 rules applied. Total rules applied 21224 place count 905 transition count 2895
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 18 with 53 rules applied. Total rules applied 21277 place count 905 transition count 2842
Discarding 138 places :
Symmetric choice reduction at 19 with 138 rule applications. Total rules 21415 place count 767 transition count 2516
Iterating global reduction 19 with 138 rules applied. Total rules applied 21553 place count 767 transition count 2516
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 21556 place count 767 transition count 2513
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 20 with 81 rules applied. Total rules applied 21637 place count 767 transition count 2432
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 20 with 8 rules applied. Total rules applied 21645 place count 767 transition count 2432
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 21646 place count 767 transition count 2431
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 21647 place count 766 transition count 2430
Iterating global reduction 20 with 1 rules applied. Total rules applied 21648 place count 766 transition count 2430
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 21649 place count 765 transition count 2390
Iterating global reduction 20 with 1 rules applied. Total rules applied 21650 place count 765 transition count 2390
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 21651 place count 765 transition count 2389
Applied a total of 21651 rules in 4871 ms. Remains 765 /11440 variables (removed 10675) and now considering 2389/17128 (removed 14739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4873 ms. Remains : 765/11440 places, 2389/17128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 9) seen :7
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 05:43:48] [INFO ] Flow matrix only has 1002 transitions (discarded 1387 similar events)
// Phase 1: matrix 1002 rows 765 cols
[2023-03-10 05:43:48] [INFO ] Computed 429 place invariants in 15 ms
[2023-03-10 05:43:49] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 05:43:49] [INFO ] [Nat]Absence check using 429 positive place invariants in 69 ms returned sat
[2023-03-10 05:43:49] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 05:43:49] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-10 05:43:50] [INFO ] After 318ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 05:43:50] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-10 05:43:50] [INFO ] After 1571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 73 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 2389/2389 transitions.
Graph (trivial) has 107 edges and 765 vertex of which 2 / 765 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 2889 edges and 764 vertex of which 745 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 745 transition count 2327
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 58 place count 735 transition count 2324
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 732 transition count 2324
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 61 place count 732 transition count 2307
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 95 place count 715 transition count 2307
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 112 place count 715 transition count 2290
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 148 place count 679 transition count 2011
Iterating global reduction 4 with 36 rules applied. Total rules applied 184 place count 679 transition count 2011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 679 transition count 2010
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 205 place count 669 transition count 2000
Drop transitions removed 33 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 252 place count 669 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 255 place count 666 transition count 1946
Iterating global reduction 6 with 3 rules applied. Total rules applied 258 place count 666 transition count 1946
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 270 place count 666 transition count 1934
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 274 place count 664 transition count 1945
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 285 place count 664 transition count 1934
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 298 place count 664 transition count 1921
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 301 place count 661 transition count 1910
Iterating global reduction 8 with 3 rules applied. Total rules applied 304 place count 661 transition count 1910
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 317 place count 661 transition count 1897
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 318 place count 660 transition count 1853
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 660 transition count 1853
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 9 with 2 rules applied. Total rules applied 321 place count 659 transition count 1852
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 331 place count 659 transition count 1842
Free-agglomeration rule applied 31 times with reduction of 7 identical transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 362 place count 659 transition count 1804
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 162 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 2107 edges and 628 vertex of which 616 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 9 with 199 rules applied. Total rules applied 561 place count 616 transition count 1631
Drop transitions removed 11 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 580 place count 616 transition count 1612
Discarding 33 places :
Symmetric choice reduction at 11 with 33 rule applications. Total rules 613 place count 583 transition count 1547
Iterating global reduction 11 with 33 rules applied. Total rules applied 646 place count 583 transition count 1547
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 660 place count 583 transition count 1533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 661 place count 582 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 665 place count 578 transition count 1524
Iterating global reduction 12 with 4 rules applied. Total rules applied 669 place count 578 transition count 1524
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 671 place count 578 transition count 1524
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 673 place count 578 transition count 1522
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 677 place count 576 transition count 1520
Applied a total of 677 rules in 303 ms. Remains 576 /765 variables (removed 189) and now considering 1520/2389 (removed 869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 576/765 places, 1520/2389 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2672 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=222 )
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 39695 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: DLCflexbar_PT_4b
(NrP: 11440 NrTr: 17128 NrArc: 46731)

parse formulas
formulas created successfully
place and transition orderings generation:0m20.559sec

net check time: 0m 0.008sec

init dd package: 0m 2.753sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6632680 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100420 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 2.108sec

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="DLCflexbar-PT-4b"
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 DLCflexbar-PT-4b, 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-167814482900551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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