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.r074-smll-167814399900158.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 CircularTrains-PT-024, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 19K 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 CircularTrains-PT-024-ReachabilityCardinality-00
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-01
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-02
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-03
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-04
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-05
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-06
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-07
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-08
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-09
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-10
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-11
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-12
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-13
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-14
FORMULA_NAME CircularTrains-PT-024-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678305989261

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=CircularTrains-PT-024
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:06:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 20:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:06:33] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-08 20:06:33] [INFO ] Transformed 48 places.
[2023-03-08 20:06:33] [INFO ] Transformed 24 transitions.
[2023-03-08 20:06:33] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-024-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 14) seen :9
FORMULA CircularTrains-PT-024-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-024-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 24 rows 48 cols
[2023-03-08 20:06:34] [INFO ] Computed 25 place invariants in 12 ms
[2023-03-08 20:06:34] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-08 20:06:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-08 20:06:35] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 14 ms returned sat
[2023-03-08 20:06:35] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA CircularTrains-PT-024-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircularTrains-PT-024-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircularTrains-PT-024-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircularTrains-PT-024-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircularTrains-PT-024-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 2246 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: CircularTrains_PT_024
(NrP: 48 NrTr: 24 NrArc: 96)

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

net check time: 0m 0.000sec

init dd package: 0m 4.051sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)



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

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

abstracting: (F22<=1)
states: 86,515 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (Section_8<=1)
states: 86,515 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (Section_11<=0)
states: 52,499 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [Section_9<=Section_23]
normalized: E [true U Section_9<=Section_23]

abstracting: (Section_9<=Section_23)
states: 64,774 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [F12<=Section_18]
normalized: ~ [E [true U ~ [F12<=Section_18]]]

abstracting: (F12<=Section_18)
states: 66,993 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [Section_16<=Section_24]
normalized: E [true U Section_16<=Section_24]

abstracting: (Section_16<=Section_24)
states: 75,279 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [F10<=0] | Section_3<=Section_12]]
normalized: ~ [E [true U ~ [[~ [F10<=0] | Section_3<=Section_12]]]]

abstracting: (Section_3<=Section_12)
states: 64,774 (4)
abstracting: (F10<=0)
states: 52,499 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[F5<=0 & ~ [F22<=1]] & Section_2<=F18]]
normalized: E [true U [[~ [F22<=1] & F5<=0] & Section_2<=F18]]

abstracting: (Section_2<=F18)
states: 66,993 (4)
abstracting: (F5<=0)
states: 12,275 (4)
abstracting: (F22<=1)
states: 86,515 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[[[~ [[~ [F22<=1] & [F4<=F22 | [1<=Section_11 & Section_19<=0]]]] & Section_4<=F15] & [~ [Section_16<=1] & F22<=0]] & ~ [[F7<=F1 | [[[~ [Section_5<=F11] | [F20<=F21 | 1<=F7]] | Section_23<=1] | F1<=1]]]] & [Section_13<=Section_19 | ~ [1<=Section_18]]]]]
normalized: ~ [E [true U [[[[Section_4<=F15 & ~ [[[F4<=F22 | [1<=Section_11 & Section_19<=0]] & ~ [F22<=1]]]] & [F22<=0 & ~ [Section_16<=1]]] & ~ [[[[[[F20<=F21 | 1<=F7] | ~ [Section_5<=F11]] | Section_23<=1] | F1<=1] | F7<=F1]]] & [~ [1<=Section_18] | Section_13<=Section_19]]]]

