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.r330-tall-167889203600678.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 ResAllocation-PT-R003C003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 21K 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 ResAllocation-PT-R003C003-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C003-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679180698906

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=ResAllocation-PT-R003C003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:05:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:05:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:05:00] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-18 23:05:00] [INFO ] Transformed 18 places.
[2023-03-18 23:05:00] [INFO ] Transformed 12 transitions.
[2023-03-18 23:05:00] [INFO ] Found NUPN structural information;
[2023-03-18 23:05:00] [INFO ] Parsed PT model containing 18 places and 12 transitions and 48 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.
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 10 steps, including 1 resets, run visited all 8 properties in 10 ms. (steps per millisecond=1 )
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 159 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: ResAllocation_PT_R003C003
(NrP: 18 NrTr: 12 NrArc: 48)

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


-> reachability set: #nodes 62 (6.2e+01) #states 92



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

checking: AG [1<=r_0_1]
normalized: ~ [E [true U ~ [1<=r_0_1]]]

abstracting: (1<=r_0_1)
states: 42
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=r_2_1]
normalized: ~ [E [true U ~ [1<=r_2_1]]]

abstracting: (1<=r_2_1)
states: 52
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=r_0_1]
normalized: E [true U 1<=r_0_1]

abstracting: (1<=r_0_1)
states: 42
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [1<=p_0_1]]
normalized: ~ [E [true U 1<=p_0_1]]

abstracting: (1<=p_0_1)
states: 40
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [r_2_1<=0]
normalized: ~ [E [true U ~ [r_2_1<=0]]]

abstracting: (r_2_1<=0)
states: 40
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[1<=p_0_1 | p_2_1<=0]]
normalized: ~ [E [true U ~ [[1<=p_0_1 | p_2_1<=0]]]]

abstracting: (p_2_1<=0)
states: 52
abstracting: (1<=p_0_1)
states: 40
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [p_1_0<=p_2_0]
normalized: E [true U p_1_0<=p_2_0]

abstracting: (p_1_0<=p_2_0)
states: 88
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [r_1_1<=r_0_2]
normalized: ~ [E [true U ~ [r_1_1<=r_0_2]]]

abstracting: (r_1_1<=r_0_2)
states: 67
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[[r_1_0<=0 & p_0_2<=r_1_0] | r_0_0<=0]] & r_2_0<=0]]
normalized: ~ [E [true U ~ [[~ [[[r_1_0<=0 & p_0_2<=r_1_0] | r_0_0<=0]] & r_2_0<=0]]]]

abstracting: (r_2_0<=0)
states: 44
abstracting: (r_0_0<=0)
states: 48
abstracting: (p_0_2<=r_1_0)
states: 76
abstracting: (r_1_0<=0)
states: 48
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p_0_2<=1 & [~ [[~ [[~ [[1<=p_2_1 | 1<=r_0_1]] & r_2_0<=0]] | p_2_2<=0]] | ~ [p_1_0<=r_2_1]]]]]
normalized: E [true U ~ [[[~ [p_1_0<=r_2_1] | ~ [[~ [[~ [[1<=p_2_1 | 1<=r_0_1]] & r_2_0<=0]] | p_2_2<=0]]] & p_0_2<=1]]]

abstracting: (p_0_2<=1)
states: 92
abstracting: (p_2_2<=0)
states: 60
abstracting: (r_2_0<=0)
states: 44
abstracting: (1<=r_0_1)
states: 42
abstracting: (1<=p_2_1)
states: 40
abstracting: (p_1_0<=r_2_1)
states: 92
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[1<=r_2_1 | ~ [[r_0_0<=0 | [[~ [[[1<=r_0_0 & r_0_2<=r_2_0] | [1<=r_2_0 | p_0_2<=r_2_1]]] & ~ [[1<=r_1_2 | 1<=p_0_0]]] & r_0_2<=r_2_0]]]]]
normalized: ~ [E [true U ~ [[~ [[[[~ [[1<=r_1_2 | 1<=p_0_0]] & ~ [[[1<=r_2_0 | p_0_2<=r_2_1] | [1<=r_0_0 & r_0_2<=r_2_0]]]] & r_0_2<=r_2_0] | r_0_0<=0]] | 1<=r_2_1]]]]

