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.r170-tall-167838856900198.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 FMS-PT-00005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K Feb 25 19:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 19:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 19:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 19:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 25 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 FMS-PT-00005-ReachabilityCardinality-00
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-01
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-02
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-03
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-04
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-05
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-06
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-07
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-08
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-09
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-10
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-11
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-12
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-13
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-14
FORMULA_NAME FMS-PT-00005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678493926082

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=FMS-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:18:47] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:18:47] [INFO ] Transformed 22 places.
[2023-03-11 00:18:47] [INFO ] Transformed 20 transitions.
[2023-03-11 00:18:47] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FMS-PT-00005-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00005-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :6
FORMULA FMS-PT-00005-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00005-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00005-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00005-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00005-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :1
FORMULA FMS-PT-00005-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:18:48] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-11 00:18:48] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 00:18:48] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-11 00:18:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:18:48] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-11 00:18:48] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 00:18:48] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA FMS-PT-00005-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00005-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00005-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00005-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00005-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00005-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA FMS-PT-00005-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 1204 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: FMS_PT_00005
(NrP: 22 NrTr: 20 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.725sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 1005 (1.0e+03) #states 2,895,018 (6)



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

checking: EF [4<=P12s]
normalized: E [true U 4<=P12s]

abstracting: (4<=P12s)
states: 840
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [~ [5<=P12s]]
normalized: ~ [E [true U 5<=P12s]]

abstracting: (5<=P12s)
states: 21
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [P1s<=5]]
normalized: E [true U ~ [P1s<=5]]

abstracting: (P1s<=5)
states: 2,895,018 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=P12M3]
normalized: E [true U 2<=P12M3]

abstracting: (2<=P12M3)
states: 90,006 (4)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [P3M2<=5]
normalized: ~ [E [true U ~ [P3M2<=5]]]

abstracting: (P3M2<=5)
states: 2,895,018 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (P2M2<=P2M2)
states: 2,895,018 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (P1wM1<=P1wM1)
states: 2,895,018 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [5<=P12s] | P2wM2<=3] | P1wM1<=3]]
normalized: ~ [E [true U ~ [[[~ [5<=P12s] | P2wM2<=3] | P1wM1<=3]]]]

abstracting: (P1wM1<=3)
states: 2,861,502 (6)
abstracting: (P2wM2<=3)
states: 2,853,522 (6)
abstracting: (5<=P12s)
states: 21
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[~ [[[1<=P1wP2 | [~ [P12wM3<=2] & [P12s<=P3s & P12M3<=P1d]]] & P1<=3]] & [~ [[~ [[2<=P3M2 & P2d<=4]] | [[P12wM3<=3 | P2<=1] & [P1wM1<=P2s & P2M2<=0]]]] & M3<=0]] & P3s<=5]]]
normalized: ~ [E [true U [[[~ [[[[P1wM1<=P2s & P2M2<=0] & [P12wM3<=3 | P2<=1]] | ~ [[2<=P3M2 & P2d<=4]]]] & M3<=0] & ~ [[[[[P12s<=P3s & P12M3<=P1d] & ~ [P12wM3<=2]] | 1<=P1wP2] & P1<=3]]] & P3s<=5]]]

abstracting: (P3s<=5)
states: 2,895,018 (6)
abstracting: (P1<=3)
states: 2,861,502 (6)
abstracting: (1<=P1wP2)
states: 1,280,706 (6)
abstracting: (P12wM3<=2)
states: 2,882,964 (6)
abstracting: (P12M3<=P1d)
states: 2,505,762 (6)
abstracting: (P12s<=P3s)
states: 2,692,865 (6)
abstracting: (M3<=0)
states: 90,006 (4)
abstracting: (P2d<=4)
states: 2,889,852 (6)
abstracting: (2<=P3M2)
states: 1,378,580 (6)
abstracting: (P2<=1)
states: 2,347,779 (6)
abstracting: (P12wM3<=3)
states: 2,894,178 (6)
abstracting: (P2M2<=0)
states: 1,943,697 (6)
abstracting: (P1wM1<=P2s)
states: 2,067,492 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [~ [[[~ [[~ [[[P1wM1<=P3 | P12<=3] | P2s<=P12wM3]] | M2<=5]] | 4<=P2M2] | ~ [[1<=P1wM1 | ~ [[[[[M1<=P3M2 | P2wM2<=0] | [P2M2<=P3M2 | M2<=P1d]] & ~ [[P1wP2<=3 & M2<=4]]] & P12<=3]]]]]]]
normalized: ~ [E [true U [~ [[~ [[[~ [[P1wP2<=3 & M2<=4]] & [[P2M2<=P3M2 | M2<=P1d] | [M1<=P3M2 | P2wM2<=0]]] & P12<=3]] | 1<=P1wM1]] | [~ [[~ [[[P1wM1<=P3 | P12<=3] | P2s<=P12wM3]] | M2<=5]] | 4<=P2M2]]]]