abstracting: (Section_13<=Section_19)
states: 72,021 (4)
abstracting: (1<=Section_18)
states: 34,016 (4)
abstracting: (F7<=F1)
states: 64,774 (4)
abstracting: (F1<=1)
states: 86,515 (4)
abstracting: (Section_23<=1)
states: 86,515 (4)
abstracting: (Section_5<=F11)
states: 82,502 (4)
abstracting: (1<=F7)
states: 34,016 (4)
abstracting: (F20<=F21)
states: 26,769 (4)
abstracting: (Section_16<=1)
states: 86,515 (4)
abstracting: (F22<=0)
states: 52,499 (4)
abstracting: (F22<=1)
states: 86,515 (4)
abstracting: (Section_19<=0)
states: 68,032 (4)
abstracting: (1<=Section_11)
states: 34,016 (4)
abstracting: (F4<=F22)
states: 64,774 (4)
abstracting: (Section_4<=F15)
states: 75,279 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[~ [F6<=Section_12] | ~ [1<=F13]] & [~ [[[Section_10<=0 & F17<=1] & ~ [1<=Section_3]]] & [[[[[~ [Section_2<=0] | [1<=F8 | ~ [1<=F10]]] & Section_4<=Section_15] & ~ [[[~ [1<=F6] | [F21<=0 | Section_20<=0]] | 1<=Section_16]]] & [Section_7<=Section_5 & ~ [F23<=0]]] & ~ [[1<=F5 & [~ [F3<=Section_24] | [F2<=Section_17 & [F21<=Section_14 | F2<=0]]]]]]]]]
normalized: E [true U [[[~ [[[[[F21<=Section_14 | F2<=0] & F2<=Section_17] | ~ [F3<=Section_24]] & 1<=F5]] & [[~ [F23<=0] & Section_7<=Section_5] & [~ [[[[F21<=0 | Section_20<=0] | ~ [1<=F6]] | 1<=Section_16]] & [[[~ [1<=F10] | 1<=F8] | ~ [Section_2<=0]] & Section_4<=Section_15]]]] & ~ [[~ [1<=Section_3] & [Section_10<=0 & F17<=1]]]] & [~ [1<=F13] | ~ [F6<=Section_12]]]]

abstracting: (F6<=Section_12)
states: 66,993 (4)
abstracting: (1<=F13)
states: 34,016 (4)
abstracting: (F17<=1)
states: 55,757 (4)
abstracting: (Section_10<=0)
states: 68,032 (4)
abstracting: (1<=Section_3)
states: 34,016 (4)
abstracting: (Section_4<=Section_15)
states: 75,279 (4)
abstracting: (Section_2<=0)
states: 52,499 (4)
abstracting: (1<=F8)
states: 74,240 (4)
abstracting: (1<=F10)
states: 34,016 (4)
abstracting: (1<=Section_16)
states: 18,483 (4)
abstracting: (1<=F6)
states: 34,016 (4)
abstracting: (Section_20<=0)
states: 52,499 (4)
abstracting: (F21<=0)
states: 52,499 (4)
abstracting: (Section_7<=Section_5)
states: 75,279 (4)
abstracting: (F23<=0)
states: 12,275 (4)
abstracting: (1<=F5)
states: 74,240 (4)
abstracting: (F3<=Section_24)
states: 66,993 (4)
abstracting: (F2<=Section_17)
states: 28,799 (4)
abstracting: (F2<=0)
states: 12,275 (4)
abstracting: (F21<=Section_14)
states: 66,993 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [~ [[[[[[[[~ [F13<=F3] | ~ [1<=Section_5]] & Section_5<=1] & [~ [F3<=Section_8] & [[Section_19<=1 | 1<=Section_20] | [1<=Section_15 & F5<=1]]]] & 1<=F17] & [~ [[[[Section_3<=F12 | 1<=F8] | ~ [Section_19<=1]] | Section_24<=Section_16]] | ~ [[[[Section_20<=1 & Section_8<=Section_17] | [F13<=1 | 1<=F15]] & [1<=Section_15 | F5<=F14]]]]] | F24<=Section_2] & [~ [Section_11<=Section_23] & [[[1<=F17 | [~ [1<=Section_14] & F19<=Section_5]] & 1<=Section_20] | 1<=F6]]]]]
normalized: ~ [E [true U [[[1<=F6 | [1<=Section_20 & [1<=F17 | [F19<=Section_5 & ~ [1<=Section_14]]]]] & ~ [Section_11<=Section_23]] & [F24<=Section_2 | [[~ [[[1<=Section_15 | F5<=F14] & [[F13<=1 | 1<=F15] | [Section_20<=1 & Section_8<=Section_17]]]] | ~ [[Section_24<=Section_16 | [~ [Section_19<=1] | [Section_3<=F12 | 1<=F8]]]]] & [1<=F17 & [[[[1<=Section_15 & F5<=1] | [Section_19<=1 | 1<=Section_20]] & ~ [F3<=Section_8]] & [Section_5<=1 & [~ [1<=Section_5] | ~ [F13<=F3]]]]]]]]]]