abstracting: (1<=r_2_1)
states: 52
abstracting: (r_0_0<=0)
states: 48
abstracting: (r_0_2<=r_2_0)
states: 74
abstracting: (r_0_2<=r_2_0)
states: 74
abstracting: (1<=r_0_0)
states: 44
abstracting: (p_0_2<=r_2_1)
states: 76
abstracting: (1<=r_2_0)
states: 48
abstracting: (1<=p_0_0)
states: 44
abstracting: (1<=r_1_2)
states: 38
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[~ [1<=r_2_1] | [[[p_1_2<=p_1_0 & ~ [p_1_0<=p_2_0]] | [~ [r_1_1<=r_1_2] | [1<=p_1_1 & 1<=r_0_2]]] & ~ [[[p_1_0<=0 & p_0_2<=0] & r_1_0<=p_2_1]]]] | [p_2_1<=0 & ~ [r_1_1<=0]]]]]
normalized: E [true U ~ [[[~ [r_1_1<=0] & p_2_1<=0] | [~ [1<=r_2_1] | [~ [[[p_1_0<=0 & p_0_2<=0] & r_1_0<=p_2_1]] & [[[1<=p_1_1 & 1<=r_0_2] | ~ [r_1_1<=r_1_2]] | [~ [p_1_0<=p_2_0] & p_1_2<=p_1_0]]]]]]]

abstracting: (p_1_2<=p_1_0)
states: 72
abstracting: (p_1_0<=p_2_0)
states: 88
abstracting: (r_1_1<=r_1_2)
states: 67
abstracting: (1<=r_0_2)
states: 38
abstracting: (1<=p_1_1)
states: 10
abstracting: (r_1_0<=p_2_1)
states: 68
abstracting: (p_0_2<=0)
states: 60
abstracting: (p_1_0<=0)
states: 88
abstracting: (1<=r_2_1)
states: 52
abstracting: (p_2_1<=0)
states: 52
abstracting: (r_1_1<=0)
states: 50
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[[[p_0_0<=r_1_1 | p_0_0<=r_0_2] & [[[~ [p_2_1<=p_1_0] | ~ [1<=r_0_2]] & r_1_2<=1] | ~ [[~ [p_2_2<=0] | [[r_1_0<=r_2_0 & 1<=r_2_0] | [p_1_2<=r_2_2 & r_2_0<=1]]]]]] & p_2_0<=0]] & ~ [p_2_0<=1]]]
normalized: ~ [E [true U ~ [[~ [p_2_0<=1] & ~ [[[[~ [[[[p_1_2<=r_2_2 & r_2_0<=1] | [r_1_0<=r_2_0 & 1<=r_2_0]] | ~ [p_2_2<=0]]] | [[~ [1<=r_0_2] | ~ [p_2_1<=p_1_0]] & r_1_2<=1]] & [p_0_0<=r_1_1 | p_0_0<=r_0_2]] & p_2_0<=0]]]]]]