abstracting: (4<=P2M2)
states: 0
abstracting: (M2<=5)
states: 2,895,018 (6)
abstracting: (P2s<=P12wM3)
states: 1,714,902 (6)
abstracting: (P12<=3)
states: 2,894,178 (6)
abstracting: (P1wM1<=P3)
states: 2,379,498 (6)
abstracting: (1<=P1wM1)
states: 1,280,706 (6)
abstracting: (P12<=3)
states: 2,894,178 (6)
abstracting: (P2wM2<=0)
states: 1,538,208 (6)
abstracting: (M1<=P3M2)
states: 1,206,632 (6)
abstracting: (M2<=P1d)
states: 1,804,866 (6)
abstracting: (P2M2<=P3M2)
states: 2,623,212 (6)
abstracting: (M2<=4)
states: 2,895,018 (6)
abstracting: (P1wP2<=3)
states: 2,861,502 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[[~ [[[~ [[P3<=P1wP2 & [P12<=M1 | 2<=P2]]] | ~ [[~ [[1<=P2wP1 & 1<=P2wP1]] | ~ [M2<=P2s]]]] | ~ [P2s<=M3]]] & ~ [3<=P2s]] | [[~ [[~ [P1wP2<=4] & ~ [3<=P3M2]]] | ~ [[[P2s<=M1 | 4<=P2wP1] & [M2<=M1 | P1wP2<=2]]]] | ~ [P1d<=M1]]]]
normalized: ~ [E [true U ~ [[[~ [P1d<=M1] | [~ [[[M2<=M1 | P1wP2<=2] & [P2s<=M1 | 4<=P2wP1]]] | ~ [[~ [3<=P3M2] & ~ [P1wP2<=4]]]]] | [~ [3<=P2s] & ~ [[~ [P2s<=M3] | [~ [[~ [M2<=P2s] | ~ [[1<=P2wP1 & 1<=P2wP1]]]] | ~ [[P3<=P1wP2 & [P12<=M1 | 2<=P2]]]]]]]]]]]

abstracting: (2<=P2)
states: 547,239 (5)
abstracting: (P12<=M1)
states: 2,869,545 (6)
abstracting: (P3<=P1wP2)
states: 1,249,578 (6)
abstracting: (1<=P2wP1)
states: 1,356,810 (6)
abstracting: (1<=P2wP1)
states: 1,356,810 (6)
abstracting: (M2<=P2s)
states: 1,902,642 (6)
abstracting: (P2s<=M3)
states: 2,628,864 (6)
abstracting: (3<=P2s)
states: 178,080 (5)
abstracting: (P1wP2<=4)
states: 2,890,902 (6)
abstracting: (3<=P3M2)
states: 827,148 (5)
abstracting: (4<=P2wP1)
states: 41,496 (4)
abstracting: (P2s<=M1)
states: 2,696,148 (6)
abstracting: (P1wP2<=2)
states: 2,745,162 (6)
abstracting: (M2<=M1)
states: 2,818,578 (6)
abstracting: (P1d<=M1)
states: 2,777,418 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[[~ [[[[~ [[P2<=P3s | P2M2<=3]] | ~ [[P1wP2<=1 | [3<=P2 & 5<=M1]]]] | [[~ [4<=M1] & [P12M3<=P1M1 & ~ [1<=P2wP1]]] | [[P2wP1<=P12wM3 | 1<=P1] & [[P1M1<=P1wM1 | P2wP1<=2] | ~ [4<=M3]]]]] | ~ [[[5<=P3s & [~ [3<=M1] & P1d<=P1]] & P3s<=5]]]] | [P2<=5 & [~ [[[[P1<=4 | M3<=5] & 5<=P1] & ~ [1<=P2wM2]]] | [[[~ [4<=P2wM2] & P12<=1] | ~ [[[1<=P2 | 2<=P2wP1] | P2wP1<=P12s]]] & ~ [3<=P2wP1]]]]] | ~ [3<=P3s]]]
normalized: ~ [E [true U ~ [[~ [3<=P3s] | [[P2<=5 & [[~ [3<=P2wP1] & [~ [[P2wP1<=P12s | [1<=P2 | 2<=P2wP1]]] | [P12<=1 & ~ [4<=P2wM2]]]] | ~ [[~ [1<=P2wM2] & [5<=P1 & [P1<=4 | M3<=5]]]]]] | ~ [[~ [[P3s<=5 & [5<=P3s & [P1d<=P1 & ~ [3<=M1]]]]] | [[[[~ [4<=M3] | [P1M1<=P1wM1 | P2wP1<=2]] & [P2wP1<=P12wM3 | 1<=P1]] | [[P12M3<=P1M1 & ~ [1<=P2wP1]] & ~ [4<=M1]]] | [~ [[P1wP2<=1 | [3<=P2 & 5<=M1]]] | ~ [[P2<=P3s | P2M2<=3]]]]]]]]]]]

