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.r490-tall-167912708600430.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 Szymanski-PT-a08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a08-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-a08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679255039785

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=Szymanski-PT-a08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:44:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:44:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:44:01] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-19 19:44:01] [INFO ] Transformed 61 places.
[2023-03-19 19:44:01] [INFO ] Transformed 224 transitions.
[2023-03-19 19:44:01] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a08-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 17 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 13) seen :8
FORMULA Szymanski-PT-a08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a08-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :1
FORMULA Szymanski-PT-a08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 19:44:01] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:44:01] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 19:44:01] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 19:44:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:44:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:44:01] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA Szymanski-PT-a08-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a08-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a08-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a08-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 850 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: Szymanski_PT_a08
(NrP: 61 NrTr: 224 NrArc: 900)

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

net check time: 0m 0.000sec

init dd package: 0m 2.701sec


RS generation: 0m 6.426sec


-> reachability set: #nodes 6763 (6.8e+03) #states 3,955,934,872,799 (12)



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

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

abstracting: (l12<=8)
states: 3,955,934,872,799 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (4<=l41)
states: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (l38<=6)
states: 3,955,899,516,896 (12)
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.423sec

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

abstracting: (5<=p14)
states: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [8<=p15]
normalized: E [true U 8<=p15]

abstracting: (8<=p15)
states: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (l23<=8)
states: 3,955,934,872,799 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[l14<=p15 & ~ [l8<=l23]] | [[[s8<=5 | l26<=p13] & ~ [6<=p14]] & l34<=8]]]]
normalized: E [true U ~ [[[l34<=8 & [~ [6<=p14] & [s8<=5 | l26<=p13]]] | [l14<=p15 & ~ [l8<=l23]]]]]

abstracting: (l8<=l23)
states: 3,009,084,137,007 (12)
abstracting: (l14<=p15)
states: 2,719,579,903,615 (12)
abstracting: (l26<=p13)
states: 2,769,915,460,895 (12)
abstracting: (s8<=5)
states: 3,955,934,872,799 (12)
abstracting: (6<=p14)
states: 0
abstracting: (l34<=8)
states: 3,955,934,872,799 (12)
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [[s0<=3 & ~ [[s5<=6 & [[~ [[~ [3<=l26] & [[7<=s9 & l21<=l9] & [8<=l37 | l32<=8]]]] | ~ [p10<=6]] & l37<=6]]]]]
normalized: E [true U [s0<=3 & ~ [[s5<=6 & [l37<=6 & [~ [p10<=6] | ~ [[[[8<=l37 | l32<=8] & [7<=s9 & l21<=l9]] & ~ [3<=l26]]]]]]]]]

abstracting: (3<=l26)
states: 77,723,151,666 (10)
abstracting: (l21<=l9)
states: 3,955,934,872,799 (12)
abstracting: (7<=s9)
states: 0
abstracting: (l32<=8)
states: 3,955,934,872,799 (12)
abstracting: (8<=l37)
states: 1,716,099 (6)
abstracting: (p10<=6)
states: 3,955,934,872,799 (12)
abstracting: (l37<=6)
states: 3,955,899,516,896 (12)
abstracting: (s5<=6)
states: 3,955,934,872,799 (12)
abstracting: (s0<=3)
states: 3,955,934,872,799 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.370sec

checking: AG [[[l3<=1 & [~ [5<=p14] & [[8<=l4 | ~ [[3<=l24 | s3<=0]]] | p13<=0]]] | ~ [[[~ [8<=l9] | [[[[[l18<=6 & 4<=l31] | l27<=5] | [~ [l28<=5] & 4<=p12]] | [l15<=8 | [[l29<=l21 | l27<=l30] & [l23<=l39 & l28<=8]]]] | [[[~ [3<=l43] & l42<=7] | ~ [l6<=3]] & [~ [l40<=s3] & 6<=l2]]]] & ~ [l28<=p11]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [l28<=p11] & [[[[6<=l2 & ~ [l40<=s3]] & [~ [l6<=3] | [l42<=7 & ~ [3<=l43]]]] | [[l15<=8 | [[l23<=l39 & l28<=8] & [l29<=l21 | l27<=l30]]] | [[4<=p12 & ~ [l28<=5]] | [l27<=5 | [l18<=6 & 4<=l31]]]]] | ~ [8<=l9]]]] | [l3<=1 & [[p13<=0 | [8<=l4 | ~ [[3<=l24 | s3<=0]]]] & ~ [5<=p14]]]]]]]