abstracting: (p_2_0<=0)
states: 48
abstracting: (p_0_0<=r_0_2)
states: 66
abstracting: (p_0_0<=r_1_1)
states: 68
abstracting: (r_1_2<=1)
states: 92
abstracting: (p_2_1<=p_1_0)
states: 52
abstracting: (1<=r_0_2)
states: 38
abstracting: (p_2_2<=0)
states: 60
abstracting: (1<=r_2_0)
states: 48
abstracting: (r_1_0<=r_2_0)
states: 92
abstracting: (r_2_0<=1)
states: 92
abstracting: (p_1_2<=r_2_2)
states: 92
abstracting: (p_2_0<=1)
states: 92
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[[[~ [[1<=r_2_1 & [~ [r_2_1<=p_2_0] & ~ [p_0_1<=r_2_0]]]] & p_0_2<=p_2_1] & ~ [[1<=r_0_1 | ~ [1<=r_2_0]]]] & p_2_0<=r_1_2]] & [~ [p_0_2<=1] & ~ [[[[[[[p_1_1<=0 & 1<=r_0_0] | [p_0_0<=r_1_1 & 1<=p_1_1]] & [~ [p_1_1<=1] | [r_0_1<=r_0_1 | r_1_0<=p_1_2]]] | [r_2_0<=1 | [r_0_0<=p_2_0 | p_2_2<=p_0_1]]] & [~ [1<=p_1_2] & ~ [[~ [r_0_2<=r_0_0] | [r_2_0<=1 & 1<=p_2_2]]]]] | [r_1_2<=p_0_0 & [[~ [[r_2_1<=1 & r_2_2<=r_2_0]] & r_0_2<=1] & [~ [[1<=p_0_1 & r_1_2<=0]] & ~ [p_2_2<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[[r_0_1<=r_0_1 | r_1_0<=p_1_2] | ~ [p_1_1<=1]] & [[p_0_0<=r_1_1 & 1<=p_1_1] | [p_1_1<=0 & 1<=r_0_0]]] | [[r_0_0<=p_2_0 | p_2_2<=p_0_1] | r_2_0<=1]] & [~ [[[r_2_0<=1 & 1<=p_2_2] | ~ [r_0_2<=r_0_0]]] & ~ [1<=p_1_2]]] | [[[~ [p_2_2<=0] & ~ [[1<=p_0_1 & r_1_2<=0]]] & [~ [[r_2_1<=1 & r_2_2<=r_2_0]] & r_0_2<=1]] & r_1_2<=p_0_0]]] & ~ [p_0_2<=1]] & ~ [[[~ [[~ [1<=r_2_0] | 1<=r_0_1]] & [~ [[[~ [p_0_1<=r_2_0] & ~ [r_2_1<=p_2_0]] & 1<=r_2_1]] & p_0_2<=p_2_1]] & p_2_0<=r_1_2]]]]]]