abstracting: (P2M2<=3)
states: 2,895,018 (6)
abstracting: (P2<=P3s)
states: 2,336,723 (6)
abstracting: (5<=M1)
states: 0
abstracting: (3<=P2)
states: 178,080 (5)
abstracting: (P1wP2<=1)
states: 2,408,322 (6)
abstracting: (4<=M1)
states: 0
abstracting: (1<=P2wP1)
states: 1,356,810 (6)
abstracting: (P12M3<=P1M1)
states: 2,503,557 (6)
abstracting: (1<=P1)
states: 1,280,706 (6)
abstracting: (P2wP1<=P12wM3)
states: 1,714,902 (6)
abstracting: (P2wP1<=2)
states: 2,716,938 (6)
abstracting: (P1M1<=P1wM1)
states: 2,009,952 (6)
abstracting: (4<=M3)
states: 0
abstracting: (3<=M1)
states: 1,643,712 (6)
abstracting: (P1d<=P1)
states: 1,980,552 (6)
abstracting: (5<=P3s)
states: 137,858 (5)
abstracting: (P3s<=5)
states: 2,895,018 (6)
abstracting: (M3<=5)
states: 2,895,018 (6)
abstracting: (P1<=4)
states: 2,890,902 (6)
abstracting: (5<=P1)
states: 4,116 (3)
abstracting: (1<=P2wM2)
states: 1,356,810 (6)
abstracting: (4<=P2wM2)
states: 41,496 (4)
abstracting: (P12<=1)
states: 2,792,979 (6)
abstracting: (2<=P2wP1)
states: 547,239 (5)
abstracting: (1<=P2)
states: 1,356,810 (6)
abstracting: (P2wP1<=P12s)
states: 1,714,902 (6)
abstracting: (3<=P2wP1)
states: 178,080 (5)
abstracting: (P2<=5)
states: 2,895,018 (6)
abstracting: (3<=P3s)
states: 827,148 (5)
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [[[~ [[2<=P3M2 | [[~ [P2wM2<=5] | [2<=M3 & [[3<=P1wM1 & P2M2<=P12M3] & P3s<=P1d]]] & ~ [5<=M2]]]] & [~ [[[~ [P2wP1<=0] & ~ [[[P1d<=0 | P1M1<=P2M2] & [3<=P1d | 3<=P12M3]]]] & [[[M3<=0 & [P1wM1<=P12 & 2<=P2wM2]] & 1<=P3M2] & [P12s<=1 | P2<=P12wM3]]]] & 1<=P12M3]] & [[[[~ [[[P1<=P12 | [P12wM3<=4 & 2<=P2s]] | ~ [[P1s<=P1M1 & P2s<=P3s]]]] | ~ [2<=P12wM3]] & ~ [P2wP1<=1]] | [1<=P3 | 5<=P2wM2]] | P3M2<=3]]]
normalized: E [true U [[P3M2<=3 | [[1<=P3 | 5<=P2wM2] | [~ [P2wP1<=1] & [~ [2<=P12wM3] | ~ [[~ [[P1s<=P1M1 & P2s<=P3s]] | [P1<=P12 | [P12wM3<=4 & 2<=P2s]]]]]]]] & [[1<=P12M3 & ~ [[[[P12s<=1 | P2<=P12wM3] & [1<=P3M2 & [M3<=0 & [P1wM1<=P12 & 2<=P2wM2]]]] & [~ [[[3<=P1d | 3<=P12M3] & [P1d<=0 | P1M1<=P2M2]]] & ~ [P2wP1<=0]]]]] & ~ [[2<=P3M2 | [~ [5<=M2] & [[2<=M3 & [P3s<=P1d & [3<=P1wM1 & P2M2<=P12M3]]] | ~ [P2wM2<=5]]]]]]]]

