fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889203600734
Last Updated
May 14, 2023

About the Execution of Marcie+red for ResAllocation-PT-R005C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.663 7314.00 8860.00 282.40 TFTTTTFTTFTTTFFT 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.r330-tall-167889203600734.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-R005C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:25 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 4.1K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 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 22K 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-R005C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R005C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679181582970

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-R005C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:19:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:19:44] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-18 23:19:44] [INFO ] Transformed 20 places.
[2023-03-18 23:19:44] [INFO ] Transformed 12 transitions.
[2023-03-18 23:19:44] [INFO ] Parsed PT model containing 20 places and 12 transitions and 50 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 885 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :6
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 344 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 20 cols
[2023-03-18 23:19:44] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-18 23:19:44] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:19:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-18 23:19:45] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 663 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_R005C002
(NrP: 20 NrTr: 12 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.743sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 61 (6.1e+01) #states 112



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

checking: EF [p_1_4<=0]
normalized: E [true U p_1_4<=0]

abstracting: (p_1_4<=0)
states: 64
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [r_1_3<=0]
normalized: E [true U r_1_3<=0]

abstracting: (r_1_3<=0)
states: 40
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p_1_4<=1)
states: 112
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p_1_2)
states: 32
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [r_0_4<=0]]
normalized: E [true U ~ [r_0_4<=0]]

abstracting: (r_0_4<=0)
states: 64
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [r_0_3<=0]
normalized: E [true U r_0_3<=0]

abstracting: (r_0_3<=0)
states: 64
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [1<=r_0_3] & r_1_4<=1]]
normalized: E [true U [~ [1<=r_0_3] & r_1_4<=1]]

abstracting: (r_1_4<=1)
states: 112
abstracting: (1<=r_0_3)
states: 48
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (r_0_1<=p_1_4)
states: 84
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (r_0_1<=p_0_1)
states: 64
abstracting: (1<=p_0_3)
states: 24
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[~ [[[[~ [1<=r_1_1] | p_1_1<=0] | r_1_2<=p_0_0] & ~ [[~ [r_1_0<=0] & [~ [1<=r_1_1] & 1<=p_1_1]]]]] & [[~ [[[1<=r_0_1 & 1<=r_1_1] & r_0_0<=0]] & 1<=p_1_0] & ~ [[[~ [[[1<=p_1_1 & r_1_2<=1] | ~ [1<=r_1_2]]] | [[~ [1<=p_1_1] | [p_0_2<=0 & p_1_1<=1]] & [~ [r_0_1<=1] | ~ [r_0_3<=p_1_4]]]] | ~ [[[~ [1<=r_1_3] | [1<=r_1_4 | p_1_4<=p_1_0]] & 1<=r_0_3]]]]]] | 1<=r_1_3]]
normalized: E [true U [[~ [[~ [[[~ [1<=r_1_1] & 1<=p_1_1] & ~ [r_1_0<=0]]] & [[~ [1<=r_1_1] | p_1_1<=0] | r_1_2<=p_0_0]]] & [[~ [[[1<=r_0_1 & 1<=r_1_1] & r_0_0<=0]] & 1<=p_1_0] & ~ [[[[[~ [r_0_3<=p_1_4] | ~ [r_0_1<=1]] & [[p_0_2<=0 & p_1_1<=1] | ~ [1<=p_1_1]]] | ~ [[~ [1<=r_1_2] | [1<=p_1_1 & r_1_2<=1]]]] | ~ [[[[1<=r_1_4 | p_1_4<=p_1_0] | ~ [1<=r_1_3]] & 1<=r_0_3]]]]]] | 1<=r_1_3]]