abstracting: (F13<=F3)
states: 64,774 (4)
abstracting: (1<=Section_5)
states: 34,016 (4)
abstracting: (Section_5<=1)
states: 86,515 (4)
abstracting: (F3<=Section_8)
states: 66,993 (4)
abstracting: (1<=Section_20)
states: 34,016 (4)
abstracting: (Section_19<=1)
states: 86,515 (4)
abstracting: (F5<=1)
states: 55,757 (4)
abstracting: (1<=Section_15)
states: 34,016 (4)
abstracting: (1<=F17)
states: 74,240 (4)
abstracting: (1<=F8)
states: 74,240 (4)
abstracting: (Section_3<=F12)
states: 66,993 (4)
abstracting: (Section_19<=1)
states: 86,515 (4)
abstracting: (Section_24<=Section_16)
states: 59,746 (4)
abstracting: (Section_8<=Section_17)
states: 64,774 (4)
abstracting: (Section_20<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
abstracting: (F13<=1)
states: 86,515 (4)
abstracting: (F5<=F14)
states: 59,284 (4)
abstracting: (1<=Section_15)
states: 34,016 (4)
abstracting: (F24<=Section_2)
states: 70,982 (4)
abstracting: (Section_11<=Section_23)
states: 64,774 (4)
abstracting: (1<=Section_14)
states: 34,016 (4)
abstracting: (F19<=Section_5)
states: 66,993 (4)
abstracting: (1<=F17)
states: 74,240 (4)
abstracting: (1<=Section_20)
states: 34,016 (4)
abstracting: (1<=F6)
states: 34,016 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [[~ [[[~ [[[~ [1<=F11] | [[F19<=Section_1 | Section_5<=0] | ~ [1<=Section_20]]] & Section_17<=Section_13]] & [~ [[[[F24<=1 & 1<=Section_3] & ~ [F16<=1]] & [[F21<=Section_9 & Section_10<=1] | [1<=Section_19 | F17<=F11]]]] & [[~ [[F21<=F4 & 1<=F10]] & ~ [1<=Section_19]] | [[Section_9<=1 | Section_11<=F14] & [~ [Section_16<=0] | [1<=Section_22 | Section_14<=1]]]]]] | [Section_8<=Section_18 & F3<=Section_22]]] & [1<=F15 & [1<=Section_9 | [1<=F6 | ~ [[[[[F16<=F18 | Section_21<=F16] & ~ [1<=F23]] & [F12<=0 | ~ [Section_3<=0]]] & [F21<=F21 | ~ [F15<=F10]]]]]]]]]
normalized: E [true U [[1<=F15 & [1<=Section_9 | [1<=F6 | ~ [[[F21<=F21 | ~ [F15<=F10]] & [[F12<=0 | ~ [Section_3<=0]] & [~ [1<=F23] & [F16<=F18 | Section_21<=F16]]]]]]]] & ~ [[[Section_8<=Section_18 & F3<=Section_22] | [[[[[[1<=Section_22 | Section_14<=1] | ~ [Section_16<=0]] & [Section_9<=1 | Section_11<=F14]] | [~ [1<=Section_19] & ~ [[F21<=F4 & 1<=F10]]]] & ~ [[[[1<=Section_19 | F17<=F11] | [F21<=Section_9 & Section_10<=1]] & [~ [F16<=1] & [F24<=1 & 1<=Section_3]]]]] & ~ [[Section_17<=Section_13 & [[~ [1<=Section_20] | [F19<=Section_1 | Section_5<=0]] | ~ [1<=F11]]]]]]]]]

abstracting: (1<=F11)
states: 74,240 (4)
abstracting: (Section_5<=0)
states: 52,499 (4)
abstracting: (F19<=Section_1)
states: 59,746 (4)
abstracting: (1<=Section_20)
states: 34,016 (4)
abstracting: (Section_17<=Section_13)
states: 59,746 (4)
abstracting: (1<=Section_3)
states: 34,016 (4)
abstracting: (F24<=1)
states: 86,515 (4)
abstracting: (F16<=1)
states: 86,515 (4)
abstracting: (Section_10<=1)
states: 86,515 (4)
abstracting: (F21<=Section_9)
states: 66,993 (4)
abstracting: (F17<=F11)
states: 59,284 (4)
abstracting: (1<=Section_19)
states: 18,483 (4)
abstracting: (1<=F10)
states: 34,016 (4)
abstracting: (F21<=F4)
states: 64,774 (4)
abstracting: (1<=Section_19)
states: 18,483 (4)
abstracting: (Section_11<=F14)
states: 82,502 (4)
abstracting: (Section_9<=1)
states: 86,515 (4)
abstracting: (Section_16<=0)
states: 68,032 (4)
abstracting: (Section_14<=1)
states: 86,515 (4)
abstracting: (1<=Section_22)
states: 18,483 (4)
abstracting: (F3<=Section_22)
states: 59,746 (4)
abstracting: (Section_8<=Section_18)
states: 64,774 (4)
abstracting: (Section_21<=F16)
states: 66,993 (4)
abstracting: (F16<=F18)
states: 64,774 (4)
abstracting: (1<=F23)
states: 74,240 (4)
abstracting: (Section_3<=0)
states: 52,499 (4)
abstracting: (F12<=0)
states: 52,499 (4)
abstracting: (F15<=F10)
states: 64,774 (4)
abstracting: (F21<=F21)
states: 86,515 (4)
abstracting: (1<=F6)
states: 34,016 (4)
abstracting: (1<=Section_9)
states: 34,016 (4)
abstracting: (1<=F15)
states: 34,016 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AG [[[[[[[1<=F18 & [Section_23<=0 & [[F18<=1 & F19<=0] & [F4<=Section_21 & F4<=F3]]]] | [[[[Section_16<=Section_16 | F12<=1] | [1<=F17 & 1<=F10]] | [[1<=F6 | F3<=F6] | [Section_3<=F19 & F9<=0]]] | [F1<=F15 & 1<=Section_21]]] & [Section_1<=0 & [1<=Section_18 & 1<=F11]]] & [[[[[[1<=Section_17 & 1<=F8] | ~ [Section_4<=Section_19]] | ~ [[1<=Section_13 & 1<=Section_8]]] & [~ [[F8<=0 & 1<=F24]] & [~ [F8<=1] & [1<=Section_17 | 1<=Section_2]]]] & ~ [1<=Section_24]] & ~ [F13<=Section_3]]] | [~ [1<=F8] | [~ [Section_21<=0] & ~ [[Section_8<=F24 | [F6<=Section_15 & [~ [F13<=F23] | [Section_8<=1 & F15<=F11]]]]]]]] | ~ [1<=F21]]]
normalized: ~ [E [true U ~ [[~ [1<=F21] | [[[~ [[Section_8<=F24 | [F6<=Section_15 & [[Section_8<=1 & F15<=F11] | ~ [F13<=F23]]]]] & ~ [Section_21<=0]] | ~ [1<=F8]] | [[~ [F13<=Section_3] & [~ [1<=Section_24] & [[[[1<=Section_17 | 1<=Section_2] & ~ [F8<=1]] & ~ [[F8<=0 & 1<=F24]]] & [~ [[1<=Section_13 & 1<=Section_8]] | [~ [Section_4<=Section_19] | [1<=Section_17 & 1<=F8]]]]]] & [[Section_1<=0 & [1<=Section_18 & 1<=F11]] & [[[F1<=F15 & 1<=Section_21] | [[[Section_3<=F19 & F9<=0] | [1<=F6 | F3<=F6]] | [[1<=F17 & 1<=F10] | [Section_16<=Section_16 | F12<=1]]]] | [1<=F18 & [Section_23<=0 & [[F4<=Section_21 & F4<=F3] & [F18<=1 & F19<=0]]]]]]]]]]]]

abstracting: (F19<=0)
states: 52,499 (4)
abstracting: (F18<=1)
states: 86,515 (4)
abstracting: (F4<=F3)
states: 68,032 (4)
abstracting: (F4<=Section_21)
states: 66,993 (4)
abstracting: (Section_23<=0)
states: 52,499 (4)
abstracting: (1<=F18)
states: 34,016 (4)
abstracting: (F12<=1)
states: 86,515 (4)
abstracting: (Section_16<=Section_16)
states: 86,515 (4)
abstracting: (1<=F10)
states: 34,016 (4)
abstracting: (1<=F17)
states: 74,240 (4)
abstracting: (F3<=F6)
states: 64,774 (4)
abstracting: (1<=F6)
states: 34,016 (4)
abstracting: (F9<=0)
states: 52,499 (4)
abstracting: (Section_3<=F19)
states: 66,993 (4)
abstracting: (1<=Section_21)
states: 34,016 (4)
abstracting: (F1<=F15)
states: 64,774 (4)
abstracting: (1<=F11)
states: 74,240 (4)
abstracting: (1<=Section_18)
states: 34,016 (4)
abstracting: (Section_1<=0)
states: 68,032 (4)
abstracting: (1<=F8)
states: 74,240 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (Section_4<=Section_19)
states: 72,021 (4)
abstracting: (1<=Section_8)
states: 34,016 (4)
abstracting: (1<=Section_13)
states: 18,483 (4)
abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (F8<=0)
states: 12,275 (4)
abstracting: (F8<=1)
states: 55,757 (4)
abstracting: (1<=Section_2)
states: 34,016 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (F13<=Section_3)
states: 66,993 (4)
abstracting: (1<=F8)
states: 74,240 (4)
abstracting: (Section_21<=0)
states: 52,499 (4)
abstracting: (F13<=F23)
states: 80,826 (4)
abstracting: (F15<=F11)
states: 80,826 (4)
abstracting: (Section_8<=1)
states: 86,515 (4)
abstracting: (F6<=Section_15)
states: 66,993 (4)
abstracting: (Section_8<=F24)
states: 66,993 (4)
abstracting: (1<=F21)
states: 34,016 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [[~ [[~ [[[[Section_20<=Section_5 & F19<=Section_3] & [Section_10<=F19 | Section_1<=1]] & ~ [[Section_10<=0 & F19<=Section_1]]]] | ~ [1<=F16]]] | [[[~ [1<=F4] & ~ [[F21<=0 | ~ [[F21<=Section_23 & [F21<=F16 & 1<=Section_3]]]]]] | [F3<=1 & ~ [[[[Section_6<=0 & [1<=Section_13 | Section_12<=1]] & F20<=Section_9] & [~ [1<=F1] | 1<=F21]]]]] | [[[Section_24<=F21 & [F1<=Section_2 | 1<=F24]] | F2<=F14] & [[~ [[[Section_19<=F10 | F12<=Section_14] & [F7<=0 & 1<=F5]]] | [~ [[Section_21<=Section_8 | F3<=1]] | ~ [[[Section_18<=F21 | F3<=Section_17] | [Section_2<=Section_1 & 1<=Section_2]]]]] & [Section_14<=1 | ~ [F19<=0]]]]]]]
normalized: E [true U [[[[[Section_14<=1 | ~ [F19<=0]] & [[~ [[[Section_2<=Section_1 & 1<=Section_2] | [Section_18<=F21 | F3<=Section_17]]] | ~ [[Section_21<=Section_8 | F3<=1]]] | ~ [[[F7<=0 & 1<=F5] & [Section_19<=F10 | F12<=Section_14]]]]] & [F2<=F14 | [Section_24<=F21 & [F1<=Section_2 | 1<=F24]]]] | [[F3<=1 & ~ [[[1<=F21 | ~ [1<=F1]] & [F20<=Section_9 & [Section_6<=0 & [1<=Section_13 | Section_12<=1]]]]]] | [~ [[F21<=0 | ~ [[F21<=Section_23 & [F21<=F16 & 1<=Section_3]]]]] & ~ [1<=F4]]]] | ~ [[~ [1<=F16] | ~ [[~ [[Section_10<=0 & F19<=Section_1]] & [[Section_10<=F19 | Section_1<=1] & [Section_20<=Section_5 & F19<=Section_3]]]]]]]]

abstracting: (F19<=Section_3)
states: 66,993 (4)
abstracting: (Section_20<=Section_5)
states: 64,774 (4)
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (Section_10<=F19)
states: 75,279 (4)
abstracting: (F19<=Section_1)
states: 59,746 (4)
abstracting: (Section_10<=0)
states: 68,032 (4)
abstracting: (1<=F16)
states: 34,016 (4)
abstracting: (1<=F4)
states: 34,016 (4)
abstracting: (1<=Section_3)
states: 34,016 (4)
abstracting: (F21<=F16)
states: 64,774 (4)
abstracting: (F21<=Section_23)
states: 70,982 (4)
abstracting: (F21<=0)
states: 52,499 (4)
abstracting: (Section_12<=1)
states: 86,515 (4)
abstracting: (1<=Section_13)
states: 18,483 (4)
abstracting: (Section_6<=0)
states: 52,499 (4)
abstracting: (F20<=Section_9)
states: 28,799 (4)
abstracting: (1<=F1)
states: 34,016 (4)
abstracting: (1<=F21)
states: 34,016 (4)
abstracting: (F3<=1)
states: 86,515 (4)
abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (F1<=Section_2)
states: 52,499 (4)
abstracting: (Section_24<=F21)
states: 66,993 (4)
abstracting: (F2<=F14)
states: 59,284 (4)
abstracting: (F12<=Section_14)
states: 70,982 (4)
abstracting: (Section_19<=F10)
states: 75,279 (4)
abstracting: (1<=F5)
states: 74,240 (4)
abstracting: (F7<=0)
states: 52,499 (4)
abstracting: (F3<=1)
states: 86,515 (4)
abstracting: (Section_21<=Section_8)
states: 64,774 (4)
abstracting: (F3<=Section_17)
states: 66,993 (4)
abstracting: (Section_18<=F21)
states: 66,993 (4)
abstracting: (1<=Section_2)
states: 34,016 (4)
abstracting: (Section_2<=Section_1)
states: 52,499 (4)
abstracting: (F19<=0)
states: 52,499 (4)
abstracting: (Section_14<=1)
states: 86,515 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AG [[[[~ [[[[Section_14<=Section_12 & [1<=F24 & Section_23<=F15]] & ~ [Section_12<=1]] & F10<=1]] | [[~ [[~ [F15<=Section_12] & 1<=F14]] | ~ [[Section_9<=1 | Section_20<=1]]] | ~ [[~ [1<=Section_19] & ~ [Section_13<=0]]]]] | ~ [[F2<=1 | ~ [[[[Section_10<=0 | F12<=Section_18] & [F17<=0 & F14<=Section_21]] | Section_8<=1]]]]] | [~ [[1<=F6 | [Section_18<=Section_4 | [[~ [[1<=F15 | Section_15<=0]] & [[F20<=1 & 1<=Section_5] | [F23<=F4 & F18<=Section_23]]] & ~ [[[1<=F2 | Section_24<=0] | [F14<=1 | 1<=F5]]]]]]] & [[Section_7<=0 | [Section_23<=F15 | 1<=Section_12]] | ~ [[1<=Section_23 & [[[[1<=Section_8 | F8<=F24] & Section_8<=F20] | [[1<=Section_17 & Section_11<=F16] | [1<=F21 & 1<=F9]]] | Section_10<=Section_3]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[1<=Section_23 & [Section_10<=Section_3 | [[[1<=F21 & 1<=F9] | [1<=Section_17 & Section_11<=F16]] | [Section_8<=F20 & [1<=Section_8 | F8<=F24]]]]]] | [Section_7<=0 | [Section_23<=F15 | 1<=Section_12]]] & ~ [[1<=F6 | [Section_18<=Section_4 | [~ [[[F14<=1 | 1<=F5] | [1<=F2 | Section_24<=0]]] & [[[F23<=F4 & F18<=Section_23] | [F20<=1 & 1<=Section_5]] & ~ [[1<=F15 | Section_15<=0]]]]]]]] | [~ [[F2<=1 | ~ [[Section_8<=1 | [[F17<=0 & F14<=Section_21] & [Section_10<=0 | F12<=Section_18]]]]]] | [[~ [[~ [Section_13<=0] & ~ [1<=Section_19]]] | [~ [[Section_9<=1 | Section_20<=1]] | ~ [[1<=F14 & ~ [F15<=Section_12]]]]] | ~ [[F10<=1 & [~ [Section_12<=1] & [Section_14<=Section_12 & [1<=F24 & Section_23<=F15]]]]]]]]]]]

