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.r522-tall-167987247200350.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 Murphy-PT-D2N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N100-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D2N100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680892899871

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:41:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:41:41] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:41:41] [INFO ] Transformed 18 places.
[2023-04-07 18:41:41] [INFO ] Transformed 21 transitions.
[2023-04-07 18:41:41] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10062 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=108 ) properties (out of 16) seen :7
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :1
FORMULA Murphy-PT-D2N100-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:41:42] [INFO ] Computed 4 invariants in 5 ms
[2023-04-07 18:41:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:42] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 18:41:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:42] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:42] [INFO ] After 40ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:42] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 18:41:42] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 49 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 8 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:42] [INFO ] Invariant cache hit.
[2023-04-07 18:41:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10091 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1009 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 334717 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334717 steps, saw 218063 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 7 properties.
[2023-04-07 18:41:45] [INFO ] Invariant cache hit.
[2023-04-07 18:41:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:41:45] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 18:41:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:45] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:45] [INFO ] After 39ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:45] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 18:41:45] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 95 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:46] [INFO ] Invariant cache hit.
[2023-04-07 18:41:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 18:41:46] [INFO ] Invariant cache hit.
[2023-04-07 18:41:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 18:41:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:41:46] [INFO ] Invariant cache hit.
[2023-04-07 18:41:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-04-07 18:41:46] [INFO ] Invariant cache hit.
[2023-04-07 18:41:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:41:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 18:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:41:46] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:46] [INFO ] After 51ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-07 18:41:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-07 18:41:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-07 18:41:46] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:41:46] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 18:41:46] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-04-07 18:41:46] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-07 18:41:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
[2023-04-07 18:41:46] [INFO ] Flatten gal took : 16 ms
Total runtime 5440 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_PT_D2N100
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.698sec


RS generation: 0m20.532sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



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

checking: AG [~ [9<=p17]]
normalized: ~ [E [true U 9<=p17]]

abstracting: (9<=p17)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [18<=p16]
normalized: E [true U 18<=p16]

abstracting: (18<=p16)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [3<=p12]]
normalized: ~ [E [true U 3<=p12]]

abstracting: (3<=p12)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [p13<=58]
normalized: ~ [E [true U ~ [p13<=58]]]

abstracting: (p13<=58)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[p16<=p5 & ~ [61<=p10]] & [~ [p9<=50] & ~ [p9<=89]]] & [[[~ [p12<=p4] | ~ [p7<=p1]] & [p1<=p11 | p17<=81]] & [[p10<=p0 | 78<=p13] & [[~ [p7<=p10] | p16<=p8] & [[~ [p3<=p6] & [[p1<=p12 & p0<=p10] | [[p11<=p15 & ~ [66<=p11]] & [~ [98<=p0] & [~ [25<=p12] & [[~ [20<=p1] & ~ [p4<=54]] | [p1<=28 & [20<=p5 & p8<=46]]]]]]]] | [[~ [p12<=p15] & p14<=p13] & [p17<=p12 & [[54<=p9 | [74<=p10 | 4<=p2]] & [25<=p13 | [p7<=p2 | [p15<=67 & 68<=p15]]]]]]]]]]]]
normalized: E [true U [[[[[[[p17<=p12 & [[25<=p13 | [p7<=p2 | [p15<=67 & 68<=p15]]] & [54<=p9 | [74<=p10 | 4<=p2]]]] & [p14<=p13 & ~ [p12<=p15]]] | [[[[[[[p1<=28 & [20<=p5 & p8<=46]] | [~ [p4<=54] & ~ [20<=p1]]] & ~ [25<=p12]] & ~ [98<=p0]] & [p11<=p15 & ~ [66<=p11]]] | [p1<=p12 & p0<=p10]] & ~ [p3<=p6]]] & [p16<=p8 | ~ [p7<=p10]]] & [p10<=p0 | 78<=p13]] & [[p1<=p11 | p17<=81] & [~ [p7<=p1] | ~ [p12<=p4]]]] & [[~ [p9<=89] & ~ [p9<=50]] & [p16<=p5 & ~ [61<=p10]]]]]