abstracting: (1<=r_1_3)
states: 72
abstracting: (1<=r_0_3)
states: 48
abstracting: (1<=r_1_3)
states: 72
abstracting: (p_1_4<=p_1_0)
states: 72
abstracting: (1<=r_1_4)
states: 64
abstracting: (r_1_2<=1)
states: 112
abstracting: (1<=p_1_1)
states: 24
abstracting: (1<=r_1_2)
states: 80
abstracting: (1<=p_1_1)
states: 24
abstracting: (p_1_1<=1)
states: 112
abstracting: (p_0_2<=0)
states: 80
abstracting: (r_0_1<=1)
states: 112
abstracting: (r_0_3<=p_1_4)
states: 84
abstracting: (1<=p_1_0)
states: 16
abstracting: (r_0_0<=0)
states: 64
abstracting: (1<=r_1_1)
states: 88
abstracting: (1<=r_0_1)
states: 48
abstracting: (r_1_2<=p_0_0)
states: 68
abstracting: (p_1_1<=0)
states: 88
abstracting: (1<=r_1_1)
states: 88
abstracting: (r_1_0<=0)
states: 16
abstracting: (1<=p_1_1)
states: 24
abstracting: (1<=r_1_1)
states: 88
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[[r_0_0<=r_0_0 & [~ [[[p_1_2<=r_1_1 & p_1_1<=r_0_0] & [[~ [[1<=r_1_2 & p_0_0<=r_0_4]] & [~ [r_0_3<=r_1_3] | ~ [p_0_4<=1]]] | r_0_2<=0]]] & [[[p_0_1<=1 & [~ [r_1_1<=1] & [[r_0_4<=r_1_3 & 1<=r_1_0] & [r_1_4<=0 & 1<=r_0_2]]]] | [[~ [r_0_4<=r_0_3] | [[p_0_1<=0 | p_0_2<=1] | r_1_0<=1]] | 1<=p_0_4]] & ~ [p_1_4<=0]]]] & ~ [1<=p_1_1]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[~ [p_0_4<=1] | ~ [r_0_3<=r_1_3]] & ~ [[1<=r_1_2 & p_0_0<=r_0_4]]] | r_0_2<=0] & [p_1_2<=r_1_1 & p_1_1<=r_0_0]]] & [[[[[[r_1_4<=0 & 1<=r_0_2] & [r_0_4<=r_1_3 & 1<=r_1_0]] & ~ [r_1_1<=1]] & p_0_1<=1] | [[[[p_0_1<=0 | p_0_2<=1] | r_1_0<=1] | ~ [r_0_4<=r_0_3]] | 1<=p_0_4]] & ~ [p_1_4<=0]]] & r_0_0<=r_0_0] & ~ [1<=p_1_1]]]]]

abstracting: (1<=p_1_1)
states: 24
abstracting: (r_0_0<=r_0_0)
states: 112
abstracting: (p_1_4<=0)
states: 64
abstracting: (1<=p_0_4)
states: 16
abstracting: (r_0_4<=r_0_3)
states: 84
abstracting: (r_1_0<=1)
states: 112
abstracting: (p_0_2<=1)
states: 112
abstracting: (p_0_1<=0)
states: 72
abstracting: (p_0_1<=1)
states: 112
abstracting: (r_1_1<=1)
states: 112
abstracting: (1<=r_1_0)
states: 96
abstracting: (r_0_4<=r_1_3)
states: 92
abstracting: (1<=r_0_2)
states: 48
abstracting: (r_1_4<=0)
states: 48
abstracting: (p_1_1<=r_0_0)
states: 96
abstracting: (p_1_2<=r_1_1)
states: 100
abstracting: (r_0_2<=0)
states: 64
abstracting: (p_0_0<=r_0_4)
states: 84
abstracting: (1<=r_1_2)
states: 80
abstracting: (r_0_3<=r_1_3)
states: 112
abstracting: (p_0_4<=1)
states: 112
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[p_0_2<=r_0_4 | [[[[p_0_0<=r_1_4 | [~ [r_0_3<=p_1_4] | ~ [[p_1_2<=p_0_4 & ~ [p_1_3<=p_1_2]]]]] & [p_0_2<=1 & p_1_2<=1]] & ~ [[[[[p_0_0<=p_1_2 | [r_1_1<=p_0_3 & 1<=r_1_4]] & ~ [[r_1_2<=p_1_0 | r_1_3<=0]]] & [[~ [p_1_2<=0] & r_1_3<=p_1_3] | [p_1_3<=p_0_3 & ~ [p_1_1<=0]]]] | [p_1_4<=0 | p_0_1<=1]]]] | [[~ [[~ [p_0_3<=1] | ~ [[r_0_2<=1 | 1<=p_1_2]]]] | ~ [1<=r_1_3]] & p_0_4<=1]]]]
normalized: ~ [E [true U ~ [[[[[~ [1<=r_1_3] | ~ [[~ [[r_0_2<=1 | 1<=p_1_2]] | ~ [p_0_3<=1]]]] & p_0_4<=1] | [~ [[[[[[r_1_1<=p_0_3 & 1<=r_1_4] | p_0_0<=p_1_2] & ~ [[r_1_2<=p_1_0 | r_1_3<=0]]] & [[~ [p_1_1<=0] & p_1_3<=p_0_3] | [~ [p_1_2<=0] & r_1_3<=p_1_3]]] | [p_1_4<=0 | p_0_1<=1]]] & [[p_0_2<=1 & p_1_2<=1] & [[~ [[~ [p_1_3<=p_1_2] & p_1_2<=p_0_4]] | ~ [r_0_3<=p_1_4]] | p_0_0<=r_1_4]]]] | p_0_2<=r_0_4]]]]