abstracting: (5<=p14)
states: 0
abstracting: (s3<=0)
states: 3,724,011,053,581 (12)
abstracting: (3<=l24)
states: 77,723,151,666 (10)
abstracting: (8<=l4)
states: 3,201,460 (6)
abstracting: (p13<=0)
states: 3,955,934,872,799 (12)
abstracting: (l3<=1)
states: 3,905,672,028,770 (12)
abstracting: (8<=l9)
states: 2,509,253 (6)
abstracting: (4<=l31)
states: 16,207,040,508 (10)
abstracting: (l18<=6)
states: 3,955,885,884,685 (12)
abstracting: (l27<=5)
states: 3,955,556,413,376 (12)
abstracting: (l28<=5)
states: 3,955,556,413,376 (12)
abstracting: (4<=p12)
states: 0
abstracting: (l27<=l30)
states: 3,028,084,629,047 (12)
abstracting: (l29<=l21)
states: 2,769,915,460,895 (12)
abstracting: (l28<=8)
states: 3,955,934,872,799 (12)
abstracting: (l23<=l39)
states: 3,028,088,822,377 (12)
abstracting: (l15<=8)
states: 3,955,934,872,799 (12)
abstracting: (3<=l43)
states: 0
abstracting: (l42<=7)
states: 3,955,934,872,799 (12)
abstracting: (l6<=3)
states: 3,936,611,990,071 (12)
abstracting: (l40<=s3)
states: 2,818,853,272,597 (12)
abstracting: (6<=l2)
states: 116,629 (5)
abstracting: (l28<=p11)
states: 2,769,915,460,895 (12)
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.212sec

checking: EF [~ [[[~ [[~ [6<=l2] | [[2<=l23 & l14<=p13] & [l5<=p11 & 8<=l5]]]] | [~ [[~ [s6<=p12] & [~ [5<=l25] | [p15<=l30 & l13<=l8]]]] & [[[l9<=6 & [7<=l7 | l10<=p12]] & p15<=6] | 2<=s4]]] | [[~ [l36<=l27] & l18<=4] | ~ [[[5<=l20 & [~ [l39<=s9] | 4<=p15]] | ~ [[[2<=l41 & 2<=l25] | l25<=7]]]]]]]]
normalized: E [true U ~ [[[~ [[[[2<=l23 & l14<=p13] & [l5<=p11 & 8<=l5]] | ~ [6<=l2]]] | [~ [[[[p15<=l30 & l13<=l8] | ~ [5<=l25]] & ~ [s6<=p12]]] & [2<=s4 | [p15<=6 & [l9<=6 & [7<=l7 | l10<=p12]]]]]] | [[l18<=4 & ~ [l36<=l27]] | ~ [[[5<=l20 & [4<=p15 | ~ [l39<=s9]]] | ~ [[l25<=7 | [2<=l41 & 2<=l25]]]]]]]]]

abstracting: (2<=l25)
states: 322,146,612,954 (11)
abstracting: (2<=l41)
states: 0
abstracting: (l25<=7)
states: 3,955,933,156,700 (12)
abstracting: (l39<=s9)
states: 2,769,915,460,895 (12)
abstracting: (4<=p15)
states: 0
abstracting: (5<=l20)
states: 3,510,953,243 (9)
abstracting: (l36<=l27)
states: 3,028,084,629,047 (12)
abstracting: (l18<=4)
states: 3,952,423,919,556 (12)
abstracting: (l10<=p12)
states: 2,719,579,903,615 (12)
abstracting: (7<=l7)
states: 48,988,114 (7)
abstracting: (l9<=6)
states: 3,955,885,884,685 (12)
abstracting: (p15<=6)
states: 3,955,934,872,799 (12)
abstracting: (2<=s4)
states: 0
abstracting: (s6<=p12)
states: 3,834,978,414,215 (12)
abstracting: (5<=l25)
states: 2,806,153,263 (9)
abstracting: (l13<=l8)
states: 2,997,993,837,675 (12)
abstracting: (p15<=l30)
states: 3,955,934,872,799 (12)
abstracting: (6<=l2)
states: 116,629 (5)
abstracting: (8<=l5)
states: 2,509,253 (6)
abstracting: (l5<=p11)
states: 2,719,579,903,615 (12)
abstracting: (l14<=p13)
states: 2,719,579,903,615 (12)
abstracting: (2<=l23)
states: 322,142,421,553 (11)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.587sec

