About the Execution of Marcie+red for JoinFreeModules-PT-0003
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.728 | 7180.00 | 8190.00 | 319.20 | FFTTFTTFFFTFFFTF | normal |
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.r234-tall-167856419900142.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 JoinFreeModules-PT-0003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900142
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.4K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0003-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679451953996
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=JoinFreeModules-PT-0003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:25:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:25:55] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-22 02:25:55] [INFO ] Transformed 16 places.
[2023-03-22 02:25:55] [INFO ] Transformed 25 transitions.
[2023-03-22 02:25:55] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 23 steps, including 0 resets, run visited all 7 properties in 9 ms. (steps per millisecond=2 )
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 153 ms.
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: JoinFreeModules_PT_0003
(NrP: 16 NrTr: 25 NrArc: 71)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.728sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 55 (5.5e+01) #states 35,937 (4)
starting MCC model checker
--------------------------
checking: AG [3<=p13]
normalized: ~ [E [true U ~ [3<=p13]]]
abstracting: (3<=p13)
states: 3,267 (3)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [2<=p12]
normalized: E [true U 2<=p12]
abstracting: (2<=p12)
states: 10,890 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [p7<=1]
normalized: E [true U p7<=1]
abstracting: (p7<=1)
states: 25,047 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p6<=p15]
normalized: ~ [E [true U ~ [p6<=p15]]]
abstracting: (p6<=p15)
states: 12,507 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [p6<=p]
normalized: E [true U p6<=p]
abstracting: (p6<=p)
states: 14,157 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p1<=p2]
normalized: ~ [E [true U ~ [p1<=p2]]]
abstracting: (p1<=p2)
states: 16,335 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[3<=p13 & p13<=0]]
normalized: ~ [E [true U ~ [[3<=p13 & p13<=0]]]]
abstracting: (p13<=0)
states: 15,246 (4)
abstracting: (3<=p13)
states: 3,267 (3)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p1<=1 | p11<=p13]]
normalized: ~ [E [true U ~ [[p1<=1 | p11<=p13]]]]
abstracting: (p11<=p13)
states: 14,157 (4)
abstracting: (p1<=1)
states: 14,157 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p9<=p1 | p11<=p]]
normalized: ~ [E [true U ~ [[p9<=p1 | p11<=p]]]]
abstracting: (p11<=p)
states: 14,157 (4)
abstracting: (p9<=p1)
states: 25,707 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[p11<=3 & [~ [p2<=p9] | ~ [p9<=p]]]]
normalized: E [true U [[~ [p9<=p] | ~ [p2<=p9]] & p11<=3]]
abstracting: (p11<=3)
states: 29,403 (4)
abstracting: (p2<=p9)
states: 22,902 (4)
abstracting: (p9<=p)
states: 22,869 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[p3<=0 & [p9<=3 | [[[[p12<=p12 | p9<=0] & 1<=p7] & [[2<=p9 & p7<=0] | 1<=p10]] | [p7<=p7 | [~ [1<=p14] & 1<=p11]]]]] & [p1<=1 & ~ [p5<=p14]]] & 2<=p1]]
normalized: ~ [E [true U ~ [[[[~ [p5<=p14] & p1<=1] & [[[[[~ [1<=p14] & 1<=p11] | p7<=p7] | [[[2<=p9 & p7<=0] | 1<=p10] & [[p12<=p12 | p9<=0] & 1<=p7]]] | p9<=3] & p3<=0]] & 2<=p1]]]]
abstracting: (2<=p1)
states: 21,780 (4)
abstracting: (p3<=0)
states: 15,246 (4)
abstracting: (p9<=3)
states: 32,670 (4)
abstracting: (1<=p7)
states: 22,869 (4)
abstracting: (p9<=0)
states: 17,424 (4)
abstracting: (p12<=p12)
states: 35,937 (4)
abstracting: (1<=p10)
states: 11,979 (4)
abstracting: (p7<=0)
states: 13,068 (4)
abstracting: (2<=p9)
states: 13,068 (4)
abstracting: (p7<=p7)
states: 35,937 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (1<=p14)
states: 18,513 (4)
abstracting: (p1<=1)
states: 14,157 (4)
abstracting: (p5<=p14)
states: 28,446 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[[[[[p12<=3 | [p9<=0 | ~ [p4<=p6]]] & [3<=p8 | [~ [p12<=2] | ~ [[p14<=3 & p<=p1]]]]] & p7<=p9] | p1<=0] | [[p9<=1 | [[2<=p11 & ~ [p12<=3]] & ~ [p14<=p11]]] | ~ [2<=p5]]] | p6<=3]]
normalized: E [true U [[[~ [2<=p5] | [[~ [p14<=p11] & [~ [p12<=3] & 2<=p11]] | p9<=1]] | [[[[[~ [[p14<=3 & p<=p1]] | ~ [p12<=2]] | 3<=p8] & [[~ [p4<=p6] | p9<=0] | p12<=3]] & p7<=p9] | p1<=0]] | p6<=3]]
abstracting: (p6<=3)
states: 29,403 (4)
abstracting: (p1<=0)
states: 8,712 (3)
abstracting: (p7<=p9)
states: 22,869 (4)
abstracting: (p12<=3)
states: 34,848 (4)
abstracting: (p9<=0)
states: 17,424 (4)
abstracting: (p4<=p6)
states: 25,707 (4)
abstracting: (3<=p8)
states: 3,267 (3)
abstracting: (p12<=2)
states: 31,581 (4)
abstracting: (p<=p1)
states: 27,225 (4)
abstracting: (p14<=3)
states: 32,670 (4)
abstracting: (p9<=1)
states: 22,869 (4)
abstracting: (2<=p11)
states: 21,780 (4)
abstracting: (p12<=3)
states: 34,848 (4)
abstracting: (p14<=p11)
states: 22,869 (4)
abstracting: (2<=p5)
states: 3,267 (3)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[~ [[~ [1<=p] & ~ [3<=p9]]] | ~ [p10<=2]] | [3<=p10 & [[[p12<=p4 & ~ [[[p8<=0 | p5<=p14] & ~ [p4<=3]]]] | [2<=p4 & [~ [p8<=p3] | ~ [[p9<=p4 & p8<=p8]]]]] & [[[~ [p7<=1] | p7<=0] | 1<=p15] & [[~ [[p4<=p & p6<=p]] | [[p2<=p15 | p13<=1] & [3<=p1 | p2<=p13]]] & [p15<=1 & [~ [1<=p11] & ~ [2<=p4]]]]]]]]]]
normalized: E [true U ~ [[[[[[[[~ [2<=p4] & ~ [1<=p11]] & p15<=1] & [[[3<=p1 | p2<=p13] & [p2<=p15 | p13<=1]] | ~ [[p4<=p & p6<=p]]]] & [[~ [p7<=1] | p7<=0] | 1<=p15]] & [[[~ [[p9<=p4 & p8<=p8]] | ~ [p8<=p3]] & 2<=p4] | [~ [[~ [p4<=3] & [p8<=0 | p5<=p14]]] & p12<=p4]]] & 3<=p10] | [~ [p10<=2] | ~ [[~ [3<=p9] & ~ [1<=p]]]]]]]
abstracting: (1<=p)
states: 35,937 (4)
abstracting: (3<=p9)
states: 13,068 (4)
abstracting: (p10<=2)
states: 32,670 (4)
abstracting: (3<=p10)
states: 3,267 (3)
abstracting: (p12<=p4)
states: 22,902 (4)
abstracting: (p5<=p14)
states: 28,446 (4)
abstracting: (p8<=0)
states: 15,246 (4)
abstracting: (p4<=3)
states: 32,670 (4)
abstracting: (2<=p4)
states: 13,068 (4)
abstracting: (p8<=p3)
states: 23,760 (4)
abstracting: (p8<=p8)
states: 35,937 (4)
abstracting: (p9<=p4)
states: 24,090 (4)
abstracting: (1<=p15)
states: 11,979 (4)
abstracting: (p7<=0)
states: 13,068 (4)
abstracting: (p7<=1)
states: 25,047 (4)
abstracting: (p6<=p)
states: 14,157 (4)
abstracting: (p4<=p)
states: 22,869 (4)
abstracting: (p13<=1)
states: 27,225 (4)
abstracting: (p2<=p15)
states: 18,051 (4)
abstracting: (p2<=p13)
states: 21,846 (4)
abstracting: (3<=p1)
states: 13,068 (4)
abstracting: (p15<=1)
states: 32,670 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (2<=p4)
states: 13,068 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[p7<=1 | [p8<=3 & [~ [[[p12<=p14 & ~ [3<=p10]] | [[p13<=p10 & p14<=p7] & [~ [[1<=p6 & p2<=0]] | [[p7<=p11 & 3<=p10] | ~ [3<=p15]]]]]] | [[[1<=p6 | [[p6<=p6 | [p1<=p13 & p13<=p9]] | [[p8<=p12 & p3<=p12] & 3<=p1]]] & 2<=p11] & ~ [[[p7<=3 | [p2<=0 | [1<=p6 & 1<=p10]]] | [p<=1 | ~ [p11<=1]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[~ [p11<=1] | p<=1] | [[[1<=p6 & 1<=p10] | p2<=0] | p7<=3]]] & [[[[[p8<=p12 & p3<=p12] & 3<=p1] | [[p1<=p13 & p13<=p9] | p6<=p6]] | 1<=p6] & 2<=p11]] | ~ [[[[[~ [3<=p15] | [p7<=p11 & 3<=p10]] | ~ [[1<=p6 & p2<=0]]] & [p13<=p10 & p14<=p7]] | [~ [3<=p10] & p12<=p14]]]] & p8<=3] | p7<=1]]]]
abstracting: (p7<=1)
states: 25,047 (4)
abstracting: (p8<=3)
states: 35,937 (4)
abstracting: (p12<=p14)
states: 22,869 (4)
abstracting: (3<=p10)
states: 3,267 (3)
abstracting: (p14<=p7)
states: 22,176 (4)
abstracting: (p13<=p10)
states: 20,031 (4)
abstracting: (p2<=0)
states: 13,068 (4)
abstracting: (1<=p6)
states: 27,225 (4)
abstracting: (3<=p10)
states: 3,267 (3)
abstracting: (p7<=p11)
states: 27,489 (4)
abstracting: (3<=p15)
states: 3,267 (3)
abstracting: (2<=p11)
states: 21,780 (4)
abstracting: (1<=p6)
states: 27,225 (4)
abstracting: (p6<=p6)
states: 35,937 (4)
abstracting: (p13<=p9)
states: 24,585 (4)
abstracting: (p1<=p13)
states: 14,553 (4)
abstracting: (3<=p1)
states: 13,068 (4)
abstracting: (p3<=p12)
states: 24,915 (4)
abstracting: (p8<=p12)
states: 24,915 (4)
abstracting: (p7<=3)
states: 34,848 (4)
abstracting: (p2<=0)
states: 13,068 (4)
abstracting: (1<=p10)
states: 11,979 (4)
abstracting: (1<=p6)
states: 27,225 (4)
abstracting: (p<=1)
states: 35,937 (4)
abstracting: (p11<=1)
states: 14,157 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[~ [[[~ [[p2<=1 | [p7<=p15 | 3<=p4]]] | [3<=p7 & ~ [[~ [[3<=p1 | p4<=0]] | ~ [p12<=0]]]]] | ~ [[2<=p3 & ~ [[~ [[p1<=p11 & p7<=p12]] | 3<=p6]]]]]] & [[[[~ [[p9<=p9 | [[p13<=p5 | p7<=0] | [p10<=3 | 3<=p1]]]] | [p2<=0 & [p7<=p13 & ~ [1<=p9]]]] & [[[~ [[p5<=1 | p9<=1]] | p1<=p3] | p3<=2] | p<=2]] & [p6<=0 & [[2<=p11 & 2<=p10] | [p11<=3 & [p6<=p7 | p<=p13]]]]] & [~ [[~ [[[~ [p<=0] | ~ [p10<=2]] & [[2<=p3 & 2<=p13] & p3<=0]]] | p<=3]] | p13<=p4]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [[[[2<=p3 & 2<=p13] & p3<=0] & [~ [p10<=2] | ~ [p<=0]]]] | p<=3]] | p13<=p4] & [[[[[p6<=p7 | p<=p13] & p11<=3] | [2<=p11 & 2<=p10]] & p6<=0] & [[[[~ [[p5<=1 | p9<=1]] | p1<=p3] | p3<=2] | p<=2] & [[[~ [1<=p9] & p7<=p13] & p2<=0] | ~ [[[[p10<=3 | 3<=p1] | [p13<=p5 | p7<=0]] | p9<=p9]]]]]] & ~ [[~ [[~ [[~ [[p1<=p11 & p7<=p12]] | 3<=p6]] & 2<=p3]] | [[~ [[~ [p12<=0] | ~ [[3<=p1 | p4<=0]]]] & 3<=p7] | ~ [[[p7<=p15 | 3<=p4] | p2<=1]]]]]]]]]
abstracting: (p2<=1)
states: 25,047 (4)
abstracting: (3<=p4)
states: 13,068 (4)
abstracting: (p7<=p15)
states: 18,051 (4)
abstracting: (3<=p7)
states: 4,356 (3)
abstracting: (p4<=0)
states: 17,424 (4)
abstracting: (3<=p1)
states: 13,068 (4)
abstracting: (p12<=0)
states: 13,068 (4)
abstracting: (2<=p3)
states: 8,712 (3)
abstracting: (3<=p6)
states: 13,068 (4)
abstracting: (p7<=p12)
states: 23,100 (4)
abstracting: (p1<=p11)
states: 21,417 (4)
abstracting: (p9<=p9)
states: 35,937 (4)
abstracting: (p7<=0)
states: 13,068 (4)
abstracting: (p13<=p5)
states: 20,031 (4)
abstracting: (3<=p1)
states: 13,068 (4)
abstracting: (p10<=3)
states: 32,670 (4)
abstracting: (p2<=0)
states: 13,068 (4)
abstracting: (p7<=p13)
states: 21,846 (4)
abstracting: (1<=p9)
states: 18,513 (4)
abstracting: (p<=2)
states: 35,937 (4)
abstracting: (p3<=2)
states: 32,670 (4)
abstracting: (p1<=p3)
states: 14,157 (4)
abstracting: (p9<=1)
states: 22,869 (4)
abstracting: (p5<=1)
states: 32,670 (4)
abstracting: (p6<=0)
states: 8,712 (3)
abstracting: (2<=p10)
states: 3,267 (3)
abstracting: (2<=p11)
states: 21,780 (4)
abstracting: (p11<=3)
states: 29,403 (4)
abstracting: (p<=p13)
states: 20,691 (4)
abstracting: (p6<=p7)
states: 16,335 (4)
abstracting: (p13<=p4)
states: 24,585 (4)
abstracting: (p<=3)
states: 35,937 (4)
abstracting: (p<=0)
states: 0
abstracting: (p10<=2)
states: 32,670 (4)
abstracting: (p3<=0)
states: 15,246 (4)
abstracting: (2<=p13)
states: 8,712 (3)
abstracting: (2<=p3)
states: 8,712 (3)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[~ [[[[[~ [p6<=3] & ~ [3<=p10]] & ~ [[[p5<=p6 & 3<=p5] | [p13<=3 & 2<=p5]]]] | [[~ [p15<=3] & [[3<=p & p3<=1] & ~ [p8<=3]]] | [[~ [p3<=1] & ~ [1<=p]] & [3<=p4 & [3<=p7 & p<=p4]]]]] & [[[[p4<=2 & [3<=p4 | p3<=p10]] | ~ [[p1<=2 & p15<=p10]]] | 3<=p4] & [[3<=p15 | [[p11<=p | p6<=2] & [p11<=p11 & p12<=p1]]] & [p11<=1 & ~ [[p6<=p10 & p5<=1]]]]]]] & p13<=p1] & [p5<=0 & ~ [[~ [[p2<=p7 & ~ [2<=p14]]] & [~ [[[[1<=p6 & p5<=p3] & 2<=p2] & [p12<=3 | ~ [1<=p2]]]] & [[~ [[1<=p11 & 2<=p4]] | [p12<=2 & [p4<=p | p6<=3]]] & [1<=p8 | ~ [[p1<=p7 & p<=p15]]]]]]]]]]
normalized: E [true U [[~ [[[[[~ [[p1<=p7 & p<=p15]] | 1<=p8] & [[[p4<=p | p6<=3] & p12<=2] | ~ [[1<=p11 & 2<=p4]]]] & ~ [[[~ [1<=p2] | p12<=3] & [[1<=p6 & p5<=p3] & 2<=p2]]]] & ~ [[~ [2<=p14] & p2<=p7]]]] & p5<=0] & [~ [[[[[~ [[p6<=p10 & p5<=1]] & p11<=1] & [[[p11<=p11 & p12<=p1] & [p11<=p | p6<=2]] | 3<=p15]] & [[~ [[p1<=2 & p15<=p10]] | [[3<=p4 | p3<=p10] & p4<=2]] | 3<=p4]] & [[[[[3<=p7 & p<=p4] & 3<=p4] & [~ [1<=p] & ~ [p3<=1]]] | [[~ [p8<=3] & [3<=p & p3<=1]] & ~ [p15<=3]]] | [~ [[[p13<=3 & 2<=p5] | [p5<=p6 & 3<=p5]]] & [~ [3<=p10] & ~ [p6<=3]]]]]] & p13<=p1]]]
abstracting: (p13<=p1)
states: 28,809 (4)
abstracting: (p6<=3)
states: 29,403 (4)
abstracting: (3<=p10)
states: 3,267 (3)
abstracting: (3<=p5)
states: 3,267 (3)
abstracting: (p5<=p6)
states: 30,756 (4)
abstracting: (2<=p5)
states: 3,267 (3)
abstracting: (p13<=3)
states: 35,937 (4)
abstracting: (p15<=3)
states: 32,670 (4)
abstracting: (p3<=1)
states: 27,225 (4)
abstracting: (3<=p)
states: 0
abstracting: (p8<=3)
states: 35,937 (4)
abstracting: (p3<=1)
states: 27,225 (4)
abstracting: (1<=p)
states: 35,937 (4)
abstracting: (3<=p4)
states: 13,068 (4)
abstracting: (p<=p4)
states: 18,513 (4)
abstracting: (3<=p7)
states: 4,356 (3)
abstracting: (3<=p4)
states: 13,068 (4)
abstracting: (p4<=2)
states: 22,869 (4)
abstracting: (p3<=p10)
states: 20,031 (4)
abstracting: (3<=p4)
states: 13,068 (4)
abstracting: (p15<=p10)
states: 27,159 (4)
abstracting: (p1<=2)
states: 22,869 (4)
abstracting: (3<=p15)
states: 3,267 (3)
abstracting: (p6<=2)
states: 22,869 (4)
abstracting: (p11<=p)
states: 14,157 (4)
abstracting: (p12<=p1)
states: 27,489 (4)
abstracting: (p11<=p11)
states: 35,937 (4)
abstracting: (p11<=1)
states: 14,157 (4)
abstracting: (p5<=1)
states: 32,670 (4)
abstracting: (p6<=p10)
states: 10,890 (4)
abstracting: (p5<=0)
states: 23,958 (4)
abstracting: (p2<=p7)
states: 23,100 (4)
abstracting: (2<=p14)
states: 13,068 (4)
abstracting: (2<=p2)
states: 10,890 (4)
abstracting: (p5<=p3)
states: 27,225 (4)
abstracting: (1<=p6)
states: 27,225 (4)
abstracting: (p12<=3)
states: 34,848 (4)
abstracting: (1<=p2)
states: 22,869 (4)
abstracting: (2<=p4)
states: 13,068 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (p12<=2)
states: 31,581 (4)
abstracting: (p6<=3)
states: 29,403 (4)
abstracting: (p4<=p)
states: 22,869 (4)
abstracting: (1<=p8)
states: 20,691 (4)
abstracting: (p<=p15)
states: 11,979 (4)
abstracting: (p1<=p7)
states: 15,741 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
totally nodes used: 22249 (2.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17519 17632 35151
used/not used/entry size/cache size: 29147 67079717 16 1024MB
basic ops cache: hits/miss/sum: 25438 26760 52198
used/not used/entry size/cache size: 56603 16720613 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: 3098 2376 5474
used/not used/entry size/cache size: 2376 8386232 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 67088865
1 19007
2 611
3 175
4 61
5 36
6 31
7 19
8 12
9 6
>= 10 41
Total processing time: 0m 4.344sec
BK_STOP 1679451961176
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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:116 (4), effective:36 (1)
initing FirstDep: 0m 0.000sec
iterations count:27 (1), effective:1 (0)
iterations count:52 (2), effective:7 (0)
iterations count:29 (1), effective:2 (0)
iterations count:51 (2), effective:9 (0)
iterations count:38 (1), effective:5 (0)
iterations count:41 (1), effective:6 (0)
iterations count:25 (1), effective:0 (0)
iterations count:65 (2), effective:15 (0)
iterations count:108 (4), effective:30 (1)
iterations count:63 (2), effective:12 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:117 (4), effective:27 (1)
iterations count:26 (1), effective:1 (0)
iterations count:159 (6), effective:57 (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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r234-tall-167856419900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 '
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 ;