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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 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.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 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.3M 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-09b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678462105188

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-09b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 15:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:28:26] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-10 15:28:26] [INFO ] Transformed 3495 places.
[2023-03-10 15:28:26] [INFO ] Transformed 5439 transitions.
[2023-03-10 15:28:26] [INFO ] Found NUPN structural information;
[2023-03-10 15:28:26] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 16) seen :9
FORMULA DLCround-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 5439 rows 3495 cols
[2023-03-10 15:28:27] [INFO ] Computed 184 place invariants in 50 ms
[2023-03-10 15:28:28] [INFO ] After 1046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 15:28:29] [INFO ] [Nat]Absence check using 184 positive place invariants in 144 ms returned sat
[2023-03-10 15:28:33] [INFO ] After 3195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-10 15:28:34] [INFO ] Deduced a trap composed of 134 places in 476 ms of which 7 ms to minimize.
[2023-03-10 15:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 826 ms
[2023-03-10 15:28:36] [INFO ] Deduced a trap composed of 123 places in 884 ms of which 2 ms to minimize.
[2023-03-10 15:28:37] [INFO ] Deduced a trap composed of 199 places in 901 ms of which 2 ms to minimize.
[2023-03-10 15:28:38] [INFO ] Deduced a trap composed of 203 places in 867 ms of which 3 ms to minimize.
[2023-03-10 15:28:39] [INFO ] Deduced a trap composed of 200 places in 866 ms of which 2 ms to minimize.
[2023-03-10 15:28:40] [INFO ] Deduced a trap composed of 122 places in 821 ms of which 2 ms to minimize.
[2023-03-10 15:28:41] [INFO ] Deduced a trap composed of 206 places in 732 ms of which 1 ms to minimize.
[2023-03-10 15:28:42] [INFO ] Deduced a trap composed of 202 places in 734 ms of which 2 ms to minimize.
[2023-03-10 15:28:43] [INFO ] Deduced a trap composed of 205 places in 715 ms of which 2 ms to minimize.
[2023-03-10 15:28:44] [INFO ] Deduced a trap composed of 204 places in 761 ms of which 1 ms to minimize.
[2023-03-10 15:28:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 8806 ms
[2023-03-10 15:28:45] [INFO ] Deduced a trap composed of 235 places in 583 ms of which 1 ms to minimize.
[2023-03-10 15:28:46] [INFO ] Deduced a trap composed of 206 places in 557 ms of which 2 ms to minimize.
[2023-03-10 15:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1634 ms
[2023-03-10 15:28:46] [INFO ] After 16371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1395 ms.
[2023-03-10 15:28:48] [INFO ] After 19070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA DLCround-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 262 ms.
Support contains 86 out of 3495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3084 edges and 3495 vertex of which 483 / 3495 are part of one of the 43 SCC in 16 ms
Free SCC test removed 440 places
Drop transitions removed 497 transitions
Reduce isomorphic transitions removed 497 transitions.
Drop transitions removed 1268 transitions
Trivial Post-agglo rules discarded 1268 transitions
Performed 1268 trivial Post agglomeration. Transition count delta: 1268
Iterating post reduction 0 with 1268 rules applied. Total rules applied 1269 place count 3055 transition count 3674
Reduce places removed 1268 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 1330 rules applied. Total rules applied 2599 place count 1787 transition count 3612
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 2632 place count 1759 transition count 3607
Reduce places removed 2 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 3 with 32 rules applied. Total rules applied 2664 place count 1757 transition count 3577
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 32 rules applied. Total rules applied 2696 place count 1727 transition count 3575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2697 place count 1726 transition count 3575
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 2697 place count 1726 transition count 3545
Deduced a syphon composed of 30 places in 47 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2757 place count 1696 transition count 3545
Discarding 439 places :
Symmetric choice reduction at 6 with 439 rule applications. Total rules 3196 place count 1257 transition count 3106
Iterating global reduction 6 with 439 rules applied. Total rules applied 3635 place count 1257 transition count 3106
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 6 with 8 rules applied. Total rules applied 3643 place count 1257 transition count 3098
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 3646 place count 1255 transition count 3097
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 181 Pre rules applied. Total rules applied 3646 place count 1255 transition count 2916
Deduced a syphon composed of 181 places in 11 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 8 with 362 rules applied. Total rules applied 4008 place count 1074 transition count 2916
Discarding 41 places :
Symmetric choice reduction at 8 with 41 rule applications. Total rules 4049 place count 1033 transition count 2413
Iterating global reduction 8 with 41 rules applied. Total rules applied 4090 place count 1033 transition count 2413
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 4102 place count 1033 transition count 2401
Performed 266 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 266 places in 2 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 9 with 532 rules applied. Total rules applied 4634 place count 767 transition count 2130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 4640 place count 767 transition count 2124
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4646 place count 761 transition count 2046
Iterating global reduction 10 with 6 rules applied. Total rules applied 4652 place count 761 transition count 2046
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -500
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 4754 place count 710 transition count 2546
Drop transitions removed 43 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 10 with 47 rules applied. Total rules applied 4801 place count 710 transition count 2499
Renaming transitions due to excessive name length > 1024 char.
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 4812 place count 699 transition count 2228
Iterating global reduction 11 with 11 rules applied. Total rules applied 4823 place count 699 transition count 2228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 4831 place count 699 transition count 2220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 4837 place count 696 transition count 2250
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 12 with 136 rules applied. Total rules applied 4973 place count 696 transition count 2114
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 4979 place count 690 transition count 2028
Iterating global reduction 12 with 6 rules applied. Total rules applied 4985 place count 690 transition count 2028
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 4990 place count 690 transition count 2023
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 4991 place count 690 transition count 2022
Free-agglomeration rule applied 333 times with reduction of 141 identical transitions.
Iterating global reduction 13 with 333 rules applied. Total rules applied 5324 place count 690 transition count 1548
Reduce places removed 333 places and 0 transitions.
Drop transitions removed 336 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 1288 edges and 357 vertex of which 353 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 682 rules applied. Total rules applied 6006 place count 353 transition count 1200
Discarding 43 places :
Symmetric choice reduction at 14 with 43 rule applications. Total rules 6049 place count 310 transition count 1025
Iterating global reduction 14 with 43 rules applied. Total rules applied 6092 place count 310 transition count 1025
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 6101 place count 310 transition count 1016
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 15 with 94 rules applied. Total rules applied 6195 place count 310 transition count 922
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 6197 place count 308 transition count 922
Discarding 17 places :
Symmetric choice reduction at 16 with 17 rule applications. Total rules 6214 place count 291 transition count 855
Iterating global reduction 16 with 17 rules applied. Total rules applied 6231 place count 291 transition count 855
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 6232 place count 291 transition count 872
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 6238 place count 290 transition count 867
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 6243 place count 290 transition count 862
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 6251 place count 290 transition count 862
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 6252 place count 290 transition count 861
Applied a total of 6252 rules in 1156 ms. Remains 290 /3495 variables (removed 3205) and now considering 861/5439 (removed 4578) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 290/3495 places, 861/5439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
FORMULA DLCround-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
FORMULA DLCround-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-10 15:28:49] [INFO ] Flow matrix only has 491 transitions (discarded 370 similar events)
// Phase 1: matrix 491 rows 290 cols
[2023-03-10 15:28:49] [INFO ] Computed 119 place invariants in 7 ms
[2023-03-10 15:28:49] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 15:28:50] [INFO ] [Nat]Absence check using 119 positive place invariants in 14 ms returned sat
[2023-03-10 15:28:50] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:50] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-10 15:28:50] [INFO ] After 74ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:50] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-10 15:28:50] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 41 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 861/861 transitions.
Graph (trivial) has 96 edges and 290 vertex of which 14 / 290 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 27 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 991 edges and 281 vertex of which 279 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 279 transition count 825
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 273 transition count 824
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 273 transition count 815
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 264 transition count 815
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 264 transition count 814
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 44 place count 255 transition count 757
Iterating global reduction 3 with 9 rules applied. Total rules applied 53 place count 255 transition count 757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 255 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 255 transition count 753
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 254 transition count 753
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 74 place count 246 transition count 745
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 87 place count 246 transition count 732
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 93 place count 240 transition count 702
Iterating global reduction 5 with 6 rules applied. Total rules applied 99 place count 240 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 101 place count 240 transition count 700
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 113 place count 234 transition count 741
Drop transitions removed 30 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 151 place count 234 transition count 703
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 153 place count 232 transition count 688
Iterating global reduction 7 with 2 rules applied. Total rules applied 155 place count 232 transition count 688
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 163 place count 232 transition count 680
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 174 place count 232 transition count 669
Free-agglomeration rule applied 19 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 19 rules applied. Total rules applied 193 place count 232 transition count 646
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 88 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 686 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 8 with 113 rules applied. Total rules applied 306 place count 209 transition count 551
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 311 place count 209 transition count 546
Discarding 13 places :
Symmetric choice reduction at 10 with 13 rule applications. Total rules 324 place count 196 transition count 519
Iterating global reduction 10 with 13 rules applied. Total rules applied 337 place count 196 transition count 519
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 348 place count 196 transition count 508
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 349 place count 195 transition count 503
Iterating global reduction 10 with 1 rules applied. Total rules applied 350 place count 195 transition count 503
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 352 place count 195 transition count 503
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 353 place count 195 transition count 502
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 10 with 2 rules applied. Total rules applied 355 place count 194 transition count 501
Applied a total of 355 rules in 142 ms. Remains 194 /290 variables (removed 96) and now considering 501/861 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 194/290 places, 501/861 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 922462 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922462 steps, saw 679772 distinct states, run finished after 3003 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 15:28:53] [INFO ] Flow matrix only has 281 transitions (discarded 220 similar events)
// Phase 1: matrix 281 rows 194 cols
[2023-03-10 15:28:53] [INFO ] Computed 93 place invariants in 2 ms
[2023-03-10 15:28:53] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 15:28:53] [INFO ] [Nat]Absence check using 93 positive place invariants in 10 ms returned sat
[2023-03-10 15:28:53] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:53] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-10 15:28:53] [INFO ] After 60ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:53] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-10 15:28:54] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 41 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 501/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 194 /194 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 194/194 places, 501/501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 501/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 194 /194 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-10 15:28:54] [INFO ] Flow matrix only has 281 transitions (discarded 220 similar events)
[2023-03-10 15:28:54] [INFO ] Invariant cache hit.
[2023-03-10 15:28:54] [INFO ] Implicit Places using invariants in 102 ms returned [49, 153, 166, 167, 171, 172, 176, 177, 178, 183, 184, 187, 190, 191]
Discarding 14 places :
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Implicit Place search using SMT only with invariants took 105 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/194 places, 485/501 transitions.
Graph (trivial) has 34 edges and 180 vertex of which 13 / 180 are part of one of the 6 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 49 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 171 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 171 transition count 429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 168 transition count 426
Drop transitions removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 28 place count 168 transition count 409
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 165 transition count 404
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 165 transition count 404
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 1 with 98 rules applied. Total rules applied 132 place count 165 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 133 place count 164 transition count 306
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 160 place count 137 transition count 254
Iterating global reduction 2 with 27 rules applied. Total rules applied 187 place count 137 transition count 254
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 137 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 136 transition count 253
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 136 transition count 250
Graph (complete) has 358 edges and 136 vertex of which 132 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 132 transition count 250
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 199 place count 132 transition count 244
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 204 place count 132 transition count 244
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 132 transition count 243
Applied a total of 205 rules in 42 ms. Remains 132 /180 variables (removed 48) and now considering 243/485 (removed 242) transitions.
[2023-03-10 15:28:54] [INFO ] Flow matrix only has 210 transitions (discarded 33 similar events)
// Phase 1: matrix 210 rows 132 cols
[2023-03-10 15:28:54] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-10 15:28:54] [INFO ] Implicit Places using invariants in 74 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 131/194 places, 243/501 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 131 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 242
Performed 4 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 126 transition count 230
Drop transitions removed 6 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 27 place count 126 transition count 213
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 122 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 122 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 121 transition count 207
Applied a total of 37 rules in 11 ms. Remains 121 /131 variables (removed 10) and now considering 207/243 (removed 36) transitions.
[2023-03-10 15:28:54] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
// Phase 1: matrix 182 rows 121 cols
[2023-03-10 15:28:54] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-10 15:28:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 15:28:54] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2023-03-10 15:28:54] [INFO ] Invariant cache hit.
[2023-03-10 15:28:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 15:28:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 121/194 places, 207/501 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 393 ms. Remains : 121/194 places, 207/501 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1687779 steps, run timeout after 3001 ms. (steps per millisecond=562 ) properties seen :{}
Probabilistic random walk after 1687779 steps, saw 1197747 distinct states, run finished after 3001 ms. (steps per millisecond=562 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 15:28:57] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2023-03-10 15:28:57] [INFO ] Invariant cache hit.
[2023-03-10 15:28:57] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 15:28:57] [INFO ] [Nat]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-10 15:28:57] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 15:28:57] [INFO ] After 39ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:57] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 15:28:57] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 207/207 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 121/121 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 207/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-10 15:28:57] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2023-03-10 15:28:57] [INFO ] Invariant cache hit.
[2023-03-10 15:28:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-10 15:28:57] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2023-03-10 15:28:57] [INFO ] Invariant cache hit.
[2023-03-10 15:28:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 15:28:57] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-10 15:28:57] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-10 15:28:57] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2023-03-10 15:28:57] [INFO ] Invariant cache hit.
[2023-03-10 15:28:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 121/121 places, 207/207 transitions.
Graph (trivial) has 49 edges and 121 vertex of which 18 / 121 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 28 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 230 edges and 112 vertex of which 101 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 101 transition count 152
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 100 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 98 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 97 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 97 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 95 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 95 transition count 146
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 24 place count 95 transition count 137
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 27 place count 93 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 28 place count 92 transition count 136
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 29 place count 91 transition count 135
Iterating global reduction 6 with 1 rules applied. Total rules applied 30 place count 91 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 31 place count 91 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 32 place count 90 transition count 134
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 37 place count 90 transition count 134
Applied a total of 37 rules in 15 ms. Remains 90 /121 variables (removed 31) and now considering 134/207 (removed 73) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 90 cols
[2023-03-10 15:28:58] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-10 15:28:58] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 15:28:58] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2023-03-10 15:28:58] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:58] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 15:28:58] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 15:28:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-10 15:28:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 207 transitions and 832 arcs took 1 ms.
[2023-03-10 15:28:58] [INFO ] Flatten gal took : 66 ms
Total runtime 31973 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_09b
(NrP: 121 NrTr: 207 NrArc: 832)

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