abstracting: (P2wM2<=5)
states: 2,895,018 (6)
abstracting: (P2M2<=P12M3)
states: 2,127,993 (6)
abstracting: (3<=P1wM1)
states: 149,856 (5)
abstracting: (P3s<=P1d)
states: 1,249,578 (6)
abstracting: (2<=M3)
states: 2,292,192 (6)
abstracting: (5<=M2)
states: 0
abstracting: (2<=P3M2)
states: 1,378,580 (6)
abstracting: (P2wP1<=0)
states: 1,538,208 (6)
abstracting: (P1M1<=P2M2)
states: 1,907,388 (6)
abstracting: (P1d<=0)
states: 1,614,312 (6)
abstracting: (3<=P12M3)
states: 0
abstracting: (3<=P1d)
states: 149,856 (5)
abstracting: (2<=P2wM2)
states: 547,239 (5)
abstracting: (P1wM1<=P12)
states: 1,784,811 (6)
abstracting: (M3<=0)
states: 90,006 (4)
abstracting: (1<=P3M2)
states: 2,067,870 (6)
abstracting: (P2<=P12wM3)
states: 1,714,902 (6)
abstracting: (P12s<=1)
states: 2,792,979 (6)
abstracting: (1<=P12M3)
states: 602,826 (5)
abstracting: (2<=P2s)
states: 547,239 (5)
abstracting: (P12wM3<=4)
states: 2,894,997 (6)
abstracting: (P1<=P12)
states: 1,784,811 (6)
abstracting: (P2s<=P3s)
states: 2,336,723 (6)
abstracting: (P1s<=P1M1)
states: 1,976,436 (6)
abstracting: (2<=P12wM3)
states: 102,039 (5)
abstracting: (P2wP1<=1)
states: 2,347,779 (6)
abstracting: (5<=P2wM2)
states: 5,166 (3)
abstracting: (1<=P3)
states: 2,067,870 (6)
abstracting: (P3M2<=3)
states: 2,481,444 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[4<=P12wM3 & [4<=P1d & [[[[~ [[~ [3<=P1s] | [M2<=P3M2 & P1wM1<=0]]] | [P1d<=1 | [~ [4<=P12M3] | ~ [P12<=P2s]]]] & [[P3M2<=M2 | ~ [[M1<=P2d & 2<=P2M2]]] | [~ [[M2<=P12M3 & P1M1<=1]] & [[P12s<=1 & 2<=P3M2] & [3<=P2 & 1<=M3]]]]] & [[[[4<=P12wM3 | M3<=2] | [[2<=P1M1 & 4<=P2M2] & [1<=P2wP1 & 5<=P12]]] | [[P2wP1<=P3s & [1<=P12wM3 & M3<=P1]] | M2<=P1wM1]] & [[[[P3<=2 & P1M1<=M3] & P12M3<=P2wM2] & [~ [2<=M2] & P2s<=3]] | [[[P1wM1<=1 & M3<=1] & ~ [5<=P3M2]] & [5<=M1 | [4<=P1s & P1s<=P1M1]]]]]] | [1<=P2M2 & 5<=P12s]]]]]
normalized: E [true U [4<=P12wM3 & [4<=P1d & [[1<=P2M2 & 5<=P12s] | [[[[[5<=M1 | [4<=P1s & P1s<=P1M1]] & [~ [5<=P3M2] & [P1wM1<=1 & M3<=1]]] | [[P2s<=3 & ~ [2<=M2]] & [P12M3<=P2wM2 & [P3<=2 & P1M1<=M3]]]] & [[M2<=P1wM1 | [P2wP1<=P3s & [1<=P12wM3 & M3<=P1]]] | [[[1<=P2wP1 & 5<=P12] & [2<=P1M1 & 4<=P2M2]] | [4<=P12wM3 | M3<=2]]]] & [[[[[3<=P2 & 1<=M3] & [P12s<=1 & 2<=P3M2]] & ~ [[M2<=P12M3 & P1M1<=1]]] | [P3M2<=M2 | ~ [[M1<=P2d & 2<=P2M2]]]] & [[P1d<=1 | [~ [P12<=P2s] | ~ [4<=P12M3]]] | ~ [[[M2<=P3M2 & P1wM1<=0] | ~ [3<=P1s]]]]]]]]]]

