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.r394-oct2-167903717900399.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K Mar 5 18:23 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 ShieldPPPs-PT-003B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679509401677

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=ShieldPPPs-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:23:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 18:23:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:23:24] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-22 18:23:24] [INFO ] Transformed 207 places.
[2023-03-22 18:23:24] [INFO ] Transformed 192 transitions.
[2023-03-22 18:23:24] [INFO ] Found NUPN structural information;
[2023-03-22 18:23:24] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 16) seen :12
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 192 rows 207 cols
[2023-03-22 18:23:24] [INFO ] Computed 34 place invariants in 22 ms
[2023-03-22 18:23:25] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 18:23:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 50 ms returned sat
[2023-03-22 18:23:25] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 18:23:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 7 ms to minimize.
[2023-03-22 18:23:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2023-03-22 18:23:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-22 18:23:25] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 18:23:25] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 27 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 192/192 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 207 transition count 177
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 192 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 190 transition count 175
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 34 place count 190 transition count 159
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 66 place count 174 transition count 159
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 81 place count 159 transition count 144
Iterating global reduction 3 with 15 rules applied. Total rules applied 96 place count 159 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 96 place count 159 transition count 142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 157 transition count 142
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 182 place count 116 transition count 101
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 203 place count 116 transition count 101
Applied a total of 203 rules in 66 ms. Remains 116 /207 variables (removed 91) and now considering 101/192 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 116/207 places, 101/192 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1649393 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1649393 steps, saw 413637 distinct states, run finished after 3002 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 116 cols
[2023-03-22 18:23:28] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 18:23:29] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:23:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 43 ms returned sat
[2023-03-22 18:23:29] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 18:23:29] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:23:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-22 18:23:29] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2023-03-22 18:23:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-22 18:23:29] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-22 18:23:29] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 26 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-22 18:23:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1189 ms
[2023-03-22 18:23:30] [INFO ] After 1401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 18:23:30] [INFO ] After 1537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 27 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 116/116 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-22 18:23:30] [INFO ] Invariant cache hit.
[2023-03-22 18:23:30] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-22 18:23:30] [INFO ] Invariant cache hit.
[2023-03-22 18:23:31] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-22 18:23:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 18:23:31] [INFO ] Invariant cache hit.
[2023-03-22 18:23:31] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 116/116 places, 101/101 transitions.
Applied a total of 0 rules in 18 ms. Remains 116 /116 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 18:23:31] [INFO ] Invariant cache hit.
[2023-03-22 18:23:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:23:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-22 18:23:31] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 18:23:31] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-22 18:23:31] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-22 18:23:32] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-22 18:23:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:23:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 692 ms
[2023-03-22 18:23:32] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 18:23:32] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:23:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-22 18:23:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 101 transitions and 390 arcs took 2 ms.
[2023-03-22 18:23:32] [INFO ] Flatten gal took : 39 ms
Total runtime 8348 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: ShieldPPPs_PT_003B
(NrP: 116 NrTr: 101 NrArc: 390)

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

net check time: 0m 0.000sec

init dd package: 0m 3.479sec


before gc: list nodes free: 543944

after gc: idd nodes used:294954, unused:63705046; list nodes free:296438855

RS generation: 4m31.530sec


-> reachability set: #nodes 229004 (2.3e+05) #states 204,026,655,412,098 (14)



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

checking: EF [[[[[1<=p7 & p7<=1] & [p97<=1 & 1<=p97]] & [[[p50<=0 & 0<=p50] | [p63<=0 & 0<=p63]] & [[p90<=0 & 0<=p90] | [p115<=0 & 0<=p115]]]] & [[[[p90<=0 & 0<=p90] | [p113<=0 & 0<=p113]] & [[p92<=0 & 0<=p92] | [p106<=0 & 0<=p106]]] & [[[p71<=1 & 1<=p71] | [[p110<=0 & 0<=p110] & [[[p85<=0 & 0<=p85] | [p100<=0 & 0<=p100]] & [[p101<=0 & 0<=p101] | [[p19<=0 & 0<=p19] | [p39<=0 & 0<=p39]]]]]] & [[p29<=1 & 1<=p29] | [[[p107<=0 & 0<=p107] & [[p36<=0 & 0<=p36] & [[[p51<=1 & 1<=p51] & [[p53<=1 & 1<=p53] & [p66<=1 & 1<=p66]]] | [[p99<=1 & 1<=p99] & [p95<=1 & 1<=p95]]]]] | [[p0<=1 & 1<=p0] & [[p52<=0 & 0<=p52] | [p75<=0 & 0<=p75]]]]]]]]]
normalized: E [true U [[[[[[[p0<=1 & 1<=p0] & [[p52<=0 & 0<=p52] | [p75<=0 & 0<=p75]]] | [[[[[p95<=1 & 1<=p95] & [p99<=1 & 1<=p99]] | [[[p66<=1 & 1<=p66] & [p53<=1 & 1<=p53]] & [p51<=1 & 1<=p51]]] & [p36<=0 & 0<=p36]] & [p107<=0 & 0<=p107]]] | [p29<=1 & 1<=p29]] & [[[[[[p39<=0 & 0<=p39] | [p19<=0 & 0<=p19]] | [p101<=0 & 0<=p101]] & [[p100<=0 & 0<=p100] | [p85<=0 & 0<=p85]]] & [p110<=0 & 0<=p110]] | [p71<=1 & 1<=p71]]] & [[[p106<=0 & 0<=p106] | [p92<=0 & 0<=p92]] & [[p113<=0 & 0<=p113] | [p90<=0 & 0<=p90]]]] & [[[[p115<=0 & 0<=p115] | [p90<=0 & 0<=p90]] & [[p63<=0 & 0<=p63] | [p50<=0 & 0<=p50]]] & [[p97<=1 & 1<=p97] & [1<=p7 & p7<=1]]]]]