checking: EF [[[[[[[~ [2<=l14] | 2<=l3] | s2<=8] & [[[[~ [4<=p10] | l19<=1] | [l32<=l11 & l16<=l28]] & 3<=l11] & [l15<=1 | [[~ [l0<=8] & ~ [s4<=s1]] & [[l34<=3 & 6<=l24] & [l5<=5 & s7<=l35]]]]]] & [l8<=0 | ~ [[[[~ [6<=p10] | ~ [l27<=1]] | ~ [[8<=l29 | l36<=7]]] | [~ [p15<=4] | [l32<=p14 & [3<=s1 & l19<=l39]]]]]]] & l36<=8] & ~ [8<=s0]]]
normalized: E [true U [~ [8<=s0] & [l36<=8 & [[l8<=0 | ~ [[[[l32<=p14 & [3<=s1 & l19<=l39]] | ~ [p15<=4]] | [~ [[8<=l29 | l36<=7]] | [~ [l27<=1] | ~ [6<=p10]]]]]] & [[[l15<=1 | [[[l5<=5 & s7<=l35] & [l34<=3 & 6<=l24]] & [~ [s4<=s1] & ~ [l0<=8]]]] & [3<=l11 & [[l32<=l11 & l16<=l28] | [l19<=1 | ~ [4<=p10]]]]] & [s2<=8 | [2<=l3 | ~ [2<=l14]]]]]]]]

abstracting: (2<=l14)
states: 350,611,139,480 (11)
abstracting: (2<=l3)
states: 50,262,844,029 (10)
abstracting: (s2<=8)
states: 3,955,934,872,799 (12)
abstracting: (4<=p10)
states: 0
abstracting: (l19<=1)
states: 3,605,323,733,319 (12)
abstracting: (l16<=l28)
states: 3,009,085,326,107 (12)
abstracting: (l32<=l11)
states: 3,064,248,699,187 (12)
abstracting: (3<=l11)
states: 88,460,486,877 (10)
abstracting: (l0<=8)
states: 3,955,934,872,799 (12)
abstracting: (s4<=s1)
states: 3,936,621,432,991 (12)
abstracting: (6<=l24)
states: 378,459,423 (8)
abstracting: (l34<=3)
states: 3,939,727,832,291 (12)
abstracting: (s7<=l35)
states: 3,941,497,331,709 (12)
abstracting: (l5<=5)
states: 3,955,437,041,966 (12)
abstracting: (l15<=1)
states: 3,605,323,733,319 (12)
abstracting: (6<=p10)
states: 0
abstracting: (l27<=1)
states: 3,633,788,259,845 (12)
abstracting: (l36<=7)
states: 3,955,933,156,700 (12)
abstracting: (8<=l29)
states: 1,716,099 (6)
abstracting: (p15<=4)
states: 3,955,934,872,799 (12)
abstracting: (l19<=l39)
states: 3,009,085,326,107 (12)
abstracting: (3<=s1)
states: 0
abstracting: (l32<=p14)
states: 2,769,915,460,895 (12)
abstracting: (l8<=0)
states: 2,719,579,903,615 (12)
abstracting: (l36<=8)
states: 3,955,934,872,799 (12)
abstracting: (8<=s0)
states: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.723sec

