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-167840348700471.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-30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K 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.6K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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 357K 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-30-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678803594849

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=HirschbergSinclair-PT-30
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 14:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:19:58] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-14 14:19:58] [INFO ] Transformed 670 places.
[2023-03-14 14:19:58] [INFO ] Transformed 605 transitions.
[2023-03-14 14:19:58] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 16) seen :15
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 605 rows 670 cols
[2023-03-14 14:19:59] [INFO ] Computed 65 place invariants in 56 ms
[2023-03-14 14:19:59] [INFO ] [Real]Absence check using 60 positive place invariants in 50 ms returned sat
[2023-03-14 14:19:59] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-14 14:19:59] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 14:20:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2023-03-14 14:20:00] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-14 14:20:00] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 14:20:01] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 9 ms to minimize.
[2023-03-14 14:20:02] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 2 ms to minimize.
[2023-03-14 14:20:02] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 2 ms to minimize.
[2023-03-14 14:20:02] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 2 ms to minimize.
[2023-03-14 14:20:03] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 2 ms to minimize.
[2023-03-14 14:20:03] [INFO ] Deduced a trap composed of 57 places in 371 ms of which 1 ms to minimize.
[2023-03-14 14:20:04] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 1 ms to minimize.
[2023-03-14 14:20:04] [INFO ] Deduced a trap composed of 106 places in 306 ms of which 1 ms to minimize.
[2023-03-14 14:20:04] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 1 ms to minimize.
[2023-03-14 14:20:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3556 ms
[2023-03-14 14:20:04] [INFO ] After 4604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-14 14:20:05] [INFO ] After 5339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 26 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 640 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 640 transition count 413
Reduce places removed 192 places and 0 transitions.
Graph (complete) has 761 edges and 448 vertex of which 388 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 193 rules applied. Total rules applied 386 place count 388 transition count 413
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 446 place count 388 transition count 353
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 457 place count 377 transition count 342
Iterating global reduction 3 with 11 rules applied. Total rules applied 468 place count 377 transition count 342
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 476 place count 369 transition count 334
Iterating global reduction 3 with 8 rules applied. Total rules applied 484 place count 369 transition count 334
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 514 place count 369 transition count 304
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 544 place count 339 transition count 304
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 565 place count 318 transition count 283
Applied a total of 565 rules in 217 ms. Remains 318 /670 variables (removed 352) and now considering 283/605 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 318/670 places, 283/605 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 571543 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 571543 steps, saw 127249 distinct states, run finished after 3002 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 283 rows 318 cols
[2023-03-14 14:20:08] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-14 14:20:08] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 71 ms returned sat
[2023-03-14 14:20:08] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 14:20:08] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 75 ms returned sat
[2023-03-14 14:20:09] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 14:20:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 14:20:09] [INFO ] After 136ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 14:20:09] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-14 14:20:09] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 26 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 283/283 transitions.
Applied a total of 0 rules in 40 ms. Remains 318 /318 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 318/318 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 283/283 transitions.
Applied a total of 0 rules in 29 ms. Remains 318 /318 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2023-03-14 14:20:09] [INFO ] Invariant cache hit.
[2023-03-14 14:20:10] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-14 14:20:10] [INFO ] Invariant cache hit.
[2023-03-14 14:20:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 14:20:11] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-14 14:20:11] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-14 14:20:11] [INFO ] Invariant cache hit.
[2023-03-14 14:20:12] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2554 ms. Remains : 318/318 places, 283/283 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 307 transition count 200
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 177 place count 224 transition count 200
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 177 place count 224 transition count 156
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 265 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 179 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 179 transition count 155
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 275 place count 175 transition count 151
Applied a total of 275 rules in 38 ms. Remains 175 /318 variables (removed 143) and now considering 151/283 (removed 132) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 175 cols
[2023-03-14 14:20:12] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-14 14:20:12] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-14 14:20:12] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 14:20:12] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-14 14:20:12] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 14:20:12] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 14:20:12] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 14:20:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-14 14:20:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 318 places, 283 transitions and 1006 arcs took 3 ms.
[2023-03-14 14:20:13] [INFO ] Flatten gal took : 77 ms
Total runtime 15058 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: leader
(NrP: 318 NrTr: 283 NrArc: 1006)

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

net check time: 0m 0.000sec

init dd package: 0m 3.635sec


RS generation: 0m31.780sec