net check time: 0m 0.000sec

init dd package: 0m 2.655sec


RS generation: 0m 0.106sec


-> reachability set: #nodes 6657 (6.7e+03) #states 2,296,381,955,112,961 (15)



starting MCC model checker
--------------------------

checking: AG [[[[[1<=p106 & p106<=1] | [p55<=0 & 0<=p55]] | [[p120<=0 & 0<=p120] | [[p30<=0 & 0<=p30] | [p76<=0 & 0<=p76]]]] | [[[p4<=0 & 0<=p4] | [[[[p109<=0 & 0<=p109] & [[p32<=0 & 0<=p32] & [p94<=0 & 0<=p94]]] & [[[p53<=1 & 1<=p53] & [p118<=1 & 1<=p118]] & [[p92<=1 & 1<=p92] & [p59<=1 & 1<=p59]]]] | [[[p28<=1 & 1<=p28] & [p103<=1 & 1<=p103]] & [[[p47<=0 & 0<=p47] | [p114<=0 & 0<=p114]] & [[[p6<=0 & 0<=p6] | [p19<=1 & 1<=p19]] | [[p13<=0 & 0<=p13] | [p86<=0 & 0<=p86]]]]]]] | [[[[[[p51<=0 & 0<=p51] | [[p116<=0 & 0<=p116] | [p101<=0 & 0<=p101]]] & [[p25<=0 & 0<=p25] | [[p28<=0 & 0<=p28] | [p105<=0 & 0<=p105]]]] | [[p82<=0 & 0<=p82] & [[p46<=0 & 0<=p46] | [p78<=0 & 0<=p78]]]] & [[p35<=1 & 1<=p35] | [p100<=1 & 1<=p100]]] | [[[p9<=0 & 0<=p9] & [[p44<=0 & 0<=p44] & [[p2<=0 & 0<=p2] | [[p49<=1 & 1<=p49] & [p112<=1 & 1<=p112]]]]] | [[p23<=1 & 1<=p23] & [[p14<=1 & 1<=p14] & [[p84<=0 & 0<=p84] | [[p18<=1 & 1<=p18] & [p75<=1 & 1<=p75]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p14<=1 & 1<=p14] & [[p84<=0 & 0<=p84] | [[p18<=1 & 1<=p18] & [p75<=1 & 1<=p75]]]] & [p23<=1 & 1<=p23]] | [[[[[p49<=1 & 1<=p49] & [p112<=1 & 1<=p112]] | [p2<=0 & 0<=p2]] & [p44<=0 & 0<=p44]] & [p9<=0 & 0<=p9]]] | [[[p100<=1 & 1<=p100] | [p35<=1 & 1<=p35]] & [[[[p78<=0 & 0<=p78] | [p46<=0 & 0<=p46]] & [p82<=0 & 0<=p82]] | [[[[p105<=0 & 0<=p105] | [p28<=0 & 0<=p28]] | [p25<=0 & 0<=p25]] & [[[p101<=0 & 0<=p101] | [p116<=0 & 0<=p116]] | [p51<=0 & 0<=p51]]]]]] | [[[[[[[p86<=0 & 0<=p86] | [p13<=0 & 0<=p13]] | [[p19<=1 & 1<=p19] | [p6<=0 & 0<=p6]]] & [[p114<=0 & 0<=p114] | [p47<=0 & 0<=p47]]] & [[p103<=1 & 1<=p103] & [p28<=1 & 1<=p28]]] | [[[[p59<=1 & 1<=p59] & [p92<=1 & 1<=p92]] & [[p118<=1 & 1<=p118] & [p53<=1 & 1<=p53]]] & [[[p94<=0 & 0<=p94] & [p32<=0 & 0<=p32]] & [p109<=0 & 0<=p109]]]] | [p4<=0 & 0<=p4]]] | [[[[p76<=0 & 0<=p76] | [p30<=0 & 0<=p30]] | [p120<=0 & 0<=p120]] | [[p55<=0 & 0<=p55] | [1<=p106 & p106<=1]]]]]]]