checking: EF [[[[[l31<=l35 | l6<=8] | [[[[~ [l21<=6] & ~ [l13<=l25]] | [[[s5<=s1 & 3<=s7] & [6<=p16 & l29<=4]] & [~ [1<=l38] & [l28<=4 & s8<=6]]]] & s4<=p16] & [l11<=l35 & ~ [[l42<=3 & [l43<=6 | [p14<=1 & l23<=l14]]]]]]] | [~ [[~ [[[2<=l32 | l35<=8] | [p11<=3 | 3<=l37]]] | ~ [[~ [1<=l5] | l28<=7]]]] & l14<=4]] & ~ [[[5<=s2 | [5<=l20 | l7<=2]] | ~ [[p11<=p10 & s8<=8]]]]]]
normalized: E [true U [~ [[~ [[p11<=p10 & s8<=8]] | [5<=s2 | [5<=l20 | l7<=2]]]] & [[l14<=4 & ~ [[~ [[l28<=7 | ~ [1<=l5]]] | ~ [[[p11<=3 | 3<=l37] | [2<=l32 | l35<=8]]]]]] | [[[l11<=l35 & ~ [[l42<=3 & [l43<=6 | [p14<=1 & l23<=l14]]]]] & [s4<=p16 & [[[[l28<=4 & s8<=6] & ~ [1<=l38]] & [[6<=p16 & l29<=4] & [s5<=s1 & 3<=s7]]] | [~ [l13<=l25] & ~ [l21<=6]]]]] | [l31<=l35 | l6<=8]]]]]

abstracting: (l6<=8)
states: 3,955,934,872,799 (12)
abstracting: (l31<=l35)
states: 3,028,084,629,047 (12)
abstracting: (l21<=6)
states: 3,955,934,872,799 (12)
abstracting: (l13<=l25)
states: 3,009,085,326,107 (12)
abstracting: (3<=s7)
states: 0
abstracting: (s5<=s1)
states: 3,834,979,072,015 (12)
abstracting: (l29<=4)
states: 3,953,128,719,536 (12)
abstracting: (6<=p16)
states: 0
abstracting: (1<=l38)
states: 1,186,019,411,904 (12)
abstracting: (s8<=6)
states: 3,955,934,872,799 (12)
abstracting: (l28<=4)
states: 3,953,128,719,536 (12)
abstracting: (s4<=p16)
states: 3,936,621,432,991 (12)
abstracting: (l23<=l14)
states: 3,064,252,892,173 (12)
abstracting: (p14<=1)
states: 3,955,934,872,799 (12)
abstracting: (l43<=6)
states: 3,955,934,872,799 (12)
abstracting: (l42<=3)
states: 3,955,934,872,799 (12)
abstracting: (l11<=l35)
states: 3,009,085,326,107 (12)
abstracting: (l35<=8)
states: 3,955,934,872,799 (12)
abstracting: (2<=l32)
states: 322,146,612,954 (11)
abstracting: (3<=l37)
states: 77,723,151,666 (10)
abstracting: (p11<=3)
states: 3,955,934,872,799 (12)
abstracting: (1<=l5)
states: 1,236,354,969,184 (12)
abstracting: (l28<=7)
states: 3,955,933,156,700 (12)
abstracting: (l14<=4)
states: 3,952,423,919,556 (12)
abstracting: (l7<=2)
states: 3,867,474,385,922 (12)
abstracting: (5<=l20)
states: 3,510,953,243 (9)
abstracting: (5<=s2)
states: 0
abstracting: (s8<=8)
states: 3,955,934,872,799 (12)
abstracting: (p11<=p10)
states: 3,955,934,872,799 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.889sec

checking: EF [[~ [l12<=6] & [l7<=l35 & [[p10<=2 | [[[[[l27<=l43 | 5<=l1] & [l35<=2 | 6<=l39]] & [~ [4<=l33] & 4<=l22]] & [[~ [1<=p10] | [l1<=5 | 4<=l0]] & [p16<=l10 & [l28<=1 & 5<=l20]]]] & [~ [[[1<=l19 & l43<=5] & 8<=s5]] & 6<=l25]]] | [[~ [6<=l18] | [[l37<=p13 | [[s4<=7 | l7<=2] | ~ [7<=l17]]] | l15<=s6]] & [s1<=4 | [~ [[[l35<=6 & s1<=l23] & ~ [2<=l39]]] | s2<=p10]]]]]]]
normalized: E [true U [[l7<=l35 & [[p10<=2 | [[[[[l1<=5 | 4<=l0] | ~ [1<=p10]] & [p16<=l10 & [l28<=1 & 5<=l20]]] & [[4<=l22 & ~ [4<=l33]] & [[l35<=2 | 6<=l39] & [l27<=l43 | 5<=l1]]]] & [6<=l25 & ~ [[8<=s5 & [1<=l19 & l43<=5]]]]]] | [[[l15<=s6 | [l37<=p13 | [~ [7<=l17] | [s4<=7 | l7<=2]]]] | ~ [6<=l18]] & [s1<=4 | [s2<=p10 | ~ [[[l35<=6 & s1<=l23] & ~ [2<=l39]]]]]]]] & ~ [l12<=6]]]