abstracting: (3<=P1s)
states: 149,856 (5)
abstracting: (P1wM1<=0)
states: 1,614,312 (6)
abstracting: (M2<=P3M2)
states: 2,339,676 (6)
abstracting: (4<=P12M3)
states: 0
abstracting: (P12<=P2s)
states: 2,508,177 (6)
abstracting: (P1d<=1)
states: 2,408,322 (6)
abstracting: (2<=P2M2)
states: 0
abstracting: (M1<=P2d)
states: 528,654 (5)
abstracting: (P3M2<=M2)
states: 1,289,933 (6)
abstracting: (P1M1<=1)
states: 2,441,838 (6)
abstracting: (M2<=P12M3)
states: 1,369,851 (6)
abstracting: (2<=P3M2)
states: 1,378,580 (6)
abstracting: (P12s<=1)
states: 2,792,979 (6)
abstracting: (1<=M3)
states: 2,805,012 (6)
abstracting: (3<=P2)
states: 178,080 (5)
abstracting: (M3<=2)
states: 2,895,018 (6)
abstracting: (4<=P12wM3)
states: 840
abstracting: (4<=P2M2)
states: 0
abstracting: (2<=P1M1)
states: 453,180 (5)
abstracting: (5<=P12)
states: 21
abstracting: (1<=P2wP1)
states: 1,356,810 (6)
abstracting: (M3<=P1)
states: 707,427 (5)
abstracting: (1<=P12wM3)
states: 614,040 (5)
abstracting: (P2wP1<=P3s)
states: 2,336,723 (6)
abstracting: (M2<=P1wM1)
states: 1,804,866 (6)
abstracting: (P1M1<=M3)
states: 2,698,017 (6)
abstracting: (P3<=2)
states: 2,067,870 (6)
abstracting: (P12M3<=P2wM2)
states: 2,519,517 (6)
abstracting: (2<=M2)
states: 0
abstracting: (P2s<=3)
states: 2,853,522 (6)
abstracting: (M3<=1)
states: 602,826 (5)
abstracting: (P1wM1<=1)
states: 2,408,322 (6)
abstracting: (5<=P3M2)
states: 137,858 (5)
abstracting: (P1s<=P1M1)
states: 1,976,436 (6)
abstracting: (4<=P1s)
states: 33,516 (4)
abstracting: (5<=M1)
states: 0
abstracting: (5<=P12s)
states: 21
abstracting: (1<=P2M2)
states: 951,321 (5)
abstracting: (4<=P1d)
states: 33,516 (4)
abstracting: (4<=P12wM3)
states: 840
-> the formula is FALSE