abstracting: (p106<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p106)
states: 765,460,651,704,320 (14)
abstracting: (0<=p55)
states: 2,296,381,955,112,961 (15)
abstracting: (p55<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p120)
states: 2,296,381,955,112,961 (15)
abstracting: (p120<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p30)
states: 2,296,381,955,112,961 (15)
abstracting: (p30<=0)
states: 2,009,334,210,723,841 (15)
abstracting: (0<=p76)
states: 2,296,381,955,112,961 (15)
abstracting: (p76<=0)
states: 1,533,569,993,539,585 (15)
abstracting: (0<=p4)
states: 2,296,381,955,112,961 (15)
abstracting: (p4<=0)
states: 1,842,551,551,426,561 (15)
abstracting: (0<=p109)
states: 2,296,381,955,112,961 (15)
abstracting: (p109<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p32)
states: 2,296,381,955,112,961 (15)
abstracting: (p32<=0)
states: 2,009,334,210,723,841 (15)
abstracting: (0<=p94)
states: 2,296,381,955,112,961 (15)
abstracting: (p94<=0)
states: 1,722,286,494,449,665 (15)
abstracting: (1<=p53)
states: 1,148,190,977,556,480 (15)
abstracting: (p53<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p118)
states: 1,148,190,977,556,480 (15)
abstracting: (p118<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p92)
states: 574,095,460,663,296 (14)
abstracting: (p92<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p59)
states: 3,972,978,966,528 (12)
abstracting: (p59<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p28)
states: 287,047,744,389,120 (14)
abstracting: (p28<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p103)
states: 1,148,190,977,556,480 (15)
abstracting: (p103<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (0<=p47)
states: 2,296,381,955,112,961 (15)
abstracting: (p47<=0)
states: 1,722,286,466,334,721 (15)
abstracting: (0<=p114)
states: 2,296,381,955,112,961 (15)
abstracting: (p114<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p6)
states: 2,296,381,955,112,961 (15)
abstracting: (p6<=0)
states: 1,842,551,551,426,561 (15)
abstracting: (1<=p19)
states: 458,368,707,723,264 (14)
abstracting: (p19<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (0<=p13)
states: 2,296,381,955,112,961 (15)
abstracting: (p13<=0)
states: 1,842,551,510,532,097 (15)
abstracting: (0<=p86)
states: 2,296,381,955,112,961 (15)
abstracting: (p86<=0)
states: 1,148,191,033,786,369 (15)
abstracting: (0<=p51)
states: 2,296,381,955,112,961 (15)
abstracting: (p51<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p116)
states: 2,296,381,955,112,961 (15)
abstracting: (p116<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p101)
states: 2,296,381,955,112,961 (15)
abstracting: (p101<=0)
states: 1,148,191,033,786,369 (15)
abstracting: (0<=p25)
states: 2,296,381,955,112,961 (15)
abstracting: (p25<=0)
states: 1,722,286,466,334,721 (15)
abstracting: (0<=p28)
states: 2,296,381,955,112,961 (15)
abstracting: (p28<=0)
states: 2,009,334,210,723,841 (15)
abstracting: (0<=p105)
states: 2,296,381,955,112,961 (15)
abstracting: (p105<=0)
states: 1,148,190,977,556,481 (15)
abstracting: (0<=p82)
states: 2,296,381,955,112,961 (15)
abstracting: (p82<=0)
states: 1,724,272,983,932,929 (15)
abstracting: (0<=p46)
states: 2,296,381,955,112,961 (15)
abstracting: (p46<=0)
states: 2,119,737,189,335,041 (15)
abstracting: (0<=p78)
states: 2,296,381,955,112,961 (15)
abstracting: (p78<=0)
states: 1,152,164,012,752,897 (15)
abstracting: (1<=p35)
states: 176,644,765,777,920 (14)
abstracting: (p35<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p100)
states: 765,460,614,217,728 (14)
abstracting: (p100<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (0<=p9)
states: 2,296,381,955,112,961 (15)
abstracting: (p9<=0)
states: 1,729,093,950,504,961 (15)
abstracting: (0<=p44)
states: 2,296,381,955,112,961 (15)
abstracting: (p44<=0)
states: 2,119,737,189,335,041 (15)
abstracting: (0<=p2)
states: 2,296,381,955,112,961 (15)
abstracting: (p2<=0)
states: 2,273,690,414,481,409 (15)
abstracting: (1<=p112)
states: 1,148,190,977,556,480 (15)
abstracting: (p112<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p49)
states: 574,095,488,778,240 (14)
abstracting: (p49<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p23)
states: 574,095,488,778,240 (14)
abstracting: (p23<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p75)
states: 762,811,961,573,376 (14)
abstracting: (p75<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (1<=p18)
states: 458,368,758,841,344 (14)
abstracting: (p18<=1)
states: 2,296,381,955,112,961 (15)
abstracting: (0<=p84)
states: 2,296,381,955,112,961 (15)
abstracting: (p84<=0)
states: 1,533,569,993,539,585 (15)
abstracting: (1<=p14)
states: 453,830,403,686,400 (14)
abstracting: (p14<=1)
states: 2,296,381,955,112,961 (15)
-> the formula is FALSE

FORMULA DLCround-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.350sec

totally nodes used: 228029 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 341928 1207422 1549350
used/not used/entry size/cache size: 1230785 65878079 16 1024MB
basic ops cache: hits/miss/sum: 112070 355697 467767
used/not used/entry size/cache size: 729984 16047232 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 35925 108171 144096
used/not used/entry size/cache size: 107856 8280752 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66888279
1 213619
2 6583
3 358
4 14
5 2
6 3
7 1
8 2
9 1
>= 10 2

Total processing time: 0m 4.711sec


BK_STOP 1678462144278

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


iterations count:2860 (13), effective:182 (0)

initing FirstDep: 0m 0.000sec


iterations count:1795 (8), effective:83 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-09b"
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-09b, 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-167814483100727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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