Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900391.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m64, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679351430698

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=SieveSingleMsgMbox-PT-d0m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:30:32] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-20 22:30:32] [INFO ] Transformed 262 places.
[2023-03-20 22:30:32] [INFO ] Transformed 73 transitions.
[2023-03-20 22:30:32] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 122 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 293415 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{2=1, 3=1, 4=1, 8=1, 10=1, 12=1, 13=1, 14=1}
Probabilistic random walk after 293415 steps, saw 144218 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :8
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 22:30:36] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-20 22:30:36] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-20 22:30:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:30:36] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-20 22:30:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-20 22:30:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:30:36] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-20 22:30:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:30:36] [INFO ] After 44ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :5 sat :2
[2023-03-20 22:30:37] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 5 ms to minimize.
[2023-03-20 22:30:37] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2023-03-20 22:30:37] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2023-03-20 22:30:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2023-03-20 22:30:37] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 22:30:37] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 22 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 65 transition count 68
Applied a total of 11 rules in 16 ms. Remains 65 /72 variables (removed 7) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/72 places, 68/73 transitions.
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 585149 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 585149 steps, saw 289693 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 68 rows 65 cols
[2023-03-20 22:30:40] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 22:30:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:30:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:30:40] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 22:30:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:30:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:30:40] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 22:30:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 22:30:40] [INFO ] After 49ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 22:30:40] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 22:30:40] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 83 ms.
Support contains 22 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-20 22:30:40] [INFO ] Invariant cache hit.
[2023-03-20 22:30:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 22:30:40] [INFO ] Invariant cache hit.
[2023-03-20 22:30:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 22:30:40] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-20 22:30:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:30:40] [INFO ] Invariant cache hit.
[2023-03-20 22:30:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 65/65 places, 68/68 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 65 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 63 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 62 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 61 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 60 transition count 63
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Applied a total of 12 rules in 14 ms. Remains 60 /65 variables (removed 5) and now considering 63/68 (removed 5) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 60 cols
[2023-03-20 22:30:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 22:30:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:30:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:30:41] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 22:30:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:30:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:30:41] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 22:30:41] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 22:30:41] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 22:30:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-20 22:30:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 68 transitions and 269 arcs took 1 ms.
[2023-03-20 22:30:41] [INFO ] Flatten gal took : 22 ms
Total runtime 8758 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: SieveSingleMsgMbox_PT_d0m64
(NrP: 65 NrTr: 68 NrArc: 269)

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

net check time: 0m 0.000sec

init dd package: 0m 3.138sec


RS generation: 4m12.983sec


-> reachability set: #nodes 131183 (1.3e+05) #states 1,207,224,842,413 (12)



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

checking: EF [[[1<=p41 & 1<=p1] & [1<=p54 & [[p1<=0 | p33<=0] & [p12<=0 | [p20<=0 | 1<=p44]]]]]]
normalized: E [true U [[1<=p54 & [[p12<=0 | [p20<=0 | 1<=p44]] & [p1<=0 | p33<=0]]] & [1<=p41 & 1<=p1]]]

abstracting: (1<=p1)
states: 185,222,410,328 (11)
abstracting: (1<=p41)
states: 1,082,444,641,976 (12)
abstracting: (p33<=0)
states: 794,523,026,461 (11)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (1<=p44)
states: 32,846,156,163 (10)
abstracting: (p20<=0)
states: 11,537,324,808 (10)
abstracting: (p12<=0)
states: 1,203,813,034,861 (12)
abstracting: (1<=p54)
states: 1,081,751,206,616 (12)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.544sec

checking: EF [[[[p7<=0 | p20<=0] | [p1<=0 | p45<=0]] & [[[[1<=p1 & 1<=p64] & [1<=p6 & 1<=p20]] & [[1<=p12 & [p1<=0 | p28<=0]] & [[p1<=0 | p24<=0] & [p1<=0 | p27<=0]]]] | [[[p1<=0 | p20<=0] & [[1<=p1 & 1<=p62] | [[1<=p2 & 1<=p36] & [1<=p1 & 1<=p22]]]] | [[1<=p1 & [1<=p31 & 1<=p20]] & [1<=p60 & [[p7<=0 | p20<=0] & [p1<=0 | [p32<=0 | 1<=p3]]]]]]]]]
normalized: E [true U [[[[[1<=p60 & [[p1<=0 | [p32<=0 | 1<=p3]] & [p7<=0 | p20<=0]]] & [1<=p1 & [1<=p31 & 1<=p20]]] | [[[[1<=p1 & 1<=p22] & [1<=p2 & 1<=p36]] | [1<=p1 & 1<=p62]] & [p1<=0 | p20<=0]]] | [[[[p1<=0 | p27<=0] & [p1<=0 | p24<=0]] & [1<=p12 & [p1<=0 | p28<=0]]] & [[1<=p6 & 1<=p20] & [1<=p1 & 1<=p64]]]] & [[p1<=0 | p45<=0] | [p7<=0 | p20<=0]]]]

abstracting: (p20<=0)
states: 11,537,324,808 (10)
abstracting: (p7<=0)
states: 1,202,107,125,325 (12)
abstracting: (p45<=0)
states: 865,396,604,749 (11)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (1<=p64)
states: 1,081,869,407,960 (12)
abstracting: (1<=p1)
states: 185,222,410,328 (11)
abstracting: (1<=p20)
states: 1,195,687,517,605 (12)
abstracting: (1<=p6)
states: 5,117,717,088 (9)
abstracting: (p28<=0)
states: 649,918,023,799 (11)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (1<=p12)
states: 3,411,807,552 (9)
abstracting: (p24<=0)
states: 1,207,224,842,405 (12)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (p27<=0)
states: 1,207,224,842,391 (12)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (p20<=0)
states: 11,537,324,808 (10)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (1<=p62)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 185,222,410,328 (11)
abstracting: (1<=p36)
states: 69,682,395,002 (10)
abstracting: (1<=p2)
states: 175,394,239,524 (11)
abstracting: (1<=p22)
states: 2
abstracting: (1<=p1)
states: 185,222,410,328 (11)
abstracting: (1<=p20)
states: 1,195,687,517,605 (12)
abstracting: (1<=p31)
states: 29,982,231,312 (10)
abstracting: (1<=p1)
states: 185,222,410,328 (11)
abstracting: (p20<=0)
states: 11,537,324,808 (10)
abstracting: (p7<=0)
states: 1,202,107,125,325 (12)
abstracting: (1<=p3)
states: 1
abstracting: (p32<=0)
states: 1,174,564,928,317 (12)
abstracting: (p1<=0)
states: 1,022,002,432,085 (12)
abstracting: (1<=p60)
states: 58,350,505,408 (10)
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m64-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.381sec

totally nodes used: 23546737 (2.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2164419230 471920691 2636339921
used/not used/entry size/cache size: 67064890 43974 16 1024MB
basic ops cache: hits/miss/sum: 29565342 6808580 36373922
used/not used/entry size/cache size: 8602639 8174577 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: 3652892 765668 4418560
used/not used/entry size/cache size: 731980 7656628 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 48993382
1 14424806
2 2843407
3 435380
4 249573
5 68317
6 43438
7 13779
8 9963
9 5390
>= 10 21429

Total processing time: 4m44.605sec


BK_STOP 1679351726146

--------------------
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

81573 64641 136926
iterations count:376238 (5532), effective:12410 (182)

initing FirstDep: 0m 0.000sec


iterations count:4589 (67), effective:166 (2)

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="SieveSingleMsgMbox-PT-d0m64"
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 SieveSingleMsgMbox-PT-d0m64, 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 r426-tajo-167905978900391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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