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.r202-smll-167840348700462.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 HirschbergSinclair-PT-25, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.7K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678799582947

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=HirschbergSinclair-PT-25
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 13:13:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:13:06] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-14 13:13:06] [INFO ] Transformed 600 places.
[2023-03-14 13:13:06] [INFO ] Transformed 545 transitions.
[2023-03-14 13:13:06] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 16) seen :11
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 545 rows 600 cols
[2023-03-14 13:13:07] [INFO ] Computed 55 place invariants in 34 ms
[2023-03-14 13:13:08] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:13:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-14 13:13:08] [INFO ] [Nat]Absence check using 50 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-14 13:13:09] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-14 13:13:09] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 13 ms to minimize.
[2023-03-14 13:13:10] [INFO ] Deduced a trap composed of 12 places in 534 ms of which 2 ms to minimize.
[2023-03-14 13:13:10] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 2 ms to minimize.
[2023-03-14 13:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1432 ms
[2023-03-14 13:13:11] [INFO ] After 2340ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-14 13:13:11] [INFO ] After 3051ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 46 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 545/545 transitions.
Graph (complete) has 1148 edges and 600 vertex of which 573 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 573 transition count 349
Reduce places removed 193 places and 0 transitions.
Graph (complete) has 645 edges and 380 vertex of which 325 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 214 rules applied. Total rules applied 411 place count 325 transition count 329
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 486 place count 305 transition count 274
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 514 place count 305 transition count 246
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 542 place count 277 transition count 246
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 562 place count 257 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 256 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 563 place count 256 transition count 218
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 579 place count 248 transition count 218
Applied a total of 579 rules in 226 ms. Remains 248 /600 variables (removed 352) and now considering 218/545 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 248/600 places, 218/545 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 414033 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 414033 steps, saw 85834 distinct states, run finished after 3002 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 248 cols
[2023-03-14 13:13:15] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-14 13:13:15] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 13:13:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-14 13:13:15] [INFO ] [Nat]Absence check using 3 positive and 27 generalized place invariants in 97 ms returned sat
[2023-03-14 13:13:15] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 13:13:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 13:13:15] [INFO ] After 101ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 13:13:15] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-14 13:13:15] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 46 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 218/218 transitions.
Applied a total of 0 rules in 25 ms. Remains 248 /248 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 248/248 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 218/218 transitions.
Applied a total of 0 rules in 20 ms. Remains 248 /248 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-14 13:13:15] [INFO ] Invariant cache hit.
[2023-03-14 13:13:16] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-14 13:13:16] [INFO ] Invariant cache hit.
[2023-03-14 13:13:16] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 13:13:17] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-14 13:13:17] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 13:13:17] [INFO ] Invariant cache hit.
[2023-03-14 13:13:17] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1805 ms. Remains : 248/248 places, 218/218 transitions.
Graph (complete) has 284 edges and 248 vertex of which 247 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 243 transition count 116
Reduce places removed 102 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 110 rules applied. Total rules applied 217 place count 141 transition count 108
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 225 place count 133 transition count 108
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 225 place count 133 transition count 89
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 265 place count 112 transition count 89
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 267 place count 111 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 269 place count 110 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 109 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 270 place count 109 transition count 86
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 108 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 107 transition count 85
Applied a total of 274 rules in 39 ms. Remains 107 /248 variables (removed 141) and now considering 85/218 (removed 133) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 85 rows 107 cols
[2023-03-14 13:13:17] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-14 13:13:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 13:13:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 13:13:17] [INFO ] [Nat]Absence check using 2 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-14 13:13:18] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 13:13:18] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-14 13:13:18] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 13:13:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-14 13:13:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 248 places, 218 transitions and 824 arcs took 5 ms.
[2023-03-14 13:13:18] [INFO ] Flatten gal took : 99 ms
Total runtime 12333 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: leader
(NrP: 248 NrTr: 218 NrArc: 824)

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

net check time: 0m 0.000sec

init dd package: 0m 3.649sec


RS generation: 0m 0.415sec


-> reachability set: #nodes 5872 (5.9e+03) #states 457,899,642 (8)



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

checking: EF [~ [p208<=p49]]
normalized: E [true U ~ [p208<=p49]]

abstracting: (p208<=p49)
states: 454,530,906 (8)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.343sec