abstracting: (l12<=6)
states: 3,955,885,884,685 (12)
abstracting: (2<=l39)
states: 322,146,612,954 (11)
abstracting: (s1<=l23)
states: 3,109,780,654,805 (12)
abstracting: (l35<=6)
states: 3,955,899,516,896 (12)
abstracting: (s2<=p10)
states: 2,733,952,554,321 (12)
abstracting: (s1<=4)
states: 3,955,934,872,799 (12)
abstracting: (6<=l18)
states: 497,830,833 (8)
abstracting: (l7<=2)
states: 3,867,474,385,922 (12)
abstracting: (s4<=7)
states: 3,955,934,872,799 (12)
abstracting: (7<=l17)
states: 48,988,114 (7)
abstracting: (l37<=p13)
states: 2,769,915,460,895 (12)
abstracting: (l15<=s6)
states: 2,745,745,182,391 (12)
abstracting: (l43<=5)
states: 3,955,934,872,799 (12)
abstracting: (1<=l19)
states: 1,236,354,969,184 (12)
abstracting: (8<=s5)
states: 0
abstracting: (6<=l25)
states: 378,459,423 (8)
abstracting: (5<=l1)
states: 5,318,769 (6)
abstracting: (l27<=l43)
states: 2,935,797,052,745 (12)
abstracting: (6<=l39)
states: 378,459,423 (8)
abstracting: (l35<=2)
states: 3,878,211,721,133 (12)
abstracting: (4<=l33)
states: 16,207,040,508 (10)
abstracting: (4<=l22)
states: 0
abstracting: (5<=l20)
states: 3,510,953,243 (9)
abstracting: (l28<=1)
states: 3,633,788,259,845 (12)
abstracting: (p16<=l10)
states: 3,423,611,420,039 (12)
abstracting: (1<=p10)
states: 0
abstracting: (4<=l0)
states: 87,423,102 (7)
abstracting: (l1<=5)
states: 3,955,934,756,630 (12)
abstracting: (p10<=2)
states: 3,955,934,872,799 (12)
abstracting: (l7<=l35)
states: 3,009,085,326,107 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.347sec

checking: EF [[[[[~ [[~ [[s4<=p13 & ~ [s0<=0]]] & ~ [s6<=6]]] | [8<=s6 & l35<=l4]] & ~ [[4<=l22 | l8<=4]]] & [[~ [[l17<=l10 | ~ [[l27<=2 & [l8<=p15 | l31<=2]]]]] | l6<=3] | [[[[[~ [5<=s2] | l14<=l36] & [~ [p15<=l23] & [l11<=4 & l27<=6]]] | l36<=l12] & ~ [l4<=l22]] & [5<=l26 & ~ [[[~ [l3<=l6] & [s3<=l15 | s2<=5]] | ~ [l17<=4]]]]]]] & [[3<=l18 | ~ [[8<=l1 & l31<=s4]]] | l2<=l11]]]
normalized: E [true U [[l2<=l11 | [3<=l18 | ~ [[8<=l1 & l31<=s4]]]] & [[[[5<=l26 & ~ [[~ [l17<=4] | [[s3<=l15 | s2<=5] & ~ [l3<=l6]]]]] & [~ [l4<=l22] & [l36<=l12 | [[[l11<=4 & l27<=6] & ~ [p15<=l23]] & [l14<=l36 | ~ [5<=s2]]]]]] | [l6<=3 | ~ [[l17<=l10 | ~ [[l27<=2 & [l8<=p15 | l31<=2]]]]]]] & [~ [[4<=l22 | l8<=4]] & [[8<=s6 & l35<=l4] | ~ [[~ [s6<=6] & ~ [[s4<=p13 & ~ [s0<=0]]]]]]]]]]