abstracting: (61<=p10)
states: 0
abstracting: (p16<=p5)
states: 1,177,925,715,504 (12)
abstracting: (p9<=50)
states: 1,207,044,185,616 (12)
abstracting: (p9<=89)
states: 1,207,044,185,616 (12)
abstracting: (p12<=p4)
states: 1,187,575,696,728 (12)
abstracting: (p7<=p1)
states: 1,207,044,185,616 (12)
abstracting: (p17<=81)
states: 1,207,044,185,616 (12)
abstracting: (p1<=p11)
states: 29,193,994,188 (10)
abstracting: (78<=p13)
states: 0
abstracting: (p10<=p0)
states: 1,197,313,691,148 (12)
abstracting: (p7<=p10)
states: 29,193,994,188 (10)
abstracting: (p16<=p8)
states: 1,177,933,204,656 (12)
abstracting: (p3<=p6)
states: 603,527,081,976 (11)
abstracting: (p0<=p10)
states: 29,193,994,188 (10)
abstracting: (p1<=p12)
states: 38,759,299,128 (10)
abstracting: (66<=p11)
states: 0
abstracting: (p11<=p15)
states: 1,106,457,170,148 (12)
abstracting: (98<=p0)
states: 175,117,033,728 (11)
abstracting: (25<=p12)
states: 0
abstracting: (20<=p1)
states: 860,867,834,112 (11)
abstracting: (p4<=54)
states: 758,809,445,472 (11)
abstracting: (p8<=46)
states: 682,663,619,088 (11)
abstracting: (20<=p5)
states: 860,858,940,960 (11)
abstracting: (p1<=28)
states: 473,282,965,872 (11)
abstracting: (p12<=p15)
states: 804,696,123,744 (11)
abstracting: (p14<=p13)
states: 804,696,123,744 (11)
abstracting: (4<=p2)
states: 1,130,191,367,040 (12)
abstracting: (74<=p10)
states: 0
abstracting: (54<=p9)
states: 0
abstracting: (68<=p15)
states: 0
abstracting: (p15<=67)
states: 1,207,044,185,616 (12)
abstracting: (p7<=p2)
states: 608,450,537,592 (11)
abstracting: (25<=p13)
states: 0
abstracting: (p17<=p12)
states: 603,522,092,808 (11)
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.830sec

checking: AG [[[~ [p17<=p13] | [~ [12<=p13] | [~ [57<=p9] & [~ [p8<=71] | [[p12<=p11 & [35<=p11 & [~ [p8<=p15] | [~ [p17<=p13] | [~ [p16<=71] & ~ [p4<=p1]]]]]] | [p17<=p9 & p15<=58]]]]]] | [[p6<=p8 & [[~ [13<=p10] & [~ [4<=p4] & p9<=p5]] | [[59<=p11 | 14<=p0] & [31<=p0 | [~ [p17<=p4] & ~ [p14<=24]]]]]] | [[[~ [p17<=p9] | [[[p12<=p4 & p10<=6] & [~ [76<=p2] & [~ [p15<=86] & ~ [36<=p13]]]] | [[~ [27<=p14] | [p11<=p0 | p8<=p14]] & [~ [29<=p11] | ~ [p2<=94]]]]] & [p6<=9 | [~ [p9<=10] | p17<=52]]] | [[p15<=p11 & [~ [p5<=p3] & ~ [p15<=70]]] & [~ [p11<=79] & [[~ [p15<=p16] | [57<=p3 | [~ [68<=p9] & p8<=41]]] & [48<=p0 | [p5<=p9 | 28<=p3]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[48<=p0 | [p5<=p9 | 28<=p3]] & [[57<=p3 | [p8<=41 & ~ [68<=p9]]] | ~ [p15<=p16]]] & ~ [p11<=79]] & [p15<=p11 & [~ [p15<=70] & ~ [p5<=p3]]]] | [[p6<=9 | [p17<=52 | ~ [p9<=10]]] & [[[[~ [p2<=94] | ~ [29<=p11]] & [[p11<=p0 | p8<=p14] | ~ [27<=p14]]] | [[[~ [36<=p13] & ~ [p15<=86]] & ~ [76<=p2]] & [p12<=p4 & p10<=6]]] | ~ [p17<=p9]]]] | [p6<=p8 & [[[31<=p0 | [~ [p14<=24] & ~ [p17<=p4]]] & [59<=p11 | 14<=p0]] | [[p9<=p5 & ~ [4<=p4]] & ~ [13<=p10]]]]] | [[[[[[p17<=p9 & p15<=58] | [p12<=p11 & [35<=p11 & [[[~ [p4<=p1] & ~ [p16<=71]] | ~ [p17<=p13]] | ~ [p8<=p15]]]]] | ~ [p8<=71]] & ~ [57<=p9]] | ~ [12<=p13]] | ~ [p17<=p13]]]]]]