abstracting: (p_0_2<=r_0_4)
states: 92
abstracting: (p_0_0<=r_1_4)
states: 92
abstracting: (r_0_3<=p_1_4)
states: 84
abstracting: (p_1_2<=p_0_4)
states: 80
abstracting: (p_1_3<=p_1_2)
states: 88
abstracting: (p_1_2<=1)
states: 112
abstracting: (p_0_2<=1)
states: 112
abstracting: (p_0_1<=1)
states: 112
abstracting: (p_1_4<=0)
states: 64
abstracting: (r_1_3<=p_1_3)
states: 40
abstracting: (p_1_2<=0)
states: 80
abstracting: (p_1_3<=p_0_3)
states: 72
abstracting: (p_1_1<=0)
states: 88
abstracting: (r_1_3<=0)
states: 40
abstracting: (r_1_2<=p_1_0)
states: 40
abstracting: (p_0_0<=p_1_2)
states: 76
abstracting: (1<=r_1_4)
states: 64
abstracting: (r_1_1<=p_0_3)
states: 48
abstracting: (p_0_4<=1)
states: 112
abstracting: (p_0_3<=1)
states: 112
abstracting: (1<=p_1_2)
states: 32
abstracting: (r_0_2<=1)
states: 112
abstracting: (1<=r_1_3)
states: 72
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[p_1_2<=p_0_2 & [~ [p_0_1<=0] | ~ [[~ [[r_0_0<=p_0_2 & r_0_4<=p_1_1]] | p_0_2<=r_0_2]]]]] | [[~ [[[p_0_2<=0 | [[p_0_1<=r_1_3 & p_0_3<=p_1_3] & ~ [p_1_3<=p_1_3]]] | r_1_2<=r_1_0]] & [[[[~ [1<=r_0_4] & p_1_4<=0] | [~ [r_1_4<=0] | 1<=r_1_2]] | ~ [[r_1_2<=1 & 1<=p_0_1]]] | p_0_4<=r_0_4]] & [~ [[1<=r_1_2 & [[p_0_1<=r_1_0 | p_0_2<=1] & ~ [[p_1_2<=r_1_2 | ~ [p_0_4<=0]]]]]] & p_1_3<=p_0_3]]]]
normalized: E [true U [[[~ [[[[~ [p_1_3<=p_1_3] & [p_0_1<=r_1_3 & p_0_3<=p_1_3]] | p_0_2<=0] | r_1_2<=r_1_0]] & [[~ [[r_1_2<=1 & 1<=p_0_1]] | [[~ [r_1_4<=0] | 1<=r_1_2] | [~ [1<=r_0_4] & p_1_4<=0]]] | p_0_4<=r_0_4]] & [~ [[[~ [[~ [p_0_4<=0] | p_1_2<=r_1_2]] & [p_0_1<=r_1_0 | p_0_2<=1]] & 1<=r_1_2]] & p_1_3<=p_0_3]] | ~ [[[~ [[~ [[r_0_0<=p_0_2 & r_0_4<=p_1_1]] | p_0_2<=r_0_2]] | ~ [p_0_1<=0]] & p_1_2<=p_0_2]]]]