abstracting: (s0<=0)
states: 3,724,010,395,780 (12)
abstracting: (s4<=p13)
states: 3,936,621,432,991 (12)
abstracting: (s6<=6)
states: 3,955,934,872,799 (12)
abstracting: (l35<=l4)
states: 3,109,245,956,243 (12)
abstracting: (8<=s6)
states: 0
abstracting: (l8<=4)
states: 3,952,423,919,556 (12)
abstracting: (4<=l22)
states: 0
abstracting: (l31<=2)
states: 3,878,211,721,133 (12)
abstracting: (l8<=p15)
states: 2,719,579,903,615 (12)
abstracting: (l27<=2)
states: 3,878,211,721,133 (12)
abstracting: (l17<=l10)
states: 2,997,993,837,675 (12)
abstracting: (l6<=3)
states: 3,936,611,990,071 (12)
abstracting: (5<=s2)
states: 0
abstracting: (l14<=l36)
states: 3,009,085,326,107 (12)
abstracting: (p15<=l23)
states: 3,955,934,872,799 (12)
abstracting: (l27<=6)
states: 3,955,899,516,896 (12)
abstracting: (l11<=4)
states: 3,952,423,919,556 (12)
abstracting: (l36<=l12)
states: 3,064,248,699,187 (12)
abstracting: (l4<=l22)
states: 2,520,117,341,647 (12)
abstracting: (l3<=l6)
states: 3,496,713,047,797 (12)
abstracting: (s2<=5)
states: 3,955,934,872,799 (12)
abstracting: (s3<=l15)
states: 3,792,262,127,991 (12)
abstracting: (l17<=4)
states: 3,952,423,919,556 (12)
abstracting: (5<=l26)
states: 2,806,153,263 (9)
abstracting: (l31<=s4)
states: 2,773,721,893,053 (12)
abstracting: (8<=l1)
states: 2
abstracting: (3<=l18)
states: 88,460,486,877 (10)
abstracting: (l2<=l11)
states: 3,524,591,745,381 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.414sec

checking: EF [~ [[[[~ [[l28<=l38 | [~ [2<=l30] & ~ [[2<=l2 | l30<=l7]]]]] | [[[~ [l27<=1] & [[7<=l11 | 1<=l28] | ~ [l41<=3]]] & [[s9<=7 | [p16<=l28 & l24<=l13]] & [[1<=l12 | 1<=l22] | [s9<=1 | l21<=s6]]]] | ~ [l6<=4]]] & [[l31<=l19 & [[[[7<=l11 | l1<=8] | [l26<=2 & l41<=l43]] & 8<=l39] & [[[l10<=3 | l3<=6] & [l10<=8 | s1<=l6]] | l21<=8]]] | 7<=l20]] | [[~ [s0<=l27] | l14<=8] | [~ [[l14<=l16 | l6<=0]] & l22<=l18]]]]]
normalized: E [true U ~ [[[[l22<=l18 & ~ [[l14<=l16 | l6<=0]]] | [l14<=8 | ~ [s0<=l27]]] | [[7<=l20 | [l31<=l19 & [[l21<=8 | [[l10<=8 | s1<=l6] & [l10<=3 | l3<=6]]] & [8<=l39 & [[l26<=2 & l41<=l43] | [7<=l11 | l1<=8]]]]]] & [[~ [l6<=4] | [[[[s9<=1 | l21<=s6] | [1<=l12 | 1<=l22]] & [s9<=7 | [p16<=l28 & l24<=l13]]] & [[~ [l41<=3] | [7<=l11 | 1<=l28]] & ~ [l27<=1]]]] | ~ [[l28<=l38 | [~ [[2<=l2 | l30<=l7]] & ~ [2<=l30]]]]]]]]]