FORMULA FMS-PT-00005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[~ [[~ [[P1wM1<=2 | ~ [P12wM3<=P2wM2]]] & [[[[3<=P3M2 | P12M3<=P12M3] | [P1M1<=P3 | 2<=P3]] & [[5<=P2 & 5<=P12M3] & ~ [2<=P1]]] & ~ [[[1<=P1wP2 | P2d<=3] | [5<=P1s | P3s<=3]]]]]] | [[[[M3<=4 & ~ [[~ [P12s<=4] | [P2<=P1wM1 & M2<=4]]]] | 4<=M2] & [[[~ [[2<=M3 | [4<=P3 | P2<=M3]]] & P2d<=2] & ~ [3<=P1s]] & P1s<=0]] | [[[~ [P2M2<=5] | ~ [[[[4<=P1 & P2M2<=2] | ~ [P1d<=1]] & P2s<=2]]] | P1s<=P2M2] & [~ [[P2d<=P2wM2 | ~ [P2d<=P2]]] & [[[[P12<=P12 & [P2d<=1 | 2<=P12]] | P2wP1<=3] | [P1M1<=5 & [[M3<=2 & 4<=P1wM1] & [P2d<=M3 | P2wP1<=2]]]] | M3<=P2s]]]]]]
normalized: ~ [E [true U ~ [[[[[[M3<=P2s | [[P1M1<=5 & [[P2d<=M3 | P2wP1<=2] & [M3<=2 & 4<=P1wM1]]] | [P2wP1<=3 | [P12<=P12 & [P2d<=1 | 2<=P12]]]]] & ~ [[P2d<=P2wM2 | ~ [P2d<=P2]]]] & [P1s<=P2M2 | [~ [[P2s<=2 & [~ [P1d<=1] | [4<=P1 & P2M2<=2]]]] | ~ [P2M2<=5]]]] | [[P1s<=0 & [~ [3<=P1s] & [P2d<=2 & ~ [[2<=M3 | [4<=P3 | P2<=M3]]]]]] & [4<=M2 | [M3<=4 & ~ [[[P2<=P1wM1 & M2<=4] | ~ [P12s<=4]]]]]]] | ~ [[[~ [[[5<=P1s | P3s<=3] | [1<=P1wP2 | P2d<=3]]] & [[~ [2<=P1] & [5<=P2 & 5<=P12M3]] & [[P1M1<=P3 | 2<=P3] | [3<=P3M2 | P12M3<=P12M3]]]] & ~ [[P1wM1<=2 | ~ [P12wM3<=P2wM2]]]]]]]]]