abstracting: (p_1_2<=p_0_2)
states: 80
abstracting: (p_0_1<=0)
states: 72
abstracting: (p_0_2<=r_0_2)
states: 80
abstracting: (r_0_4<=p_1_1)
states: 76
abstracting: (r_0_0<=p_0_2)
states: 80
abstracting: (p_1_3<=p_0_3)
states: 72
abstracting: (1<=r_1_2)
states: 80
abstracting: (p_0_2<=1)
states: 112
abstracting: (p_0_1<=r_1_0)
states: 112
abstracting: (p_1_2<=r_1_2)
states: 80
abstracting: (p_0_4<=0)
states: 96
abstracting: (p_0_4<=r_0_4)
states: 96
abstracting: (p_1_4<=0)
states: 64
abstracting: (1<=r_0_4)
states: 48
abstracting: (1<=r_1_2)
states: 80
abstracting: (r_1_4<=0)
states: 48
abstracting: (1<=p_0_1)
states: 40
abstracting: (r_1_2<=1)
states: 112
abstracting: (r_1_2<=r_1_0)
states: 104
abstracting: (p_0_2<=0)
states: 80
abstracting: (p_0_3<=p_1_3)
states: 88
abstracting: (p_0_1<=r_1_3)
states: 100
abstracting: (p_1_3<=p_1_3)
states: 112
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [r_0_0<=r_1_2] | ~ [[r_1_4<=0 & [[~ [[p_0_3<=1 & 1<=p_0_2]] | [r_0_3<=0 | r_1_0<=1]] & ~ [[1<=p_1_1 | [r_0_4<=r_1_0 & r_0_2<=r_1_0]]]]]]] & [r_0_4<=r_1_3 & [1<=p_0_2 & [[[[p_1_3<=0 & r_0_4<=0] & ~ [[[p_0_3<=0 & r_1_3<=r_0_4] & 1<=p_1_0]]] | [[p_0_1<=p_1_0 & p_0_4<=1] & ~ [[r_0_1<=r_0_1 | 1<=p_1_3]]]] | [[1<=r_1_3 | [r_0_3<=p_1_3 & r_0_1<=r_1_2]] | [1<=p_1_1 | ~ [[p_0_4<=0 & r_0_2<=p_1_0]]]]]]]]]
normalized: E [true U [[~ [[[~ [[[r_0_4<=r_1_0 & r_0_2<=r_1_0] | 1<=p_1_1]] & [[r_0_3<=0 | r_1_0<=1] | ~ [[p_0_3<=1 & 1<=p_0_2]]]] & r_1_4<=0]] | ~ [r_0_0<=r_1_2]] & [[[[[~ [[p_0_4<=0 & r_0_2<=p_1_0]] | 1<=p_1_1] | [[r_0_3<=p_1_3 & r_0_1<=r_1_2] | 1<=r_1_3]] | [[~ [[r_0_1<=r_0_1 | 1<=p_1_3]] & [p_0_1<=p_1_0 & p_0_4<=1]] | [~ [[[p_0_3<=0 & r_1_3<=r_0_4] & 1<=p_1_0]] & [p_1_3<=0 & r_0_4<=0]]]] & 1<=p_0_2] & r_0_4<=r_1_3]]]