abstracting: (2<=l30)
states: 322,146,612,954 (11)
abstracting: (l30<=l7)
states: 3,064,248,699,187 (12)
abstracting: (2<=l2)
states: 47,744,289,918 (10)
abstracting: (l28<=l38)
states: 3,028,084,629,047 (12)
abstracting: (l27<=1)
states: 3,633,788,259,845 (12)
abstracting: (1<=l28)
states: 1,186,019,411,904 (12)
abstracting: (7<=l11)
states: 48,988,114 (7)
abstracting: (l41<=3)
states: 3,955,934,872,799 (12)
abstracting: (l24<=l13)
states: 3,064,248,699,187 (12)
abstracting: (p16<=l28)
states: 3,414,333,114,555 (12)
abstracting: (s9<=7)
states: 3,955,934,872,799 (12)
abstracting: (1<=l22)
states: 0
abstracting: (1<=l12)
states: 1,236,354,969,184 (12)
abstracting: (l21<=s6)
states: 3,955,934,872,799 (12)
abstracting: (s9<=1)
states: 3,955,934,872,799 (12)
abstracting: (l6<=4)
states: 3,952,423,919,556 (12)
abstracting: (l1<=8)
states: 3,955,934,872,799 (12)
abstracting: (7<=l11)
states: 48,988,114 (7)
abstracting: (l41<=l43)
states: 3,955,934,872,799 (12)
abstracting: (l26<=2)
states: 3,878,211,721,133 (12)
abstracting: (8<=l39)
states: 1,716,099 (6)
abstracting: (l3<=6)
states: 3,955,934,871,559 (12)
abstracting: (l10<=3)
states: 3,936,611,990,071 (12)
abstracting: (s1<=l6)
states: 3,125,711,694,651 (12)
abstracting: (l10<=8)
states: 3,955,934,872,799 (12)
abstracting: (l21<=8)
states: 3,955,934,872,799 (12)
abstracting: (l31<=l19)
states: 3,064,248,699,187 (12)
abstracting: (7<=l20)
states: 48,988,114 (7)
abstracting: (s0<=l27)
states: 3,789,382,952,484 (12)
abstracting: (l14<=8)
states: 3,955,934,872,799 (12)
abstracting: (l6<=0)
states: 2,719,579,903,615 (12)
abstracting: (l14<=l16)
states: 2,997,993,837,675 (12)
abstracting: (l22<=l18)
states: 3,955,934,872,799 (12)
-> the formula is FALSE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.177sec

checking: EF [[[[[~ [[[[1<=l15 & l20<=4] & ~ [l38<=s7]] | ~ [l22<=l27]]] & [7<=l37 & [~ [[~ [l11<=l37] & l1<=2]] & ~ [l40<=p16]]]] & [[~ [6<=l5] & [6<=l24 | l24<=l23]] | [~ [[~ [[l20<=l40 | l29<=4]] | [[p13<=8 & l18<=s7] | [1<=l13 & l40<=l11]]]] & s5<=l23]]] | ~ [p13<=l29]] & [l34<=7 | [[s6<=l34 | ~ [[[[[l18<=8 | p15<=l6] | ~ [6<=l14]] | [[l11<=4 & 2<=l4] & [l23<=3 & s6<=s1]]] & [[[s3<=l42 | 1<=l24] | [5<=l19 & 3<=s6]] & [[8<=l11 & l27<=s0] | [6<=s2 & s1<=6]]]]]] & 7<=l42]]]]
normalized: E [true U [[l34<=7 | [7<=l42 & [s6<=l34 | ~ [[[[[6<=s2 & s1<=6] | [8<=l11 & l27<=s0]] & [[5<=l19 & 3<=s6] | [s3<=l42 | 1<=l24]]] & [[[l23<=3 & s6<=s1] & [l11<=4 & 2<=l4]] | [~ [6<=l14] | [l18<=8 | p15<=l6]]]]]]]] & [~ [p13<=l29] | [[[s5<=l23 & ~ [[[[1<=l13 & l40<=l11] | [p13<=8 & l18<=s7]] | ~ [[l20<=l40 | l29<=4]]]]] | [[6<=l24 | l24<=l23] & ~ [6<=l5]]] & [[7<=l37 & [~ [l40<=p16] & ~ [[l1<=2 & ~ [l11<=l37]]]]] & ~ [[~ [l22<=l27] | [~ [l38<=s7] & [1<=l15 & l20<=4]]]]]]]]]