abstracting: (P12wM3<=P2wM2)
states: 2,508,177 (6)
abstracting: (P1wM1<=2)
states: 2,745,162 (6)
abstracting: (P12M3<=P12M3)
states: 2,895,018 (6)
abstracting: (3<=P3M2)
states: 827,148 (5)
abstracting: (2<=P3)
states: 1,378,580 (6)
abstracting: (P1M1<=P3)
states: 2,407,442 (6)
abstracting: (5<=P12M3)
states: 0
abstracting: (5<=P2)
states: 5,166 (3)
abstracting: (2<=P1)
states: 486,696 (5)
abstracting: (P2d<=3)
states: 2,853,522 (6)
abstracting: (1<=P1wP2)
states: 1,280,706 (6)
abstracting: (P3s<=3)
states: 2,481,444 (6)
abstracting: (5<=P1s)
states: 4,116 (3)
abstracting: (P12s<=4)
states: 2,894,997 (6)
abstracting: (M2<=4)
states: 2,895,018 (6)
abstracting: (P2<=P1wM1)
states: 1,974,378 (6)
abstracting: (M3<=4)
states: 2,895,018 (6)
abstracting: (4<=M2)
states: 0
abstracting: (P2<=M3)
states: 2,628,864 (6)
abstracting: (4<=P3)
states: 413,574 (5)
abstracting: (2<=M3)
states: 2,292,192 (6)
abstracting: (P2d<=2)
states: 2,716,938 (6)
abstracting: (3<=P1s)
states: 149,856 (5)
abstracting: (P1s<=0)
states: 1,614,312 (6)
abstracting: (P2M2<=5)
states: 2,895,018 (6)
abstracting: (P2M2<=2)
states: 2,895,018 (6)
abstracting: (4<=P1)
states: 33,516 (4)
abstracting: (P1d<=1)
states: 2,408,322 (6)
abstracting: (P2s<=2)
states: 2,716,938 (6)
abstracting: (P1s<=P2M2)
states: 1,876,518 (6)
abstracting: (P2d<=P2)
states: 1,943,697 (6)
abstracting: (P2d<=P2wM2)
states: 1,943,697 (6)
abstracting: (2<=P12)
states: 102,039 (5)
abstracting: (P2d<=1)
states: 2,347,779 (6)
abstracting: (P12<=P12)
states: 2,895,018 (6)
abstracting: (P2wP1<=3)
states: 2,853,522 (6)
abstracting: (4<=P1wM1)
states: 33,516 (4)
abstracting: (M3<=2)
states: 2,895,018 (6)
abstracting: (P2wP1<=2)
states: 2,716,938 (6)
abstracting: (P2d<=M3)
states: 2,628,864 (6)
abstracting: (P1M1<=5)
states: 2,895,018 (6)
abstracting: (M3<=P2s)
states: 771,498 (5)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [[[[P1s<=2 & ~ [[4<=P1M1 | P1M1<=M1]]] | [[P3M2<=5 | [[[~ [[2<=M1 & P3<=P1s]] & ~ [[5<=P2 & P12<=P3M2]]] & [P12<=5 | [[P12s<=0 | 2<=P3] & [3<=M3 & P1wM1<=P12M3]]]] & ~ [[[~ [P2wM2<=P1wM1] & P1wP2<=P12wM3] | ~ [3<=P3M2]]]]] | P1M1<=2]] | [[[3<=P3s & P1<=1] & ~ [[~ [M2<=P2wP1] | [[~ [P1d<=P2] | [[4<=M3 | 1<=P2s] | P1M1<=4]] & ~ [[~ [P2s<=P1M1] & ~ [P1s<=P2M2]]]]]]] | [[~ [[~ [[2<=P2M2 | ~ [3<=P12wM3]]] | [[[1<=M3 | 2<=P12s] | [2<=P12s & 4<=P2wP1]] & M3<=0]]] | [[~ [[~ [P2wM2<=2] & ~ [5<=P12wM3]]] | [[~ [4<=P2M2] | ~ [P2<=0]] | ~ [[1<=P2 & P2s<=P1M1]]]] | [~ [[[P1M1<=P2 | P12M3<=5] | 3<=P2s]] & ~ [[[P12M3<=P2wP1 & P12wM3<=P2s] | [P2wM2<=2 & P2s<=P12s]]]]]] | [[P3s<=P1s | [~ [P1M1<=0] & ~ [[P1d<=5 & 3<=M3]]]] & [[[[~ [M3<=3] | [3<=P1s & P3M2<=P3]] & P1wM1<=P1] & P3<=5] & [[[~ [1<=P1] & ~ [P1s<=P12M3]] & 2<=P3M2] & 5<=P2wP1]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[5<=P2wP1 & [2<=P3M2 & [~ [P1s<=P12M3] & ~ [1<=P1]]]] & [P3<=5 & [P1wM1<=P1 & [[3<=P1s & P3M2<=P3] | ~ [M3<=3]]]]] & [P3s<=P1s | [~ [[P1d<=5 & 3<=M3]] & ~ [P1M1<=0]]]] | [[[~ [[[P2wM2<=2 & P2s<=P12s] | [P12M3<=P2wP1 & P12wM3<=P2s]]] & ~ [[3<=P2s | [P1M1<=P2 | P12M3<=5]]]] | [[~ [[1<=P2 & P2s<=P1M1]] | [~ [P2<=0] | ~ [4<=P2M2]]] | ~ [[~ [5<=P12wM3] & ~ [P2wM2<=2]]]]] | ~ [[[M3<=0 & [[2<=P12s & 4<=P2wP1] | [1<=M3 | 2<=P12s]]] | ~ [[2<=P2M2 | ~ [3<=P12wM3]]]]]]] | [~ [[[~ [[~ [P1s<=P2M2] & ~ [P2s<=P1M1]]] & [[P1M1<=4 | [4<=M3 | 1<=P2s]] | ~ [P1d<=P2]]] | ~ [M2<=P2wP1]]] & [3<=P3s & P1<=1]]] | [[P1M1<=2 | [P3M2<=5 | [~ [[~ [3<=P3M2] | [P1wP2<=P12wM3 & ~ [P2wM2<=P1wM1]]]] & [[P12<=5 | [[3<=M3 & P1wM1<=P12M3] & [P12s<=0 | 2<=P3]]] & [~ [[5<=P2 & P12<=P3M2]] & ~ [[2<=M1 & P3<=P1s]]]]]]] | [P1s<=2 & ~ [[4<=P1M1 | P1M1<=M1]]]]]]]]