abstracting: (Section_23<=F15)
states: 66,993 (4)
abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (Section_14<=Section_12)
states: 68,032 (4)
abstracting: (Section_12<=1)
states: 86,515 (4)
abstracting: (F10<=1)
states: 86,515 (4)
abstracting: (F15<=Section_12)
states: 66,993 (4)
abstracting: (1<=F14)
states: 74,240 (4)
abstracting: (Section_20<=1)
states: 86,515 (4)
abstracting: (Section_9<=1)
states: 86,515 (4)
abstracting: (1<=Section_19)
states: 18,483 (4)
abstracting: (Section_13<=0)
states: 68,032 (4)
abstracting: (F12<=Section_18)
states: 66,993 (4)
abstracting: (Section_10<=0)
states: 68,032 (4)
abstracting: (F14<=Section_21)
states: 28,799 (4)
abstracting: (F17<=0)
states: 12,275 (4)
abstracting: (Section_8<=1)
states: 86,515 (4)
abstracting: (F2<=1)
states: 55,757 (4)
abstracting: (Section_15<=0)
states: 52,499 (4)
abstracting: (1<=F15)
states: 34,016 (4)
abstracting: (1<=Section_5)
states: 34,016 (4)
abstracting: (F20<=1)
states: 55,757 (4)
abstracting: (F18<=Section_23)
states: 66,993 (4)
abstracting: (F23<=F4)
states: 29,885 (4)
abstracting: (Section_24<=0)
states: 52,499 (4)
abstracting: (1<=F2)
states: 74,240 (4)
abstracting: (1<=F5)
states: 74,240 (4)
abstracting: (F14<=1)
states: 55,757 (4)
abstracting: (Section_18<=Section_4)
states: 59,746 (4)
abstracting: (1<=F6)
states: 34,016 (4)
abstracting: (1<=Section_12)
states: 34,016 (4)
abstracting: (Section_23<=F15)
states: 66,993 (4)
abstracting: (Section_7<=0)
states: 68,032 (4)
abstracting: (F8<=F24)
states: 29,885 (4)
abstracting: (1<=Section_8)
states: 34,016 (4)
abstracting: (Section_8<=F20)
states: 82,502 (4)
abstracting: (Section_11<=F16)
states: 66,993 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (1<=F9)
states: 34,016 (4)
abstracting: (1<=F21)
states: 34,016 (4)
abstracting: (Section_10<=Section_3)
states: 75,279 (4)
abstracting: (1<=Section_23)
states: 34,016 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[[[1<=Section_20 | [~ [[[~ [1<=F24] & 1<=F23] & ~ [[1<=F4 & Section_5<=1]]]] & ~ [1<=Section_13]]] & F2<=1] & ~ [[[[[[[~ [F11<=1] | [Section_14<=Section_4 & Section_12<=0]] & 1<=Section_13] | ~ [[Section_18<=Section_11 & 1<=Section_19]]] & [~ [[F5<=1 & [F4<=F9 | F15<=Section_18]]] | [~ [[1<=F23 | F20<=Section_2]] & [~ [F7<=F20] & F16<=F14]]]] | ~ [[[~ [F13<=0] & [Section_14<=0 | 1<=F22]] & [[Section_18<=Section_21 & F3<=1] & F23<=0]]]] & [[[1<=Section_13 & ~ [1<=F23]] | [[~ [1<=F1] & [[Section_17<=Section_4 & 1<=Section_7] | ~ [Section_3<=Section_17]]] & [F10<=0 & [[F5<=0 | F11<=1] | 1<=Section_10]]]] & [[[~ [1<=F24] & F4<=F14] & [1<=Section_4 & [~ [1<=Section_14] & [Section_14<=1 | Section_14<=1]]]] & [Section_16<=Section_1 & 1<=Section_2]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[Section_16<=Section_1 & 1<=Section_2] & [[1<=Section_4 & [[Section_14<=1 | Section_14<=1] & ~ [1<=Section_14]]] & [F4<=F14 & ~ [1<=F24]]]] & [[[F10<=0 & [1<=Section_10 | [F5<=0 | F11<=1]]] & [[~ [Section_3<=Section_17] | [Section_17<=Section_4 & 1<=Section_7]] & ~ [1<=F1]]] | [1<=Section_13 & ~ [1<=F23]]]] & [~ [[[F23<=0 & [Section_18<=Section_21 & F3<=1]] & [[Section_14<=0 | 1<=F22] & ~ [F13<=0]]]] | [[[[F16<=F14 & ~ [F7<=F20]] & ~ [[1<=F23 | F20<=Section_2]]] | ~ [[F5<=1 & [F4<=F9 | F15<=Section_18]]]] & [~ [[Section_18<=Section_11 & 1<=Section_19]] | [1<=Section_13 & [[Section_14<=Section_4 & Section_12<=0] | ~ [F11<=1]]]]]]]] & [F2<=1 & [1<=Section_20 | [~ [1<=Section_13] & ~ [[~ [[1<=F4 & Section_5<=1]] & [1<=F23 & ~ [1<=F24]]]]]]]]]]]

abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (1<=F23)
states: 74,240 (4)
abstracting: (Section_5<=1)
states: 86,515 (4)
abstracting: (1<=F4)
states: 34,016 (4)
abstracting: (1<=Section_13)
states: 18,483 (4)
abstracting: (1<=Section_20)
states: 34,016 (4)
abstracting: (F2<=1)
states: 55,757 (4)
abstracting: (F11<=1)
states: 55,757 (4)
abstracting: (Section_12<=0)
states: 52,499 (4)
abstracting: (Section_14<=Section_4)
states: 59,746 (4)
abstracting: (1<=Section_13)
states: 18,483 (4)
abstracting: (1<=Section_19)
states: 18,483 (4)
abstracting: (Section_18<=Section_11)
states: 64,774 (4)
abstracting: (F15<=Section_18)
states: 66,993 (4)
abstracting: (F4<=F9)
states: 64,774 (4)
abstracting: (F5<=1)
states: 55,757 (4)
abstracting: (F20<=Section_2)
states: 28,799 (4)
abstracting: (1<=F23)
states: 74,240 (4)
abstracting: (F7<=F20)
states: 80,826 (4)
abstracting: (F16<=F14)
states: 79,268 (4)
abstracting: (F13<=0)
states: 52,499 (4)
abstracting: (1<=F22)
states: 34,016 (4)
abstracting: (Section_14<=0)
states: 52,499 (4)
abstracting: (F3<=1)
states: 86,515 (4)
abstracting: (Section_18<=Section_21)
states: 64,774 (4)
abstracting: (F23<=0)
states: 12,275 (4)
abstracting: (1<=F23)
states: 74,240 (4)
abstracting: (1<=Section_13)
states: 18,483 (4)
abstracting: (1<=F1)
states: 34,016 (4)
abstracting: (1<=Section_7)
states: 18,483 (4)
abstracting: (Section_17<=Section_4)
states: 59,746 (4)
abstracting: (Section_3<=Section_17)
states: 64,774 (4)
abstracting: (F11<=1)
states: 55,757 (4)
abstracting: (F5<=0)
states: 12,275 (4)
abstracting: (1<=Section_10)
states: 18,483 (4)
abstracting: (F10<=0)
states: 52,499 (4)
abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (F4<=F14)
states: 80,826 (4)
abstracting: (1<=Section_14)
states: 34,016 (4)
abstracting: (Section_14<=1)
states: 86,515 (4)
abstracting: (Section_14<=1)
states: 86,515 (4)
abstracting: (1<=Section_4)
states: 18,483 (4)
abstracting: (1<=Section_2)
states: 34,016 (4)
abstracting: (Section_16<=Section_1)
states: 72,021 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 144029 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 79936 282192 362128
used/not used/entry size/cache size: 340568 66768296 16 1024MB
basic ops cache: hits/miss/sum: 68945 258064 327009
used/not used/entry size/cache size: 488924 16288292 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: 12985 39306 52291
used/not used/entry size/cache size: 39275 8349333 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 66973411
1 129084
2 5500
3 618
4 103
5 33
6 27
7 19
8 9
9 10
>= 10 50

Total processing time: 0m 6.088sec


BK_STOP 1678306002385

--------------------
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:464 (19), effective:96 (4)

initing FirstDep: 0m 0.000sec


iterations count:98 (4), effective:12 (0)

iterations count:57 (2), effective:11 (0)

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

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

iterations count:196 (8), effective:31 (1)

iterations count:412 (17), effective:95 (3)

iterations count:305 (12), effective:70 (2)

iterations count:237 (9), effective:54 (2)

iterations count:142 (5), effective:27 (1)

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

iterations count:178 (7), effective:47 (1)

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="CircularTrains-PT-024"
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 CircularTrains-PT-024, 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 r074-smll-167814399900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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