abstracting: (l20<=4)
states: 3,952,423,919,556 (12)
abstracting: (1<=l15)
states: 1,236,354,969,184 (12)
abstracting: (l38<=s7)
states: 2,773,721,893,053 (12)
abstracting: (l22<=l27)
states: 3,955,934,872,799 (12)
abstracting: (l11<=l37)
states: 3,009,085,326,107 (12)
abstracting: (l1<=2)
states: 3,952,848,294,859 (12)
abstracting: (l40<=p16)
states: 2,935,797,052,745 (12)
abstracting: (7<=l37)
states: 35,355,903 (7)
abstracting: (6<=l5)
states: 497,830,833 (8)
abstracting: (l24<=l23)
states: 3,028,084,629,047 (12)
abstracting: (6<=l24)
states: 378,459,423 (8)
abstracting: (l29<=4)
states: 3,953,128,719,536 (12)
abstracting: (l20<=l40)
states: 3,009,085,326,107 (12)
abstracting: (l18<=s7)
states: 2,723,507,458,176 (12)
abstracting: (p13<=8)
states: 3,955,934,872,799 (12)
abstracting: (l40<=l11)
states: 3,064,248,699,187 (12)
abstracting: (1<=l13)
states: 1,236,354,969,184 (12)
abstracting: (s5<=l23)
states: 3,868,920,021,665 (12)
abstracting: (p13<=l29)
states: 3,955,934,872,799 (12)
abstracting: (p15<=l6)
states: 3,955,934,872,799 (12)
abstracting: (l18<=8)
states: 3,955,934,872,799 (12)
abstracting: (6<=l14)
states: 497,830,833 (8)
abstracting: (2<=l4)
states: 410,796,705,207 (11)
abstracting: (l11<=4)
states: 3,952,423,919,556 (12)
abstracting: (s6<=s1)
states: 3,834,978,414,215 (12)
abstracting: (l23<=3)
states: 3,939,731,950,541 (12)
abstracting: (1<=l24)
states: 1,186,019,411,904 (12)
abstracting: (s3<=l42)
states: 3,724,011,053,581 (12)
abstracting: (3<=s6)
states: 0
abstracting: (5<=l19)
states: 3,510,953,243 (9)
abstracting: (l27<=s0)
states: 2,818,853,272,597 (12)
abstracting: (8<=l11)
states: 2,509,253 (6)
abstracting: (s1<=6)
states: 3,955,934,872,799 (12)
abstracting: (6<=s2)
states: 0
abstracting: (s6<=l34)
states: 3,868,920,021,629 (12)
abstracting: (7<=l42)
states: 0
abstracting: (l34<=7)
states: 3,955,933,156,700 (12)
-> the formula is TRUE

FORMULA Szymanski-PT-a08-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.074sec

totally nodes used: 6398361 (6.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 285660747 90317395 375978142
used/not used/entry size/cache size: 49645427 17463437 16 1024MB
basic ops cache: hits/miss/sum: 22774477 6977195 29751672
used/not used/entry size/cache size: 8577273 8199943 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: 887291 277840 1165131
used/not used/entry size/cache size: 273488 8115120 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 61202439
1 5561906
2 302946
3 23044
4 6716
5 3495
6 2334
7 1039
8 698
9 612
>= 10 3635

Total processing time: 0m40.625sec


BK_STOP 1679255091603

--------------------
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
found
The net has a maximal unmarked siphon:
l41
l42
p14
p15
p11
p13
p12
s8
p10
s9
l21
l22

The net has transition(s) that can never fire:
t28
t53
t215
t136
t161
t190
t82
t107

check for constant places
s8
s9
p10
p11
p12
p13
p14
p15
found 8 constant places
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

4865 10220 8273 6543
iterations count:423545 (1890), effective:11673 (52)

initing FirstDep: 0m 0.000sec

8905
iterations count:177394 (791), effective:1950 (8)
8905
iterations count:177401 (791), effective:1950 (8)

iterations count:26426 (117), effective:285 (1)

iterations count:81492 (363), effective:1847 (8)

iterations count:17715 (79), effective:400 (1)

iterations count:13908 (62), effective:292 (1)

iterations count:30236 (134), effective:1338 (5)

iterations count:22273 (99), effective:554 (2)
7964
iterations count:189141 (844), effective:2021 (9)

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="Szymanski-PT-a08"
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 Szymanski-PT-a08, 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 r490-tall-167912708600430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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