abstracting: (p17<=p13)
states: 603,522,092,808 (11)
abstracting: (12<=p13)
states: 0
abstracting: (57<=p9)
states: 0
abstracting: (p8<=71)
states: 891,446,977,872 (11)
abstracting: (p8<=p15)
states: 48,324,604,068 (10)
abstracting: (p17<=p13)
states: 603,522,092,808 (11)
abstracting: (p16<=71)
states: 1,207,044,185,616 (12)
abstracting: (p4<=p1)
states: 603,527,081,976 (11)
abstracting: (35<=p11)
states: 0
abstracting: (p12<=p11)
states: 603,522,092,808 (11)
abstracting: (p15<=58)
states: 1,207,044,185,616 (12)
abstracting: (p17<=p9)
states: 402,348,061,872 (11)
abstracting: (13<=p10)
states: 0
abstracting: (4<=p4)
states: 1,130,181,454,368 (12)
abstracting: (p9<=p5)
states: 1,197,309,941,172 (12)
abstracting: (14<=p0)
states: 955,047,324,672 (11)
abstracting: (59<=p11)
states: 0
abstracting: (p17<=p4)
states: 1,177,925,715,504 (12)
abstracting: (p14<=24)
states: 1,207,044,185,616 (12)
abstracting: (31<=p0)
states: 707,650,067,520 (11)
abstracting: (p6<=p8)
states: 608,450,537,592 (11)
abstracting: (p17<=p9)
states: 402,348,061,872 (11)
abstracting: (p10<=6)
states: 1,207,044,185,616 (12)
abstracting: (p12<=p4)
states: 1,187,575,696,728 (12)
abstracting: (76<=p2)
states: 289,525,938,624 (11)
abstracting: (p15<=86)
states: 1,207,044,185,616 (12)
abstracting: (36<=p13)
states: 0
abstracting: (27<=p14)
states: 0
abstracting: (p8<=p14)
states: 38,759,299,128 (10)
abstracting: (p11<=p0)
states: 1,197,313,691,148 (12)
abstracting: (29<=p11)
states: 0
abstracting: (p2<=94)
states: 1,018,884,216,528 (12)
abstracting: (p9<=10)
states: 1,207,044,185,616 (12)
abstracting: (p17<=52)
states: 1,207,044,185,616 (12)
abstracting: (p6<=9)
states: 184,759,333,776 (11)
abstracting: (p5<=p3)
states: 608,453,064,576 (11)
abstracting: (p15<=70)
states: 1,207,044,185,616 (12)
abstracting: (p15<=p11)
states: 402,348,061,872 (11)
abstracting: (p11<=79)
states: 1,207,044,185,616 (12)
abstracting: (p15<=p16)
states: 771,167,118,588 (11)
abstracting: (68<=p9)
states: 0
abstracting: (p8<=41)
states: 630,134,924,688 (11)
abstracting: (57<=p3)
states: 430,657,848,792 (11)
abstracting: (28<=p3)
states: 746,997,602,976 (11)
abstracting: (p5<=p9)
states: 29,202,733,332 (10)
abstracting: (48<=p0)
states: 514,257,389,568 (11)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.765sec

