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.r522-tall-167987247100270.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 EisenbergMcGuire-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680832962783

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 02:02:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 02:02:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:02:44] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-04-07 02:02:44] [INFO ] Transformed 891 places.
[2023-04-07 02:02:44] [INFO ] Transformed 3888 transitions.
[2023-04-07 02:02:44] [INFO ] Found NUPN structural information;
[2023-04-07 02:02:44] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 14) seen :5
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 02:02:45] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-07 02:02:45] [INFO ] Computed 28 invariants in 21 ms
[2023-04-07 02:02:46] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 02:02:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2023-04-07 02:02:46] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:02:47] [INFO ] After 1026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 02:02:47] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-07 02:02:48] [INFO ] After 987ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 02:02:49] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 6 ms to minimize.
[2023-04-07 02:02:49] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 5 ms to minimize.
[2023-04-07 02:02:50] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 2 ms to minimize.
[2023-04-07 02:02:50] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 1 ms to minimize.
[2023-04-07 02:02:51] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 1 ms to minimize.
[2023-04-07 02:02:51] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 0 ms to minimize.
[2023-04-07 02:02:51] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 0 ms to minimize.
[2023-04-07 02:02:52] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 1 ms to minimize.
[2023-04-07 02:02:52] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 1 ms to minimize.
[2023-04-07 02:02:52] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2023-04-07 02:02:52] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2023-04-07 02:02:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4313 ms
[2023-04-07 02:02:53] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 1 ms to minimize.
[2023-04-07 02:02:53] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-07 02:02:53] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 0 ms to minimize.
[2023-04-07 02:02:53] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2023-04-07 02:02:54] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-04-07 02:02:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 02:02:54] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2023-04-07 02:02:54] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-04-07 02:02:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1644 ms
[2023-04-07 02:02:55] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-04-07 02:02:55] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-04-07 02:02:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-04-07 02:02:55] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:02:55] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:02:56] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:02:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 566 ms
[2023-04-07 02:02:56] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 0 ms to minimize.
[2023-04-07 02:02:56] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 0 ms to minimize.
[2023-04-07 02:02:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
[2023-04-07 02:02:57] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-04-07 02:02:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-04-07 02:02:57] [INFO ] After 9765ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 938 ms.
[2023-04-07 02:02:58] [INFO ] After 12324ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 226 ms.
Support contains 133 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 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 6 rules applied. Total rules applied 6 place count 891 transition count 3882
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 885 transition count 3880
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 883 transition count 3880
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 16 place count 883 transition count 3705
Deduced a syphon composed of 175 places in 5 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 366 place count 708 transition count 3705
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 427 place count 647 transition count 3156
Iterating global reduction 3 with 61 rules applied. Total rules applied 488 place count 647 transition count 3156
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 6 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 582 place count 600 transition count 3109
Applied a total of 582 rules in 405 ms. Remains 600 /891 variables (removed 291) and now considering 3109/3888 (removed 779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 600/891 places, 3109/3888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 8) seen :2
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 02:02:59] [INFO ] Flow matrix only has 1030 transitions (discarded 2079 similar events)
// Phase 1: matrix 1030 rows 600 cols
[2023-04-07 02:02:59] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:02:59] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 02:02:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 02:02:59] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:03:00] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 02:03:00] [INFO ] State equation strengthened by 444 read => feed constraints.
[2023-04-07 02:03:00] [INFO ] After 406ms SMT Verify possible using 444 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 02:03:00] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2023-04-07 02:03:01] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-07 02:03:01] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-04-07 02:03:01] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 0 ms to minimize.
[2023-04-07 02:03:01] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 1 ms to minimize.
[2023-04-07 02:03:01] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 4 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1382 ms
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:03:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 800 ms
[2023-04-07 02:03:03] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:03:03] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2023-04-07 02:03:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-04-07 02:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 02:03:03] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-04-07 02:03:03] [INFO ] After 3678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 382 ms.
[2023-04-07 02:03:04] [INFO ] After 4724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 42 ms.
Support contains 100 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 3109/3109 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 600 transition count 3091
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 582 transition count 3091
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 580 transition count 3073
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 580 transition count 3073
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 573 transition count 3066
Applied a total of 54 rules in 167 ms. Remains 573 /600 variables (removed 27) and now considering 3066/3109 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 573/600 places, 3066/3109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :1
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 02:03:04] [INFO ] Flow matrix only has 987 transitions (discarded 2079 similar events)
// Phase 1: matrix 987 rows 573 cols
[2023-04-07 02:03:04] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 02:03:04] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 02:03:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 02:03:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:03:05] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 02:03:05] [INFO ] State equation strengthened by 428 read => feed constraints.
[2023-04-07 02:03:05] [INFO ] After 367ms SMT Verify possible using 428 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 02:03:06] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 0 ms to minimize.
[2023-04-07 02:03:06] [INFO ] Deduced a trap composed of 81 places in 249 ms of which 1 ms to minimize.
[2023-04-07 02:03:06] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-04-07 02:03:07] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 0 ms to minimize.
[2023-04-07 02:03:07] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 0 ms to minimize.
[2023-04-07 02:03:07] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 1 ms to minimize.
[2023-04-07 02:03:07] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 1 ms to minimize.
[2023-04-07 02:03:08] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 1 ms to minimize.
[2023-04-07 02:03:08] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
[2023-04-07 02:03:08] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2023-04-07 02:03:08] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3486 ms
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 02:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 378 ms
[2023-04-07 02:03:10] [INFO ] After 4599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-04-07 02:03:10] [INFO ] After 5469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 41 ms.
Support contains 81 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 3066/3066 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 573 transition count 3056
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 563 transition count 3056
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 562 transition count 3047
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 562 transition count 3047
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 559 transition count 3044
Applied a total of 28 rules in 154 ms. Remains 559 /573 variables (removed 14) and now considering 3044/3066 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 559/573 places, 3044/3066 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 243070 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 243070 steps, saw 164967 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :3
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-07 02:03:13] [INFO ] Flow matrix only has 965 transitions (discarded 2079 similar events)
// Phase 1: matrix 965 rows 559 cols
[2023-04-07 02:03:13] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 02:03:13] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:03:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 02:03:13] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:03:14] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:03:14] [INFO ] State equation strengthened by 420 read => feed constraints.
[2023-04-07 02:03:14] [INFO ] After 170ms SMT Verify possible using 420 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:03:14] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2023-04-07 02:03:14] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 02:03:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-07 02:03:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 02:03:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2023-04-07 02:03:15] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-04-07 02:03:15] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 10 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 3044/3044 transitions.
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 47 Pre rules applied. Total rules applied 0 place count 559 transition count 2997
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 512 transition count 2997
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 507 transition count 2952
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 507 transition count 2952
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 128 place count 495 transition count 2940
Applied a total of 128 rules in 157 ms. Remains 495 /559 variables (removed 64) and now considering 2940/3044 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 495/559 places, 2940/3044 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 440410 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{1=1}
Probabilistic random walk after 440410 steps, saw 270912 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :1
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-04-07 02:03:18] [INFO ] Flow matrix only has 861 transitions (discarded 2079 similar events)
// Phase 1: matrix 861 rows 495 cols
[2023-04-07 02:03:18] [INFO ] Computed 28 invariants in 12 ms
[2023-04-07 02:03:18] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:03:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 02:03:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:03:18] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:18] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-07 02:03:18] [INFO ] After 90ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:19] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 02:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-07 02:03:19] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 02:03:19] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 2940/2940 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 495 transition count 2939
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 494 transition count 2939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 492 transition count 2921
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 492 transition count 2921
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 491 transition count 2920
Applied a total of 8 rules in 120 ms. Remains 491 /495 variables (removed 4) and now considering 2920/2940 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 491/495 places, 2920/2940 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472450 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472450 steps, saw 284452 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:03:22] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
// Phase 1: matrix 841 rows 491 cols
[2023-04-07 02:03:22] [INFO ] Computed 28 invariants in 9 ms
[2023-04-07 02:03:22] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:03:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:03:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:03:22] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:22] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:03:22] [INFO ] After 81ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:22] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-07 02:03:22] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:03:22] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-07 02:03:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2023-04-07 02:03:23] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 02:03:23] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 100 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 491/491 places, 2920/2920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 84 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2023-04-07 02:03:23] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 02:03:23] [INFO ] Invariant cache hit.
[2023-04-07 02:03:23] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-04-07 02:03:23] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 02:03:23] [INFO ] Invariant cache hit.
[2023-04-07 02:03:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:03:26] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
[2023-04-07 02:03:26] [INFO ] Redundant transitions in 174 ms returned []
[2023-04-07 02:03:26] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 02:03:26] [INFO ] Invariant cache hit.
[2023-04-07 02:03:27] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3972 ms. Remains : 491/491 places, 2920/2920 transitions.
Graph (trivial) has 2695 edges and 491 vertex of which 80 / 491 are part of one of the 9 SCC in 4 ms
Free SCC test removed 71 places
Drop transitions removed 271 transitions
Ensure Unique test removed 2025 transitions
Reduce isomorphic transitions removed 2296 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 420 transition count 528
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 324 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 322 transition count 526
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 197 place count 322 transition count 509
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 238 place count 298 transition count 509
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 284 rules applied. Total rules applied 522 place count 156 transition count 367
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 591 place count 156 transition count 298
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 605 place count 149 transition count 298
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 612 place count 149 transition count 291
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 623 place count 149 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 698 place count 149 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 773 place count 74 transition count 205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 774 place count 74 transition count 204
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 783 place count 74 transition count 204
Applied a total of 783 rules in 50 ms. Remains 74 /491 variables (removed 417) and now considering 204/2920 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 204 rows 74 cols
[2023-04-07 02:03:27] [INFO ] Computed 21 invariants in 1 ms
[2023-04-07 02:03:27] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:03:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:03:27] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 02:03:27] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 02:03:27] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:27] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 02:03:27] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:03:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 02:03:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 2920 transitions and 15578 arcs took 16 ms.
[2023-04-07 02:03:27] [INFO ] Flatten gal took : 213 ms
Total runtime 43555 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_09
(NrP: 491 NrTr: 2920 NrArc: 15578)

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

net check time: 0m 0.002sec

init dd package: 0m 2.687sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9769084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102936 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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.018sec

37147 73955 201100 212439 182393 315891 356457 428610 434525 432970 445414 1099216 1121415 1179768 1147075 1125544 1254157 1322914 1261735 1208834 1466699 1473921 1594912 1599584 1543927 1561650 1760320

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="ReachabilityCardinality"
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 EisenbergMcGuire-PT-09, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247100270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;