abstracting: (p_2_0<=r_1_2)
states: 66
abstracting: (p_0_2<=p_2_1)
states: 76
abstracting: (1<=r_2_1)
states: 52
abstracting: (r_2_1<=p_2_0)
states: 64
abstracting: (p_0_1<=r_2_0)
states: 72
abstracting: (1<=r_0_1)
states: 42
abstracting: (1<=r_2_0)
states: 48
abstracting: (p_0_2<=1)
states: 92
abstracting: (r_1_2<=p_0_0)
states: 72
abstracting: (r_0_2<=1)
states: 92
abstracting: (r_2_2<=r_2_0)
states: 64
abstracting: (r_2_1<=1)
states: 92
abstracting: (r_1_2<=0)
states: 54
abstracting: (1<=p_0_1)
states: 40
abstracting: (p_2_2<=0)
states: 60
abstracting: (1<=p_1_2)
states: 22
abstracting: (r_0_2<=r_0_0)
states: 72
abstracting: (1<=p_2_2)
states: 32
abstracting: (r_2_0<=1)
states: 92
abstracting: (r_2_0<=1)
states: 92
abstracting: (p_2_2<=p_0_1)
states: 76
abstracting: (r_0_0<=p_2_0)
states: 70
abstracting: (1<=r_0_0)
states: 44
abstracting: (p_1_1<=0)
states: 82
abstracting: (1<=p_1_1)
states: 10
abstracting: (p_0_0<=r_1_1)
states: 68
abstracting: (p_1_1<=1)
states: 92
abstracting: (r_1_0<=p_1_2)
states: 58
abstracting: (r_0_1<=r_0_1)
states: 92
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[~ [[[~ [[[r_2_1<=0 | 1<=p_0_2] & [r_0_0<=1 | r_1_1<=0]]] | ~ [[r_2_0<=0 & r_0_2<=r_1_0]]] & r_0_1<=0]] & ~ [[1<=p_2_0 & [~ [1<=p_0_0] | [[[r_2_1<=0 & r_1_0<=1] | [1<=p_0_2 | r_2_1<=0]] | ~ [[r_1_1<=r_2_2 & 1<=r_2_0]]]]]]] | [r_0_2<=p_0_1 | [[~ [r_2_1<=p_1_2] & ~ [[~ [p_1_1<=p_1_2] & ~ [p_1_1<=1]]]] & ~ [[[[r_0_1<=1 | r_0_1<=1] & 1<=p_1_2] & ~ [p_0_1<=1]]]]]] & [[[[~ [[[[1<=r_1_2 | r_1_1<=p_2_1] | r_0_1<=p_2_2] | [r_2_1<=1 | [1<=r_0_2 | r_0_0<=r_2_0]]]] & 1<=p_2_1] | [~ [[~ [[1<=r_0_1 & 1<=r_2_1]] | [r_0_0<=p_2_0 & [r_0_0<=0 | p_0_0<=r_2_0]]]] | ~ [[~ [1<=p_0_0] | [r_0_0<=1 & r_1_1<=r_2_0]]]]] | ~ [[[1<=p_1_0 | [[~ [r_0_1<=r_2_1] | ~ [p_0_1<=1]] | p_2_2<=r_1_0]] & [r_0_2<=1 | ~ [p_1_2<=1]]]]] | [~ [1<=r_0_0] & [[[[[[r_0_0<=0 & r_0_0<=1] & ~ [r_0_2<=p_0_1]] & [[r_0_1<=p_2_1 & p_0_1<=0] & r_0_1<=0]] & ~ [[[p_0_1<=p_0_1 & r_0_0<=0] & [1<=r_2_1 & r_2_1<=1]]]] & r_2_1<=0] & p_1_1<=p_0_2]]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [[[1<=r_2_1 & r_2_1<=1] & [p_0_1<=p_0_1 & r_0_0<=0]]] & [[[r_0_1<=p_2_1 & p_0_1<=0] & r_0_1<=0] & [~ [r_0_2<=p_0_1] & [r_0_0<=0 & r_0_0<=1]]]] & r_2_1<=0] & p_1_1<=p_0_2] & ~ [1<=r_0_0]] | [~ [[[~ [p_1_2<=1] | r_0_2<=1] & [[[~ [p_0_1<=1] | ~ [r_0_1<=r_2_1]] | p_2_2<=r_1_0] | 1<=p_1_0]]] | [[~ [[[r_0_0<=1 & r_1_1<=r_2_0] | ~ [1<=p_0_0]]] | ~ [[[[r_0_0<=0 | p_0_0<=r_2_0] & r_0_0<=p_2_0] | ~ [[1<=r_0_1 & 1<=r_2_1]]]]] | [~ [[[[1<=r_0_2 | r_0_0<=r_2_0] | r_2_1<=1] | [[1<=r_1_2 | r_1_1<=p_2_1] | r_0_1<=p_2_2]]] & 1<=p_2_1]]]] & [[[~ [[~ [p_0_1<=1] & [[r_0_1<=1 | r_0_1<=1] & 1<=p_1_2]]] & [~ [[~ [p_1_1<=1] & ~ [p_1_1<=p_1_2]]] & ~ [r_2_1<=p_1_2]]] | r_0_2<=p_0_1] | [~ [[[~ [[[r_2_1<=0 | 1<=p_0_2] & [r_0_0<=1 | r_1_1<=0]]] | ~ [[r_2_0<=0 & r_0_2<=r_1_0]]] & r_0_1<=0]] & ~ [[[[~ [[r_1_1<=r_2_2 & 1<=r_2_0]] | [[1<=p_0_2 | r_2_1<=0] | [r_2_1<=0 & r_1_0<=1]]] | ~ [1<=p_0_0]] & 1<=p_2_0]]]]]]]]

