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

--------------------
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-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678799616083

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-25
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 13:13:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:13:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:13:39] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-14 13:13:39] [INFO ] Transformed 600 places.
[2023-03-14 13:13:39] [INFO ] Transformed 545 transitions.
[2023-03-14 13:13:39] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 16) seen :14
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 545 rows 600 cols
[2023-03-14 13:13:40] [INFO ] Computed 55 place invariants in 42 ms
[2023-03-14 13:13:41] [INFO ] [Real]Absence check using 50 positive place invariants in 49 ms returned sat
[2023-03-14 13:13:41] [INFO ] [Real]Absence check using 50 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-14 13:13:41] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 13:13:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2023-03-14 13:13:42] [INFO ] [Nat]Absence check using 50 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-14 13:13:43] [INFO ] After 1063ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 13:13:44] [INFO ] Deduced a trap composed of 23 places in 679 ms of which 79 ms to minimize.
[2023-03-14 13:13:44] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 2 ms to minimize.
[2023-03-14 13:13:45] [INFO ] Deduced a trap composed of 34 places in 486 ms of which 2 ms to minimize.
[2023-03-14 13:13:46] [INFO ] Deduced a trap composed of 52 places in 541 ms of which 3 ms to minimize.
[2023-03-14 13:13:46] [INFO ] Deduced a trap composed of 13 places in 537 ms of which 2 ms to minimize.
[2023-03-14 13:13:47] [INFO ] Deduced a trap composed of 21 places in 548 ms of which 3 ms to minimize.
[2023-03-14 13:13:48] [INFO ] Deduced a trap composed of 13 places in 534 ms of which 2 ms to minimize.
[2023-03-14 13:13:48] [INFO ] Deduced a trap composed of 46 places in 515 ms of which 2 ms to minimize.
[2023-03-14 13:13:49] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2023-03-14 13:13:49] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2023-03-14 13:13:50] [INFO ] Deduced a trap composed of 63 places in 424 ms of which 1 ms to minimize.
[2023-03-14 13:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 7201 ms
[2023-03-14 13:13:51] [INFO ] Deduced a trap composed of 60 places in 398 ms of which 2 ms to minimize.
[2023-03-14 13:13:52] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-14 13:13:52] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2023-03-14 13:13:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1399 ms
[2023-03-14 13:13:52] [INFO ] After 10650ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 688 ms.
[2023-03-14 13:13:53] [INFO ] After 11682ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 39 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 575 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 575 transition count 410
Reduce places removed 135 places and 0 transitions.
Graph (complete) has 777 edges and 440 vertex of which 404 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 136 rules applied. Total rules applied 272 place count 404 transition count 410
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 308 place count 404 transition count 374
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 321 place count 391 transition count 361
Iterating global reduction 3 with 13 rules applied. Total rules applied 334 place count 391 transition count 361
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 343 place count 382 transition count 352
Iterating global reduction 3 with 9 rules applied. Total rules applied 352 place count 382 transition count 352
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 372 place count 382 transition count 332
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 392 place count 362 transition count 332
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 405 place count 349 transition count 319
Applied a total of 405 rules in 222 ms. Remains 349 /600 variables (removed 251) and now considering 319/545 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 349/600 places, 319/545 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642480 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642480 steps, saw 150966 distinct states, run finished after 3006 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 319 rows 349 cols
[2023-03-14 13:13:56] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-14 13:13:57] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 96 ms returned sat
[2023-03-14 13:13:57] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 13:13:57] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 53 ms returned sat
[2023-03-14 13:13:57] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 13:13:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-14 13:13:57] [INFO ] After 235ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 13:13:58] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-14 13:13:58] [INFO ] After 1227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 39 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 319/319 transitions.
Applied a total of 0 rules in 31 ms. Remains 349 /349 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 349/349 places, 319/319 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 319/319 transitions.
Applied a total of 0 rules in 33 ms. Remains 349 /349 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2023-03-14 13:13:58] [INFO ] Invariant cache hit.
[2023-03-14 13:13:58] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-14 13:13:58] [INFO ] Invariant cache hit.
[2023-03-14 13:13:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-14 13:13:59] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2023-03-14 13:13:59] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-14 13:13:59] [INFO ] Invariant cache hit.
[2023-03-14 13:14:00] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 349/349 places, 319/319 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 345 transition count 271
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 100 place count 297 transition count 271
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 100 place count 297 transition count 223
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 196 place count 249 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 202 place count 246 transition count 220
Applied a total of 202 rules in 65 ms. Remains 246 /349 variables (removed 103) and now considering 220/319 (removed 99) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 246 cols
[2023-03-14 13:14:00] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-14 13:14:00] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 87 ms returned sat
[2023-03-14 13:14:00] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 13:14:00] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 80 ms returned sat
[2023-03-14 13:14:01] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 13:14:01] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-14 13:14:01] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 13:14:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 13:14:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 349 places, 319 transitions and 1071 arcs took 6 ms.
[2023-03-14 13:14:01] [INFO ] Flatten gal took : 133 ms
Total runtime 22317 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: 349 NrTr: 319 NrArc: 1071)

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

net check time: 0m 0.000sec

init dd package: 0m 3.694sec


RS generation: 0m48.647sec


-> reachability set: #nodes 817112 (8.2e+05) #states 1,030,610,790,522,150 (15)



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