checking: AG [[[[~ [41<=p10] | ~ [p15<=p17]] | [~ [p11<=67] | [[[~ [p17<=84] & [~ [p4<=97] | ~ [59<=p1]]] & [[[~ [2<=p8] | ~ [p13<=p14]] | [p12<=p16 | p17<=41]] & [p13<=28 | 61<=p2]]] | [~ [p9<=28] & ~ [p12<=73]]]]] | [[[~ [76<=p4] & [74<=p0 & p1<=94]] | [[~ [p14<=p4] & [~ [75<=p3] | [~ [39<=p2] | ~ [p7<=41]]]] | [p11<=12 & [80<=p7 & [p17<=p1 | [[~ [p17<=56] | ~ [p4<=61]] & [~ [95<=p10] | ~ [p11<=85]]]]]]]] | [[78<=p7 & [p7<=p15 & [[~ [p8<=p16] | ~ [p8<=85]] | [~ [p6<=61] | [[~ [84<=p5] & ~ [p6<=p4]] | [[p13<=p17 & p16<=2] & [p2<=24 & p17<=p4]]]]]]] | [[p17<=p4 & [p7<=p16 | [[[~ [p9<=27] | ~ [40<=p4]] | [93<=p8 | [50<=p13 & p16<=p13]]] & [[57<=p4 & [p2<=p8 | ~ [p12<=45]]] | [~ [34<=p9] & [~ [p15<=p6] & [70<=p13 | [p13<=p8 | p2<=38]]]]]]]] | [p2<=p12 & [[~ [p14<=p10] | [[~ [87<=p3] & [~ [43<=p8] & ~ [p3<=24]]] & [~ [p4<=p8] & [p7<=83 & 3<=p5]]]] & [p2<=24 | 90<=p10]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[p2<=p12 & [[p2<=24 | 90<=p10] & [[[[p7<=83 & 3<=p5] & ~ [p4<=p8]] & [[~ [p3<=24] & ~ [43<=p8]] & ~ [87<=p3]]] | ~ [p14<=p10]]]] | [p17<=p4 & [p7<=p16 | [[[[[70<=p13 | [p13<=p8 | p2<=38]] & ~ [p15<=p6]] & ~ [34<=p9]] | [57<=p4 & [p2<=p8 | ~ [p12<=45]]]] & [[93<=p8 | [50<=p13 & p16<=p13]] | [~ [40<=p4] | ~ [p9<=27]]]]]]] | [78<=p7 & [p7<=p15 & [[[[[p2<=24 & p17<=p4] & [p13<=p17 & p16<=2]] | [~ [p6<=p4] & ~ [84<=p5]]] | ~ [p6<=61]] | [~ [p8<=85] | ~ [p8<=p16]]]]]] | [[[p11<=12 & [80<=p7 & [p17<=p1 | [[~ [p11<=85] | ~ [95<=p10]] & [~ [p4<=61] | ~ [p17<=56]]]]]] | [[[~ [p7<=41] | ~ [39<=p2]] | ~ [75<=p3]] & ~ [p14<=p4]]] | [[74<=p0 & p1<=94] & ~ [76<=p4]]]] | [[[[~ [p12<=73] & ~ [p9<=28]] | [[[p13<=28 | 61<=p2] & [[p12<=p16 | p17<=41] | [~ [p13<=p14] | ~ [2<=p8]]]] & [[~ [59<=p1] | ~ [p4<=97]] & ~ [p17<=84]]]] | ~ [p11<=67]] | [~ [p15<=p17] | ~ [41<=p10]]]]]]]