abstracting: (P1M1<=M1)
states: 2,441,838 (6)
abstracting: (4<=P1M1)
states: 0
abstracting: (P1s<=2)
states: 2,745,162 (6)
abstracting: (P3<=P1s)
states: 1,249,578 (6)
abstracting: (2<=M1)
states: 2,441,838 (6)
abstracting: (P12<=P3M2)
states: 2,692,865 (6)
abstracting: (5<=P2)
states: 5,166 (3)
abstracting: (2<=P3)
states: 1,378,580 (6)
abstracting: (P12s<=0)
states: 2,280,978 (6)
abstracting: (P1wM1<=P12M3)
states: 1,781,913 (6)
abstracting: (3<=M3)
states: 0
abstracting: (P12<=5)
states: 2,895,018 (6)
abstracting: (P2wM2<=P1wM1)
states: 1,974,378 (6)
abstracting: (P1wP2<=P12wM3)
states: 1,784,811 (6)
abstracting: (3<=P3M2)
states: 827,148 (5)
abstracting: (P3M2<=5)
states: 2,895,018 (6)
abstracting: (P1M1<=2)
states: 2,778,678 (6)
abstracting: (P1<=1)
states: 2,408,322 (6)
abstracting: (3<=P3s)
states: 827,148 (5)
abstracting: (M2<=P2wP1)
states: 1,902,642 (6)
abstracting: (P1d<=P2)
states: 2,067,492 (6)
abstracting: (1<=P2s)
states: 1,356,810 (6)
abstracting: (4<=M3)
states: 0
abstracting: (P1M1<=4)
states: 2,895,018 (6)
abstracting: (P2s<=P1M1)
states: 1,958,208 (6)
abstracting: (P1s<=P2M2)
states: 1,876,518 (6)
abstracting: (3<=P12wM3)
states: 12,054 (4)
abstracting: (2<=P2M2)
states: 0
abstracting: (2<=P12s)
states: 102,039 (5)
abstracting: (1<=M3)
states: 2,805,012 (6)
abstracting: (4<=P2wP1)
states: 41,496 (4)
abstracting: (2<=P12s)
states: 102,039 (5)
abstracting: (M3<=0)
states: 90,006 (4)
abstracting: (P2wM2<=2)
states: 2,716,938 (6)
abstracting: (5<=P12wM3)
states: 21
abstracting: (4<=P2M2)
states: 0
abstracting: (P2<=0)
states: 1,538,208 (6)
abstracting: (P2s<=P1M1)
states: 1,958,208 (6)
abstracting: (1<=P2)
states: 1,356,810 (6)
abstracting: (P12M3<=5)
states: 2,895,018 (6)
abstracting: (P1M1<=P2)
states: 2,098,362 (6)
abstracting: (3<=P2s)
states: 178,080 (5)
abstracting: (P12wM3<=P2s)
states: 2,508,177 (6)
abstracting: (P12M3<=P2wP1)
states: 2,519,517 (6)
abstracting: (P2s<=P12s)
states: 1,714,902 (6)
abstracting: (P2wM2<=2)
states: 2,716,938 (6)
abstracting: (P1M1<=0)
states: 1,643,712 (6)
abstracting: (3<=M3)
states: 0
abstracting: (P1d<=5)
states: 2,895,018 (6)
abstracting: (P3s<=P1s)
states: 1,249,578 (6)
abstracting: (M3<=3)
states: 2,895,018 (6)
abstracting: (P3M2<=P3)
states: 1,654,296 (6)
abstracting: (3<=P1s)
states: 149,856 (5)
abstracting: (P1wM1<=P1)
states: 1,980,552 (6)
abstracting: (P3<=5)
states: 2,895,018 (6)
abstracting: (1<=P1)
states: 1,280,706 (6)
abstracting: (P1s<=P12M3)
states: 1,781,913 (6)
abstracting: (2<=P3M2)
states: 1,378,580 (6)
abstracting: (5<=P2wP1)
states: 5,166 (3)
-> the formula is TRUE

FORMULA FMS-PT-00005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

totally nodes used: 124255 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 174329 138570 312899
used/not used/entry size/cache size: 160803 66948061 16 1024MB
basic ops cache: hits/miss/sum: 339708 285102 624810
used/not used/entry size/cache size: 497117 16280099 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: 82532 56094 138626
used/not used/entry size/cache size: 56022 8332586 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 66990102
1 115419
2 2803
3 240
4 78
5 53
6 47
7 45
8 11
9 9
>= 10 57

Total processing time: 0m 4.542sec


BK_STOP 1678493934051

--------------------
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:405 (20), effective:85 (4)

initing FirstDep: 0m 0.000sec


iterations count:304 (15), effective:56 (2)

iterations count:375 (18), effective:70 (3)

iterations count:148 (7), effective:28 (1)

iterations count:297 (14), effective:69 (3)

iterations count:206 (10), effective:37 (1)

iterations count:341 (17), effective:71 (3)

iterations count:410 (20), effective:101 (5)

iterations count:127 (6), effective:30 (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="FMS-PT-00005"
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 FMS-PT-00005, 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 r170-tall-167838856900198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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