abstracting: (1<=p_2_0)
states: 44
abstracting: (1<=p_0_0)
states: 44
abstracting: (r_1_0<=1)
states: 92
abstracting: (r_2_1<=0)
states: 40
abstracting: (r_2_1<=0)
states: 40
abstracting: (1<=p_0_2)
states: 32
abstracting: (1<=r_2_0)
states: 48
abstracting: (r_1_1<=r_2_2)
states: 76
abstracting: (r_0_1<=0)
states: 50
abstracting: (r_0_2<=r_1_0)
states: 72
abstracting: (r_2_0<=0)
states: 44
abstracting: (r_1_1<=0)
states: 50
abstracting: (r_0_0<=1)
states: 92
abstracting: (1<=p_0_2)
states: 32
abstracting: (r_2_1<=0)
states: 40
abstracting: (r_0_2<=p_0_1)
states: 70
abstracting: (r_2_1<=p_1_2)
states: 54
abstracting: (p_1_1<=p_1_2)
states: 87
abstracting: (p_1_1<=1)
states: 92
abstracting: (1<=p_1_2)
states: 22
abstracting: (r_0_1<=1)
states: 92
abstracting: (r_0_1<=1)
states: 92
abstracting: (p_0_1<=1)
states: 92
abstracting: (1<=p_2_1)
states: 40
abstracting: (r_0_1<=p_2_2)
states: 66
abstracting: (r_1_1<=p_2_1)
states: 50
abstracting: (1<=r_1_2)
states: 38
abstracting: (r_2_1<=1)
states: 92
abstracting: (r_0_0<=r_2_0)
states: 70
abstracting: (1<=r_0_2)
states: 38
abstracting: (1<=r_2_1)
states: 52
abstracting: (1<=r_0_1)
states: 42
abstracting: (r_0_0<=p_2_0)
states: 70
abstracting: (p_0_0<=r_2_0)
states: 70
abstracting: (r_0_0<=0)
states: 48
abstracting: (1<=p_0_0)
states: 44
abstracting: (r_1_1<=r_2_0)
states: 72
abstracting: (r_0_0<=1)
states: 92
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_2_2<=r_1_0)
states: 76
abstracting: (r_0_1<=r_2_1)
states: 72
abstracting: (p_0_1<=1)
states: 92
abstracting: (r_0_2<=1)
states: 92
abstracting: (p_1_2<=1)
states: 92
abstracting: (1<=r_0_0)
states: 44
abstracting: (p_1_1<=p_0_2)
states: 82
abstracting: (r_2_1<=0)
states: 40
abstracting: (r_0_0<=1)
states: 92
abstracting: (r_0_0<=0)
states: 48
abstracting: (r_0_2<=p_0_1)
states: 70
abstracting: (r_0_1<=0)
states: 50
abstracting: (p_0_1<=0)
states: 52
abstracting: (r_0_1<=p_2_1)
states: 70
abstracting: (r_0_0<=0)
states: 48
abstracting: (p_0_1<=p_0_1)
states: 92
abstracting: (r_2_1<=1)
states: 92
abstracting: (1<=r_2_1)
states: 52
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[r_0_2<=p_0_0 & ~ [[[[[[~ [1<=r_2_2] & [r_0_0<=1 & r_0_0<=r_1_2]] & ~ [1<=r_0_2]] & [p_2_1<=1 & ~ [1<=p_1_1]]] | [[[[1<=p_0_0 | r_0_2<=0] & [r_2_0<=0 | 1<=r_2_2]] | [[1<=r_0_2 & r_1_0<=p_0_2] & [r_1_0<=p_2_1 & p_1_1<=1]]] & ~ [[[r_0_1<=0 | 1<=r_1_2] & ~ [p_2_2<=r_0_1]]]]] | [[~ [[p_1_2<=p_2_1 & [r_0_0<=1 & p_1_0<=0]]] | [[p_0_1<=r_1_0 & r_2_0<=p_0_2] & [r_0_1<=p_1_1 & [1<=r_2_0 | p_1_2<=r_2_0]]]] & [[r_0_0<=p_1_2 & [r_0_2<=r_0_0 & 1<=p_0_1]] & p_0_1<=1]]]]] & [[[1<=r_2_0 | ~ [1<=p_1_0]] | [~ [[[[[p_2_1<=1 & 1<=r_1_0] & [r_2_1<=r_0_1 | 1<=p_0_0]] & r_0_0<=p_1_1] | [[[r_1_1<=0 | r_0_2<=0] & [p_1_0<=r_2_0 & 1<=p_2_1]] | [1<=r_1_1 | p_2_2<=0]]]] & [p_2_2<=0 | ~ [p_0_2<=r_1_1]]]] | [[[[~ [[r_1_0<=0 & 1<=p_2_0]] & [[p_2_2<=r_1_2 & [1<=r_2_0 & p_1_0<=1]] & r_1_2<=p_2_2]] | ~ [[[r_0_0<=0 | [1<=r_0_2 | p_0_2<=r_0_0]] & [~ [p_2_1<=0] | p_2_1<=p_0_2]]]] & [~ [[~ [r_2_2<=r_1_2] & ~ [[r_1_1<=r_1_1 | 1<=r_1_1]]]] & ~ [[p_1_0<=p_2_0 | p_1_1<=r_2_0]]]] | [~ [1<=p_1_0] & ~ [1<=p_2_1]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[[r_1_0<=p_2_1 & p_1_1<=1] & [1<=r_0_2 & r_1_0<=p_0_2]] | [[r_2_0<=0 | 1<=r_2_2] & [1<=p_0_0 | r_0_2<=0]]] & ~ [[~ [p_2_2<=r_0_1] & [r_0_1<=0 | 1<=r_1_2]]]] | [[~ [1<=p_1_1] & p_2_1<=1] & [~ [1<=r_0_2] & [[r_0_0<=1 & r_0_0<=r_1_2] & ~ [1<=r_2_2]]]]] | [[[[r_0_2<=r_0_0 & 1<=p_0_1] & r_0_0<=p_1_2] & p_0_1<=1] & [[[[1<=r_2_0 | p_1_2<=r_2_0] & r_0_1<=p_1_1] & [p_0_1<=r_1_0 & r_2_0<=p_0_2]] | ~ [[[r_0_0<=1 & p_1_0<=0] & p_1_2<=p_2_1]]]]]] & r_0_2<=p_0_0] & [[[[[[[[1<=r_2_0 & p_1_0<=1] & p_2_2<=r_1_2] & r_1_2<=p_2_2] & ~ [[r_1_0<=0 & 1<=p_2_0]]] | ~ [[[~ [p_2_1<=0] | p_2_1<=p_0_2] & [[1<=r_0_2 | p_0_2<=r_0_0] | r_0_0<=0]]]] & [~ [[p_1_0<=p_2_0 | p_1_1<=r_2_0]] & ~ [[~ [[r_1_1<=r_1_1 | 1<=r_1_1]] & ~ [r_2_2<=r_1_2]]]]] | [~ [1<=p_2_1] & ~ [1<=p_1_0]]] | [[[~ [p_0_2<=r_1_1] | p_2_2<=0] & ~ [[[[1<=r_1_1 | p_2_2<=0] | [[p_1_0<=r_2_0 & 1<=p_2_1] & [r_1_1<=0 | r_0_2<=0]]] | [[[r_2_1<=r_0_1 | 1<=p_0_0] & [p_2_1<=1 & 1<=r_1_0]] & r_0_0<=p_1_1]]]] | [~ [1<=p_1_0] | 1<=r_2_0]]]]]]]