checking: EF [[[[[[[[[[[[1<=p312 & 1<=p9] & [1<=p129 & 1<=p59]] & [[1<=p167 & 1<=p132] & 1<=p28]] | [[1<=p302 & 1<=p36] & [1<=p69 & 1<=p20]]] | p202<=0] | [p57<=0 | 1<=p141]] & [[[[[[1<=p283 | 1<=p150] & [[1<=p73 & 1<=p26] | 1<=p63]] | [[[[1<=p266 & 1<=p217] | 1<=p287] & 1<=p166] & 1<=p5]] & p43<=0] & [1<=p305 & 1<=p2]] | [1<=p45 & [p315<=0 & 1<=p80]]]] & p65<=0] | 1<=p238] & [[p7<=0 | p49<=0] | [p222<=0 | [[1<=p28 & 1<=p132] | [1<=p12 & 1<=p230]]]]] & [1<=p16 & 1<=p234]]]
normalized: E [true U [[1<=p16 & 1<=p234] & [[[[[1<=p28 & 1<=p132] | [1<=p12 & 1<=p230]] | p222<=0] | [p7<=0 | p49<=0]] & [1<=p238 | [p65<=0 & [[[[[[[[[1<=p266 & 1<=p217] | 1<=p287] & 1<=p166] & 1<=p5] | [[[1<=p73 & 1<=p26] | 1<=p63] & [1<=p283 | 1<=p150]]] & p43<=0] & [1<=p305 & 1<=p2]] | [[p315<=0 & 1<=p80] & 1<=p45]] & [[p57<=0 | 1<=p141] | [p202<=0 | [[[1<=p69 & 1<=p20] & [1<=p302 & 1<=p36]] | [[1<=p28 & [1<=p167 & 1<=p132]] & [[1<=p129 & 1<=p59] & [1<=p312 & 1<=p9]]]]]]]]]]]]

abstracting: (1<=p9)
states: 510,971,978,418,570 (14)
abstracting: (1<=p312)
states: 9,157,742,010,000 (12)
abstracting: (1<=p59)
states: 142,128,530,715,198 (14)
abstracting: (1<=p129)
states: 9,870,548,165,244 (12)
abstracting: (1<=p132)
states: 9,870,548,165,244 (12)
abstracting: (1<=p167)
states: 4,033,912,518,720 (12)
abstracting: (1<=p28)
states: 566,992,471,314,822 (14)
abstracting: (1<=p36)
states: 592,162,619,501,484 (14)
abstracting: (1<=p302)
states: 8,818,637,454,000 (12)
abstracting: (1<=p20)
states: 539,662,202,156,040 (14)
abstracting: (1<=p69)
states: 449,078,480,025,390 (14)
abstracting: (p202<=0)
states: 1,019,500,365,484,950 (15)
abstracting: (1<=p141)
states: 8,862,266,363,418 (12)
abstracting: (p57<=0)
states: 886,335,312,726,432 (14)
abstracting: (1<=p45)
states: 234,006,705,638,136 (14)
abstracting: (1<=p80)
states: 199,352,035,819,938 (14)
abstracting: (p315<=0)
states: 1,023,986,644,660,950 (15)
abstracting: (1<=p2)
states: 474,608,127,917,700 (14)
abstracting: (1<=p305)
states: 9,157,742,010,000 (12)
abstracting: (p43<=0)
states: 793,306,726,563,300 (14)
abstracting: (1<=p150)
states: 4,519,975,478,400 (12)
abstracting: (1<=p283)
states: 8,774,669,136,600 (12)
abstracting: (1<=p63)
states: 281,065,313,760,312 (14)
abstracting: (1<=p26)
states: 483,558,969,821,040 (14)
abstracting: (1<=p73)
states: 421,318,489,900,344 (14)
abstracting: (1<=p5)
states: 468,013,411,276,272 (14)
abstracting: (1<=p166)
states: 8,624,889,147,168 (12)
abstracting: (1<=p287)
states: 8,798,786,632,800 (12)
abstracting: (1<=p217)
states: 11,110,425,037,200 (13)
abstracting: (1<=p266)
states: 10,368,554,590,800 (13)
abstracting: (p65<=0)
states: 789,133,802,317,704 (14)
abstracting: (1<=p238)
states: 5,768,511,336,000 (12)
abstracting: (p49<=0)
states: 607,636,105,796,073 (14)
abstracting: (p7<=0)
states: 510,441,958,387,680 (14)
abstracting: (p222<=0)
states: 1,018,646,748,712,500 (15)
abstracting: (1<=p230)
states: 11,964,041,809,650 (13)
abstracting: (1<=p12)
states: 482,953,976,408,892 (14)
abstracting: (1<=p132)
states: 9,870,548,165,244 (12)
abstracting: (1<=p28)
states: 566,992,471,314,822 (14)
abstracting: (1<=p234)
states: 11,964,041,809,650 (13)
abstracting: (1<=p16)
states: 564,083,933,292,360 (14)
-> the formula is TRUE

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

MC time: 0m32.959sec

totally nodes used: 15118788 (1.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18658658 125200716 143859374
used/not used/entry size/cache size: 57659361 9449503 16 1024MB
basic ops cache: hits/miss/sum: 2911343 20351943 23263286
used/not used/entry size/cache size: 14802266 1974950 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: 928897 5920240 6849137
used/not used/entry size/cache size: 4254877 4133731 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 56025469
1 8035619
2 2264553
3 614922
4 137773
5 25729
6 4118
7 606
8 67
9 7
>= 10 1

Total processing time: 1m30.545sec


BK_STOP 1678799733307

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


iterations count:10885 (34), effective:520 (1)

initing FirstDep: 0m 0.002sec


iterations count:3883 (12), effective:173 (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="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-25, 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-167840348700463"
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 [ "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 ;