abstracting: (r_0_4<=r_1_3)
states: 92
abstracting: (1<=p_0_2)
states: 32
abstracting: (r_0_4<=0)
states: 64
abstracting: (p_1_3<=0)
states: 72
abstracting: (1<=p_1_0)
states: 16
abstracting: (r_1_3<=r_0_4)
states: 68
abstracting: (p_0_3<=0)
states: 88
abstracting: (p_0_4<=1)
states: 112
abstracting: (p_0_1<=p_1_0)
states: 72
abstracting: (1<=p_1_3)
states: 40
abstracting: (r_0_1<=r_0_1)
states: 112
abstracting: (1<=r_1_3)
states: 72
abstracting: (r_0_1<=r_1_2)
states: 100
abstracting: (r_0_3<=p_1_3)
states: 64
abstracting: (1<=p_1_1)
states: 24
abstracting: (r_0_2<=p_1_0)
states: 72
abstracting: (p_0_4<=0)
states: 96
abstracting: (r_0_0<=r_1_2)
states: 100
abstracting: (r_1_4<=0)
states: 48
abstracting: (1<=p_0_2)
states: 32
abstracting: (p_0_3<=1)
states: 112
abstracting: (r_1_0<=1)
states: 112
abstracting: (r_0_3<=0)
states: 64
abstracting: (1<=p_1_1)
states: 24
abstracting: (r_0_2<=r_1_0)
states: 104
abstracting: (r_0_4<=r_1_0)
states: 104
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [[[~ [[[[1<=r_1_4 & 1<=p_0_4] & [1<=r_0_4 | r_0_0<=p_1_3]] & [[r_1_0<=1 & 1<=r_1_4] & [1<=p_0_1 & r_1_2<=1]]]] & [[r_1_2<=0 & ~ [[r_1_1<=r_0_0 & r_0_1<=p_0_4]]] | p_0_2<=r_0_3]] & [~ [[~ [[p_0_4<=1 | 1<=r_1_4]] | ~ [[p_1_4<=p_0_2 & p_1_0<=0]]]] | [~ [[[r_1_0<=r_1_3 & r_0_3<=p_1_0] | [1<=p_1_4 | r_0_1<=p_0_2]]] | ~ [p_0_1<=0]]]]] & [~ [[r_1_3<=r_0_3 & ~ [1<=p_0_4]]] & ~ [[~ [p_1_4<=p_1_2] | r_1_1<=r_0_0]]]] & p_0_0<=1]]
normalized: ~ [E [true U ~ [[[[~ [[~ [p_1_4<=p_1_2] | r_1_1<=r_0_0]] & ~ [[~ [1<=p_0_4] & r_1_3<=r_0_3]]] & ~ [[[~ [[[[1<=r_0_4 | r_0_0<=p_1_3] & [1<=r_1_4 & 1<=p_0_4]] & [[1<=p_0_1 & r_1_2<=1] & [r_1_0<=1 & 1<=r_1_4]]]] & [[~ [[r_1_1<=r_0_0 & r_0_1<=p_0_4]] & r_1_2<=0] | p_0_2<=r_0_3]] & [[~ [p_0_1<=0] | ~ [[[1<=p_1_4 | r_0_1<=p_0_2] | [r_1_0<=r_1_3 & r_0_3<=p_1_0]]]] | ~ [[~ [[p_1_4<=p_0_2 & p_1_0<=0]] | ~ [[p_0_4<=1 | 1<=r_1_4]]]]]]]] & p_0_0<=1]]]]