abstracting: (1<=r_2_0)
states: 48
abstracting: (1<=p_1_0)
states: 4
abstracting: (r_0_0<=p_1_1)
states: 52
abstracting: (1<=r_1_0)
states: 44
abstracting: (p_2_1<=1)
states: 92
abstracting: (1<=p_0_0)
states: 44
abstracting: (r_2_1<=r_0_1)
states: 62
abstracting: (r_0_2<=0)
states: 54
abstracting: (r_1_1<=0)
states: 50
abstracting: (1<=p_2_1)
states: 40
abstracting: (p_1_0<=r_2_0)
states: 92
abstracting: (p_2_2<=0)
states: 60
abstracting: (1<=r_1_1)
states: 42
abstracting: (p_2_2<=0)
states: 60
abstracting: (p_0_2<=r_1_1)
states: 76
abstracting: (1<=p_1_0)
states: 4
abstracting: (1<=p_2_1)
states: 40
abstracting: (r_2_2<=r_1_2)
states: 70
abstracting: (1<=r_1_1)
states: 42
abstracting: (r_1_1<=r_1_1)
states: 92
abstracting: (p_1_1<=r_2_0)
states: 88
abstracting: (p_1_0<=p_2_0)
states: 88
abstracting: (r_0_0<=0)
states: 48
abstracting: (p_0_2<=r_0_0)
states: 76
abstracting: (1<=r_0_2)
states: 38
abstracting: (p_2_1<=p_0_2)
states: 68
abstracting: (p_2_1<=0)
states: 52
abstracting: (1<=p_2_0)
states: 44
abstracting: (r_1_0<=0)
states: 48
abstracting: (r_1_2<=p_2_2)
states: 54
abstracting: (p_2_2<=r_1_2)
states: 60
abstracting: (p_1_0<=1)
states: 92
abstracting: (1<=r_2_0)
states: 48
abstracting: (r_0_2<=p_0_0)
states: 72
abstracting: (p_1_2<=p_2_1)
states: 78
abstracting: (p_1_0<=0)
states: 88
abstracting: (r_0_0<=1)
states: 92
abstracting: (r_2_0<=p_0_2)
states: 60
abstracting: (p_0_1<=r_1_0)
states: 72
abstracting: (r_0_1<=p_1_1)
states: 50
abstracting: (p_1_2<=r_2_0)
states: 82
abstracting: (1<=r_2_0)
states: 48
abstracting: (p_0_1<=1)
states: 92
abstracting: (r_0_0<=p_1_2)
states: 58
abstracting: (1<=p_0_1)
states: 40
abstracting: (r_0_2<=r_0_0)
states: 72
abstracting: (1<=r_2_2)
states: 60
abstracting: (r_0_0<=r_1_2)
states: 66
abstracting: (r_0_0<=1)
states: 92
abstracting: (1<=r_0_2)
states: 38
abstracting: (p_2_1<=1)
states: 92
abstracting: (1<=p_1_1)
states: 10
abstracting: (1<=r_1_2)
states: 38
abstracting: (r_0_1<=0)
states: 50
abstracting: (p_2_2<=r_0_1)
states: 76
abstracting: (r_0_2<=0)
states: 54
abstracting: (1<=p_0_0)
states: 44
abstracting: (1<=r_2_2)
states: 60
abstracting: (r_2_0<=0)
states: 44
abstracting: (r_1_0<=p_0_2)
states: 64
abstracting: (1<=r_0_2)
states: 38
abstracting: (p_1_1<=1)
states: 92
abstracting: (r_1_0<=p_2_1)
states: 68
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 3134 (3.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1449 4593 6042
used/not used/entry size/cache size: 5755 67103109 16 1024MB
basic ops cache: hits/miss/sum: 1889 6748 8637
used/not used/entry size/cache size: 12388 16764828 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: 458 761 1219
used/not used/entry size/cache size: 761 8387847 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 67105757
1 3080
2 27
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.632sec


BK_STOP 1679180706301

--------------------
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
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:89 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


iterations count:38 (3), effective:8 (0)

iterations count:40 (3), effective:5 (0)

iterations count:27 (2), effective:4 (0)

iterations count:36 (3), effective:5 (0)

iterations count:19 (1), effective:2 (0)

iterations count:43 (3), effective:7 (0)

iterations count:16 (1), effective:1 (0)

iterations count:39 (3), effective:7 (0)

iterations count:13 (1), effective:1 (0)

iterations count:15 (1), effective:2 (0)

iterations count:42 (3), effective:6 (0)

iterations count:40 (3), effective:10 (0)

iterations count:12 (1), effective:0 (0)

iterations count:12 (1), effective:0 (0)

iterations count:37 (3), effective:9 (0)

iterations count:18 (1), effective:3 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C003"
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 ResAllocation-PT-R003C003, 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 r330-tall-167889203600678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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