abstracting: (41<=p10)
states: 0
abstracting: (p15<=p17)
states: 771,167,118,588 (11)
abstracting: (p11<=67)
states: 1,207,044,185,616 (12)
abstracting: (p17<=84)
states: 1,207,044,185,616 (12)
abstracting: (p4<=97)
states: 1,031,931,866,736 (12)
abstracting: (59<=p1)
states: 413,643,391,200 (11)
abstracting: (2<=p8)
states: 1,168,117,186,176 (12)
abstracting: (p13<=p14)
states: 804,696,123,744 (11)
abstracting: (p17<=41)
states: 1,207,044,185,616 (12)
abstracting: (p12<=p16)
states: 938,812,144,368 (11)
abstracting: (61<=p2)
states: 397,164,642,336 (11)
abstracting: (p13<=28)
states: 1,207,044,185,616 (12)
abstracting: (p9<=28)
states: 1,207,044,185,616 (12)
abstracting: (p12<=73)
states: 1,207,044,185,616 (12)
abstracting: (76<=p4)
states: 289,520,178,336 (11)
abstracting: (p1<=94)
states: 1,018,884,216,528 (12)
abstracting: (74<=p0)
states: 302,336,820,864 (11)
abstracting: (p14<=p4)
states: 1,187,575,696,728 (12)
abstracting: (75<=p3)
states: 295,925,544,288 (11)
abstracting: (39<=p2)
states: 610,531,248,096 (11)
abstracting: (p7<=41)
states: 630,134,924,688 (11)
abstracting: (p17<=56)
states: 1,207,044,185,616 (12)
abstracting: (p4<=61)
states: 817,991,424,144 (11)
abstracting: (95<=p10)
states: 0
abstracting: (p11<=85)
states: 1,207,044,185,616 (12)
abstracting: (p17<=p1)
states: 1,177,933,204,656 (12)
abstracting: (80<=p7)
states: 265,206,783,744 (11)
abstracting: (p11<=12)
states: 1,207,044,185,616 (12)
abstracting: (p8<=p16)
states: 48,324,604,068 (10)
abstracting: (p8<=85)
states: 975,226,571,280 (11)
abstracting: (p6<=61)
states: 817,984,944,144 (11)
abstracting: (84<=p5)
states: 242,544,543,264 (11)
abstracting: (p6<=p4)
states: 608,447,961,792 (11)
abstracting: (p16<=2)
states: 1,005,870,154,680 (12)
abstracting: (p13<=p17)
states: 938,812,144,368 (11)
abstracting: (p17<=p4)
states: 1,177,925,715,504 (12)
abstracting: (p2<=24)
states: 418,748,573,232 (11)
abstracting: (p7<=p15)
states: 48,324,604,068 (10)
abstracting: (78<=p7)
states: 277,153,035,264 (11)
abstracting: (p9<=27)
states: 1,207,044,185,616 (12)
abstracting: (40<=p4)
states: 599,090,382,144 (11)
abstracting: (p16<=p13)
states: 603,522,092,808 (11)
abstracting: (50<=p13)
states: 0
abstracting: (93<=p8)
states: 197,248,994,208 (11)
abstracting: (p12<=45)
states: 1,207,044,185,616 (12)
abstracting: (p2<=p8)
states: 1,207,044,185,616 (12)
abstracting: (57<=p4)
states: 430,657,848,792 (11)
abstracting: (34<=p9)
states: 0
abstracting: (p15<=p6)
states: 1,177,933,204,656 (12)
abstracting: (p2<=38)
states: 596,512,937,520 (11)
abstracting: (p13<=p8)
states: 1,187,581,522,824 (12)
abstracting: (70<=p13)
states: 0
abstracting: (p7<=p16)
states: 48,324,604,068 (10)
abstracting: (p17<=p4)
states: 1,177,925,715,504 (12)
abstracting: (p14<=p10)
states: 603,522,092,808 (11)
abstracting: (87<=p3)
states: 226,637,865,648 (11)
abstracting: (43<=p8)
states: 566,146,028,448 (11)
abstracting: (p3<=24)
states: 418,757,189,688 (11)
abstracting: (p4<=p8)
states: 608,458,069,728 (11)
abstracting: (3<=p5)
states: 1,149,144,298,272 (12)
abstracting: (p7<=83)
states: 964,494,274,320 (11)
abstracting: (90<=p10)
states: 0
abstracting: (p2<=24)
states: 418,748,573,232 (11)
abstracting: (p2<=p12)
states: 38,759,299,128 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.360sec

totally nodes used: 6870936 (6.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 216310976 6443604 222754580
used/not used/entry size/cache size: 6883594 60225270 16 1024MB
basic ops cache: hits/miss/sum: 85803739 33775822 119579561
used/not used/entry size/cache size: 15139879 1637337 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: 14498769 2414453 16913222
used/not used/entry size/cache size: 2080477 6308131 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 62020582
1 3963837
2 1010546
3 87408
4 19604
5 3937
6 695
7 390
8 79
9 400
>= 10 1386

Total processing time: 1m 0.529sec


BK_STOP 1680892968153

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:14959 (712), effective:3586 (170)

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="Murphy-PT-D2N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Murphy-PT-D2N100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247200350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N100.tgz
mv Murphy-PT-D2N100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;