abstracting: (p_0_0<=1)
states: 112
abstracting: (1<=r_1_4)
states: 64
abstracting: (p_0_4<=1)
states: 112
abstracting: (p_1_0<=0)
states: 96
abstracting: (p_1_4<=p_0_2)
states: 76
abstracting: (r_0_3<=p_1_0)
states: 72
abstracting: (r_1_0<=r_1_3)
states: 80
abstracting: (r_0_1<=p_0_2)
states: 80
abstracting: (1<=p_1_4)
states: 48
abstracting: (p_0_1<=0)
states: 72
abstracting: (p_0_2<=r_0_3)
states: 92
abstracting: (r_1_2<=0)
states: 32
abstracting: (r_0_1<=p_0_4)
states: 72
abstracting: (r_1_1<=r_0_0)
states: 64
abstracting: (1<=r_1_4)
states: 64
abstracting: (r_1_0<=1)
states: 112
abstracting: (r_1_2<=1)
states: 112
abstracting: (1<=p_0_1)
states: 40
abstracting: (1<=p_0_4)
states: 16
abstracting: (1<=r_1_4)
states: 64
abstracting: (r_0_0<=p_1_3)
states: 80
abstracting: (1<=r_0_4)
states: 48
abstracting: (r_1_3<=r_0_3)
states: 88
abstracting: (1<=p_0_4)
states: 16
abstracting: (r_1_1<=r_0_0)
states: 64
abstracting: (p_1_4<=p_1_2)
states: 80
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[[[p_0_2<=p_1_1 & [[[[[p_1_1<=r_0_0 | 1<=r_1_2] | p_0_0<=1] & 1<=p_0_0] | ~ [[[1<=p_1_0 & p_1_2<=p_1_4] | r_0_3<=r_0_3]]] & [[~ [1<=r_0_1] | [~ [p_0_4<=0] & [p_0_4<=p_0_0 & 1<=r_1_3]]] | 1<=r_0_1]]] & ~ [[[[1<=p_1_2 & [~ [r_1_4<=p_1_4] & [r_1_1<=p_1_0 | 1<=p_0_3]]] & ~ [[1<=p_0_1 | [r_1_1<=r_1_2 | 1<=r_1_3]]]] & [~ [p_1_2<=0] | ~ [[[p_1_0<=p_0_3 | r_0_3<=p_0_1] & [1<=p_1_2 & r_1_4<=r_1_1]]]]]]] & [r_1_2<=0 & r_1_3<=r_1_3]]]]
normalized: ~ [E [true U [[r_1_2<=0 & r_1_3<=r_1_3] & [~ [[[~ [[[1<=p_1_2 & r_1_4<=r_1_1] & [p_1_0<=p_0_3 | r_0_3<=p_0_1]]] | ~ [p_1_2<=0]] & [~ [[[r_1_1<=r_1_2 | 1<=r_1_3] | 1<=p_0_1]] & [[[r_1_1<=p_1_0 | 1<=p_0_3] & ~ [r_1_4<=p_1_4]] & 1<=p_1_2]]]] & [p_0_2<=p_1_1 & [[[[[p_0_4<=p_0_0 & 1<=r_1_3] & ~ [p_0_4<=0]] | ~ [1<=r_0_1]] | 1<=r_0_1] & [~ [[[1<=p_1_0 & p_1_2<=p_1_4] | r_0_3<=r_0_3]] | [1<=p_0_0 & [p_0_0<=1 | [p_1_1<=r_0_0 | 1<=r_1_2]]]]]]]]]]

abstracting: (1<=r_1_2)
states: 80
abstracting: (p_1_1<=r_0_0)
states: 96
abstracting: (p_0_0<=1)
states: 112
abstracting: (1<=p_0_0)
states: 48
abstracting: (r_0_3<=r_0_3)
states: 112
abstracting: (p_1_2<=p_1_4)
states: 96
abstracting: (1<=p_1_0)
states: 16
abstracting: (1<=r_0_1)
states: 48
abstracting: (1<=r_0_1)
states: 48
abstracting: (p_0_4<=0)
states: 96
abstracting: (1<=r_1_3)
states: 72
abstracting: (p_0_4<=p_0_0)
states: 104
abstracting: (p_0_2<=p_1_1)
states: 80
abstracting: (1<=p_1_2)
states: 32
abstracting: (r_1_4<=p_1_4)
states: 48
abstracting: (1<=p_0_3)
states: 24
abstracting: (r_1_1<=p_1_0)
states: 32
abstracting: (1<=p_0_1)
states: 40
abstracting: (1<=r_1_3)
states: 72
abstracting: (r_1_1<=r_1_2)
states: 92
abstracting: (p_1_2<=0)
states: 80
abstracting: (r_0_3<=p_0_1)
states: 80
abstracting: (p_1_0<=p_0_3)
states: 96
abstracting: (r_1_4<=r_1_1)
states: 100
abstracting: (1<=p_1_2)
states: 32
abstracting: (r_1_3<=r_1_3)
states: 112
abstracting: (r_1_2<=0)
states: 32
-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 3491 (3.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1662 5283 6945
used/not used/entry size/cache size: 6708 67102156 16 1024MB
basic ops cache: hits/miss/sum: 2286 7766 10052
used/not used/entry size/cache size: 14396 16762820 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: 477 817 1294
used/not used/entry size/cache size: 817 8387791 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 67105405
1 3427
2 32
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.321sec


BK_STOP 1679181590284

--------------------
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:129 (10), effective:30 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:23 (1), effective:5 (0)

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

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

iterations count:28 (2), effective:6 (0)

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

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

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

iterations count:32 (2), effective:8 (0)

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

iterations count:32 (2), effective:5 (0)

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

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

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

iterations count:41 (3), effective:11 (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-R005C002"
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-R005C002, 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-167889203600734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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