abstracting: (p7<=1)
states: 204,026,655,412,098 (14)
abstracting: (1<=p7)
states: 34,377,683,353,722 (13)
abstracting: (1<=p97)
states: 28,803,707,295,623 (13)
abstracting: (p97<=1)
states: 204,026,655,412,098 (14)
abstracting: (0<=p50)
states: 204,026,655,412,098 (14)
abstracting: (p50<=0)
states: 136,722,475,039,962 (14)
abstracting: (0<=p63)
states: 204,026,655,412,098 (14)
abstracting: (p63<=0)
states: 162,987,953,184,227 (14)
abstracting: (0<=p90)
states: 204,026,655,412,098 (14)
abstracting: (p90<=0)
states: 102,015,919,958,131 (14)
abstracting: (0<=p115)
states: 204,026,655,412,098 (14)
abstracting: (p115<=0)
states: 163,268,117,174,886 (14)
abstracting: (0<=p90)
states: 204,026,655,412,098 (14)
abstracting: (p90<=0)
states: 102,015,919,958,131 (14)
abstracting: (0<=p113)
states: 204,026,655,412,098 (14)
abstracting: (p113<=0)
states: 163,091,878,947,384 (14)
abstracting: (0<=p92)
states: 204,026,655,412,098 (14)
abstracting: (p92<=0)
states: 102,010,735,453,968 (14)
abstracting: (0<=p106)
states: 204,026,655,412,098 (14)
abstracting: (p106<=0)
states: 174,918,332,428,470 (14)
abstracting: (1<=p71)
states: 365,646 (5)
abstracting: (p71<=1)
states: 204,026,655,412,098 (14)
abstracting: (0<=p110)
states: 204,026,655,412,098 (14)
abstracting: (p110<=0)
states: 174,792,611,944,248 (14)
abstracting: (0<=p85)
states: 204,026,655,412,098 (14)
abstracting: (p85<=0)
states: 122,942,326,681,379 (14)
abstracting: (0<=p100)
states: 204,026,655,412,098 (14)
abstracting: (p100<=0)
states: 174,669,746,120,215 (14)
abstracting: (0<=p101)
states: 204,026,655,412,098 (14)
abstracting: (p101<=0)
states: 174,669,746,120,215 (14)
abstracting: (0<=p19)
states: 204,026,655,412,098 (14)
abstracting: (p19<=0)
states: 123,066,533,647,675 (14)
abstracting: (0<=p39)
states: 204,026,655,412,098 (14)
abstracting: (p39<=0)
states: 169,804,698,705,499 (14)
abstracting: (1<=p29)
states: 353,434,652 (8)
abstracting: (p29<=1)
states: 204,026,655,412,098 (14)
abstracting: (0<=p107)
states: 204,026,655,412,098 (14)
abstracting: (p107<=0)
states: 174,892,870,121,459 (14)
abstracting: (0<=p36)
states: 204,026,655,412,098 (14)
abstracting: (p36<=0)
states: 170,228,750,461,526 (14)
abstracting: (1<=p51)
states: 68,276,712,845,259 (13)
abstracting: (p51<=1)
states: 204,026,655,412,098 (14)
abstracting: (1<=p53)
states: 67,360,971,720,998 (13)
abstracting: (p53<=1)
states: 204,026,655,412,098 (14)
abstracting: (1<=p66)
states: 365,646 (5)
abstracting: (p66<=1)
states: 204,026,655,412,098 (14)
abstracting: (1<=p99)
states: 28,820,514,808,497 (13)
abstracting: (p99<=1)
states: 204,026,655,412,098 (14)
abstracting: (1<=p95)
states: 29,353,245,170,202 (13)
abstracting: (p95<=1)
states: 204,026,655,412,098 (14)
abstracting: (0<=p75)
states: 204,026,655,412,098 (14)
abstracting: (p75<=0)
states: 153,164,921,302,710 (14)
abstracting: (0<=p52)
states: 204,026,655,412,098 (14)
abstracting: (p52<=0)
states: 135,806,733,915,701 (14)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 204,026,655,412,098 (14)
-> the formula is FALSE

FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.439sec

totally nodes used: 71607187 (7.2e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 309384032 806375151 1115759183
used/not used/entry size/cache size: 45864492 21244372 16 1024MB
basic ops cache: hits/miss/sum: 5831734 16295708 22127442
used/not used/entry size/cache size: 9103993 7673223 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: 729203 2075689 2804892
used/not used/entry size/cache size: 1845149 6543459 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 60084305
1 6255823
2 671750
3 86262
4 9690
5 943
6 81
7 9
8 1
9 0
>= 10 0

Total processing time: 4m42.711sec


BK_STOP 1679509695609

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

300330 270462 305657 404733 291231
iterations count:550261 (5448), effective:63066 (624)

initing FirstDep: 0m 0.000sec

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="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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 r394-oct2-167903717900399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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