checking: EF [[[[[p223<=0 | p174<=p86] & [[[[[[[[~ [1<=p172] & ~ [p134<=p185]] | 1<=p33] & 1<=p94] & 1<=p32] & [[~ [1<=p231] & ~ [p217<=1]] & ~ [p241<=1]]] | [[p220<=0 & ~ [p34<=1]] & ~ [p30<=1]]] | [~ [p245<=1] & ~ [p35<=1]]] | [[[[[~ [p19<=0] & p247<=p169] & [p239<=p170 & 1<=p202]] & [[~ [p81<=p153] & ~ [1<=p41]] & [[1<=p238 | [1<=p166 | [p36<=p225 & p182<=p46]]] & [[p243<=p155 & [p200<=p238 & p0<=1]] | p38<=1]]]] | 1<=p177] | ~ [p48<=0]]]] & 1<=p87] & [p51<=p131 & ~ [p44<=p39]]]]
normalized: E [true U [[~ [p44<=p39] & p51<=p131] & [1<=p87 & [[[~ [p48<=0] | [1<=p177 | [[[[p38<=1 | [p243<=p155 & [p200<=p238 & p0<=1]]] & [1<=p238 | [1<=p166 | [p36<=p225 & p182<=p46]]]] & [~ [1<=p41] & ~ [p81<=p153]]] & [[p239<=p170 & 1<=p202] & [p247<=p169 & ~ [p19<=0]]]]]] | [[~ [p35<=1] & ~ [p245<=1]] | [[~ [p30<=1] & [p220<=0 & ~ [p34<=1]]] | [[~ [p241<=1] & [~ [p217<=1] & ~ [1<=p231]]] & [1<=p32 & [1<=p94 & [1<=p33 | [~ [p134<=p185] & ~ [1<=p172]]]]]]]]] & [p223<=0 | p174<=p86]]]]]

abstracting: (p174<=p86)
states: 452,876,346 (8)
abstracting: (p223<=0)
states: 453,656,538 (8)
abstracting: (1<=p172)
states: 5,023,296 (6)
abstracting: (p134<=p185)
states: 452,827,098 (8)
abstracting: (1<=p33)
states: 208,501,128 (8)
abstracting: (1<=p94)
states: 2,800,980 (6)
abstracting: (1<=p32)
states: 152,633,214 (8)
abstracting: (1<=p231)
states: 4,160,160 (6)
abstracting: (p217<=1)
states: 457,899,642 (8)
abstracting: (p241<=1)
states: 457,899,642 (8)
abstracting: (p34<=1)
states: 457,899,642 (8)
abstracting: (p220<=0)
states: 453,718,746 (8)
abstracting: (p30<=1)
states: 457,899,642 (8)
abstracting: (p245<=1)
states: 457,899,642 (8)
abstracting: (p35<=1)
states: 457,899,642 (8)
abstracting: (p19<=0)
states: 425,688,372 (8)
abstracting: (p247<=p169)
states: 456,883,578 (8)
abstracting: (1<=p202)
states: 4,341,600 (6)
abstracting: (p239<=p170)
states: 453,656,538 (8)
abstracting: (p81<=p153)
states: 454,118,319 (8)
abstracting: (1<=p41)
states: 149,774,562 (8)
abstracting: (p182<=p46)
states: 453,669,498 (8)
abstracting: (p36<=p225)
states: 243,566,514 (8)
abstracting: (1<=p166)
states: 3,348,864 (6)
abstracting: (1<=p238)
states: 2,659,392 (6)
abstracting: (p0<=1)
states: 457,899,642 (8)
abstracting: (p200<=p238)
states: 453,656,538 (8)
abstracting: (p243<=p155)
states: 455,426,874 (8)
abstracting: (p38<=1)
states: 457,899,642 (8)
abstracting: (1<=p177)
states: 5,023,296 (6)
abstracting: (p48<=0)
states: 364,277,250 (8)
abstracting: (1<=p87)
states: 6,302,205 (6)
abstracting: (p51<=p131)
states: 312,580,080 (8)
abstracting: (p44<=p39)
states: 407,697,786 (8)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

totally nodes used: 264207 (2.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 440482 2193959 2634441
used/not used/entry size/cache size: 2322702 64786162 16 1024MB
basic ops cache: hits/miss/sum: 47157 317572 364729
used/not used/entry size/cache size: 558544 16218672 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: 6009 34357 40366
used/not used/entry size/cache size: 34323 8354285 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 66856920
1 240279
2 11097
3 538
4 30
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.371sec


BK_STOP 1678799605876

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


iterations count:4626 (21), effective:292 (1)

initing FirstDep: 0m 0.000sec


iterations count:2808 (12), effective:191 (0)

iterations count:665 (3), effective:47 (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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r202-smll-167840348700462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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