-> reachability set: #nodes 615269 (6.2e+05) #states 1,861,424,677,656 (12)



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

checking: EF [[1<=p61 & [1<=p308 & [[[[[[[1<=p59 | [1<=p34 & 1<=p160]] & [p159<=0 | [[1<=p38 & 1<=p238] | [1<=p6 & 1<=p282]]]] & p169<=0] & [1<=p2 & 1<=p272]] | p257<=0] | p18<=0] | [[[1<=p14 & 1<=p264] & 1<=p10] | [[[[p205<=0 | p50<=0] | [p10<=0 | p52<=0]] & p54<=0] | [[1<=p38 & 1<=p68] & [p67<=0 & [1<=p217 | [1<=p62 & 1<=p34]]]]]]]]]]
normalized: E [true U [1<=p61 & [1<=p308 & [[[[[1<=p38 & 1<=p68] & [[[1<=p62 & 1<=p34] | 1<=p217] & p67<=0]] | [[[p205<=0 | p50<=0] | [p10<=0 | p52<=0]] & p54<=0]] | [[1<=p14 & 1<=p264] & 1<=p10]] | [[[[1<=p2 & 1<=p272] & [[[[[1<=p6 & 1<=p282] | [1<=p38 & 1<=p238]] | p159<=0] & [[1<=p34 & 1<=p160] | 1<=p59]] & p169<=0]] | p257<=0] | p18<=0]]]]]

abstracting: (p18<=0)
states: 1,011,521,286,576 (12)
abstracting: (p257<=0)
states: 1,843,724,973,816 (12)
abstracting: (p169<=0)
states: 1,838,747,925,432 (12)
abstracting: (1<=p59)
states: 619,013,974,152 (11)
abstracting: (1<=p160)
states: 22,676,752,224 (10)
abstracting: (1<=p34)
states: 984,631,689,936 (11)
abstracting: (p159<=0)
states: 1,846,306,842,840 (12)
abstracting: (1<=p238)
states: 18,184,642,560 (10)
abstracting: (1<=p38)
states: 1,019,977,054,416 (12)
abstracting: (1<=p282)
states: 17,205,896,736 (10)
abstracting: (1<=p6)
states: 1,039,663,609,068 (12)
abstracting: (1<=p272)
states: 17,699,703,840 (10)
abstracting: (1<=p2)
states: 1,040,599,240,212 (12)
abstracting: (1<=p10)
states: 1,008,271,770,516 (12)
abstracting: (1<=p264)
states: 17,699,703,840 (10)
abstracting: (1<=p14)
states: 197,063,388,198 (11)
abstracting: (p54<=0)
states: 1,436,472,982,116 (12)
abstracting: (p52<=0)
states: 1,307,272,361,970 (12)
abstracting: (p10<=0)
states: 853,152,907,140 (11)
abstracting: (p50<=0)
states: 1,283,730,680,340 (12)
abstracting: (p205<=0)
states: 1,836,607,169,304 (12)
abstracting: (p67<=0)
states: 1,251,848,241,936 (12)
abstracting: (1<=p217)
states: 18,184,642,560 (10)
abstracting: (1<=p34)
states: 984,631,689,936 (11)
abstracting: (1<=p62)
states: 826,845,984,504 (11)
abstracting: (1<=p68)
states: 803,133,860,904 (11)
abstracting: (1<=p38)
states: 1,019,977,054,416 (12)
abstracting: (1<=p308)
states: 17,136,445,536 (10)
abstracting: (1<=p61)
states: 619,013,974,152 (11)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-30-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.338sec

totally nodes used: 12288904 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14311744 117623817 131935561
used/not used/entry size/cache size: 56552268 10556596 16 1024MB
basic ops cache: hits/miss/sum: 1801819 15991375 17793194
used/not used/entry size/cache size: 13765367 3011849 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: 346309 2941239 3287548
used/not used/entry size/cache size: 2490078 5898530 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 57777416
1 7038064
2 1754415
3 434198
4 87407
5 14783
6 2246
7 288
8 42
9 5
>= 10 0

Total processing time: 1m 9.306sec


BK_STOP 1678803683635

--------------------
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:12294 (43), effective:420 (1)

initing FirstDep: 0m 0.001sec


iterations count:5391 (19), effective:268 (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-30"
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 HirschbergSinclair-PT-30, 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 r202-smll-167840348700471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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