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

About the Execution of Marcie+red for DLCround-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5583.911 24108.00 27860.00 347.20 FTTTTTTTTFFTTTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814483000670.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 DLCround-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:37 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.6K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 325K 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 DLCround-PT-06a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678452842862

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=DLCround-PT-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 12:54:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 12:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 12:54:04] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-10 12:54:04] [INFO ] Transformed 197 places.
[2023-03-10 12:54:04] [INFO ] Transformed 1313 transitions.
[2023-03-10 12:54:04] [INFO ] Found NUPN structural information;
[2023-03-10 12:54:04] [INFO ] Parsed PT model containing 197 places and 1313 transitions and 5002 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
FORMULA DLCround-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 9) seen :2
FORMULA DLCround-PT-06a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 12:54:05] [INFO ] Flow matrix only has 154 transitions (discarded 1024 similar events)
// Phase 1: matrix 154 rows 197 cols
[2023-03-10 12:54:05] [INFO ] Computed 109 place invariants in 16 ms
[2023-03-10 12:54:05] [INFO ] [Real]Absence check using 109 positive place invariants in 29 ms returned sat
[2023-03-10 12:54:05] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-10 12:54:05] [INFO ] [Nat]Absence check using 109 positive place invariants in 19 ms returned sat
[2023-03-10 12:54:05] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
FORMULA DLCround-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1623 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: DLCround_PT_06a
(NrP: 197 NrTr: 1313 NrArc: 5002)

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

net check time: 0m 0.000sec

init dd package: 0m 2.707sec


RS generation: 0m 5.433sec


-> reachability set: #nodes 60057 (6.0e+04) #states 24,010,000,001 (10)



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

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

abstracting: (p32<=1)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

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

abstracting: (p32<=1)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.733sec

checking: EF [~ [p168<=p119]]
normalized: E [true U ~ [p168<=p119]]

abstracting: (p168<=p119)
states: 24,010,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (p34<=p154)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (p172<=p105)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [[p17<=0 | [[[p30<=p86 | p84<=1] | ~ [p193<=0]] | 1<=p182]]]
normalized: ~ [E [true U ~ [[[[[p30<=p86 | p84<=1] | ~ [p193<=0]] | 1<=p182] | p17<=0]]]]

abstracting: (p17<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p182)
states: 24,010,000,000 (10)
abstracting: (p193<=0)
states: 1
abstracting: (p84<=1)
states: 24,010,000,001 (10)
abstracting: (p30<=p86)
states: 21,849,100,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [~ [[1<=p114 & [[[1<=p152 | ~ [[1<=p111 | p96<=0]]] & [[[p181<=0 & p34<=p71] & ~ [1<=p146]] & ~ [p38<=0]]] & p162<=0]]]]
normalized: ~ [E [true U [1<=p114 & [p162<=0 & [[~ [p38<=0] & [~ [1<=p146] & [p181<=0 & p34<=p71]]] & [1<=p152 | ~ [[1<=p111 | p96<=0]]]]]]]]

abstracting: (p96<=0)
states: 21,609,000,001 (10)
abstracting: (1<=p111)
states: 24,010,000,000 (10)
abstracting: (1<=p152)
states: 24,010,000,000 (10)
abstracting: (p34<=p71)
states: 21,849,100,001 (10)
abstracting: (p181<=0)
states: 1
abstracting: (1<=p146)
states: 24,010,000,000 (10)
abstracting: (p38<=0)
states: 21,609,000,001 (10)
abstracting: (p162<=0)
states: 1
abstracting: (1<=p114)
states: 24,010,000,000 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: AG [~ [[[1<=p39 & [~ [1<=p154] & ~ [[[~ [p149<=p50] & [[p4<=0 & p192<=1] | ~ [p41<=1]]] | p106<=p68]]]] & 1<=p111]]]
normalized: ~ [E [true U [1<=p111 & [1<=p39 & [~ [[p106<=p68 | [[~ [p41<=1] | [p4<=0 & p192<=1]] & ~ [p149<=p50]]]] & ~ [1<=p154]]]]]]

abstracting: (1<=p154)
states: 24,010,000,000 (10)
abstracting: (p149<=p50)
states: 2,401,000,001 (9)
abstracting: (p192<=1)
states: 24,010,000,001 (10)
abstracting: (p4<=0)
states: 20,580,000,001 (10)
abstracting: (p41<=1)
states: 24,010,000,001 (10)
abstracting: (p106<=p68)
states: 2,401,000,001 (9)
abstracting: (1<=p39)
states: 2,401,000,000 (9)
abstracting: (1<=p111)
states: 24,010,000,000 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: EF [[~ [[[[~ [p139<=p80] | ~ [1<=p185]] | 1<=p84] | [[p73<=p173 & [[1<=p151 | p123<=p18] & ~ [1<=p1]]] & ~ [1<=p118]]]] & 1<=p75]]
normalized: E [true U [1<=p75 & ~ [[[~ [1<=p118] & [p73<=p173 & [~ [1<=p1] & [1<=p151 | p123<=p18]]]] | [1<=p84 | [~ [1<=p185] | ~ [p139<=p80]]]]]]]

abstracting: (p139<=p80)
states: 2,401,000,001 (9)
abstracting: (1<=p185)
states: 24,010,000,000 (10)
abstracting: (1<=p84)
states: 2,401,000,000 (9)
abstracting: (p123<=p18)
states: 3,430,000,001 (9)
abstracting: (1<=p151)
states: 24,010,000,000 (10)
abstracting: (1<=p1)
states: 3,430,000,000 (9)
abstracting: (p73<=p173)
states: 24,010,000,001 (10)
abstracting: (1<=p118)
states: 24,010,000,000 (10)
abstracting: (1<=p75)
states: 2,401,000,000 (9)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.415sec

checking: AG [[[p108<=1 | [[[~ [[p70<=p155 | 1<=p74]] | [[[~ [p135<=1] | p28<=1] & 1<=p113] | [~ [[1<=p158 | 1<=p99]] & p16<=1]]] | [[~ [p74<=p45] & [p159<=0 & [[p60<=0 | p24<=1] | [p89<=0 | p34<=p86]]]] | p53<=1]] | 1<=p51]] | p188<=0]]
normalized: ~ [E [true U ~ [[p188<=0 | [p108<=1 | [1<=p51 | [[p53<=1 | [[p159<=0 & [[p89<=0 | p34<=p86] | [p60<=0 | p24<=1]]] & ~ [p74<=p45]]] | [[[p16<=1 & ~ [[1<=p158 | 1<=p99]]] | [1<=p113 & [p28<=1 | ~ [p135<=1]]]] | ~ [[p70<=p155 | 1<=p74]]]]]]]]]]

abstracting: (1<=p74)
states: 2,401,000,000 (9)
abstracting: (p70<=p155)
states: 24,010,000,001 (10)
abstracting: (p135<=1)
states: 24,010,000,001 (10)
abstracting: (p28<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p113)
states: 24,010,000,000 (10)
abstracting: (1<=p99)
states: 24,010,000,000 (10)
abstracting: (1<=p158)
states: 24,010,000,000 (10)
abstracting: (p16<=1)
states: 24,010,000,001 (10)
abstracting: (p74<=p45)
states: 21,849,100,001 (10)
abstracting: (p24<=1)
states: 24,010,000,001 (10)
abstracting: (p60<=0)
states: 21,609,000,001 (10)
abstracting: (p34<=p86)
states: 21,849,100,001 (10)
abstracting: (p89<=0)
states: 21,609,000,001 (10)
abstracting: (p159<=0)
states: 1
abstracting: (p53<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p51)
states: 2,401,000,000 (9)
abstracting: (p108<=1)
states: 24,010,000,001 (10)
abstracting: (p188<=0)
states: 1
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: AG [[~ [[[~ [[~ [[p11<=p89 | p2<=p90]] | [p57<=1 | [p40<=p10 | 1<=p84]]]] & [[[~ [p94<=p182] & ~ [p183<=p84]] | 1<=p182] & p17<=1]] & p73<=1]] | [~ [p101<=0] | ~ [[[[~ [[~ [1<=p43] & [p86<=1 & p182<=p141]]] & p177<=p120] | p65<=1] & [~ [[~ [1<=p184] & [~ [p65<=1] & [1<=p55 | p67<=1]]]] & ~ [p109<=0]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [p109<=0] & ~ [[[[1<=p55 | p67<=1] & ~ [p65<=1]] & ~ [1<=p184]]]] & [p65<=1 | [p177<=p120 & ~ [[[p86<=1 & p182<=p141] & ~ [1<=p43]]]]]]] | ~ [p101<=0]] | ~ [[p73<=1 & [[p17<=1 & [1<=p182 | [~ [p183<=p84] & ~ [p94<=p182]]]] & ~ [[[p57<=1 | [p40<=p10 | 1<=p84]] | ~ [[p11<=p89 | p2<=p90]]]]]]]]]]]

abstracting: (p2<=p90)
states: 20,923,000,001 (10)
abstracting: (p11<=p89)
states: 20,923,000,001 (10)
abstracting: (1<=p84)
states: 2,401,000,000 (9)
abstracting: (p40<=p10)
states: 21,952,000,001 (10)
abstracting: (p57<=1)
states: 24,010,000,001 (10)
abstracting: (p94<=p182)
states: 24,010,000,001 (10)
abstracting: (p183<=p84)
states: 2,401,000,001 (9)
abstracting: (1<=p182)
states: 24,010,000,000 (10)
abstracting: (p17<=1)
states: 24,010,000,001 (10)
abstracting: (p73<=1)
states: 24,010,000,001 (10)
abstracting: (p101<=0)
states: 1
abstracting: (1<=p43)
states: 2,401,000,000 (9)
abstracting: (p182<=p141)
states: 24,010,000,001 (10)
abstracting: (p86<=1)
states: 24,010,000,001 (10)
abstracting: (p177<=p120)
states: 24,010,000,001 (10)
abstracting: (p65<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p184)
states: 24,010,000,000 (10)
abstracting: (p65<=1)
states: 24,010,000,001 (10)
abstracting: (p67<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p55)
states: 2,401,000,000 (9)
abstracting: (p109<=0)
states: 1
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.178sec

checking: EF [~ [[[~ [[[~ [p194<=1] | 1<=p55] | [[[[1<=p6 | p42<=p3] | 1<=p94] | [[p31<=1 | p1<=p76] | [p141<=0 & p149<=p122]]] | 1<=p141]]] | ~ [[1<=p33 & ~ [p13<=p133]]]] | ~ [[[[~ [p41<=p95] | ~ [[p194<=1 | 1<=p40]]] & [p52<=1 | [[p41<=1 | p134<=p133] & [[1<=p187 & p131<=p134] & [1<=p49 | 1<=p125]]]]] | [p150<=0 | [[p67<=0 & p61<=0] & p69<=p3]]]]]]]
normalized: E [true U ~ [[~ [[[p150<=0 | [p69<=p3 & [p67<=0 & p61<=0]]] | [[p52<=1 | [[[1<=p49 | 1<=p125] & [1<=p187 & p131<=p134]] & [p41<=1 | p134<=p133]]] & [~ [[p194<=1 | 1<=p40]] | ~ [p41<=p95]]]]] | [~ [[1<=p33 & ~ [p13<=p133]]] | ~ [[[1<=p141 | [[[p141<=0 & p149<=p122] | [p31<=1 | p1<=p76]] | [1<=p94 | [1<=p6 | p42<=p3]]]] | [1<=p55 | ~ [p194<=1]]]]]]]]

abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p55)
states: 2,401,000,000 (9)
abstracting: (p42<=p3)
states: 21,952,000,001 (10)
abstracting: (1<=p6)
states: 3,430,000,000 (9)
abstracting: (1<=p94)
states: 2,401,000,000 (9)
abstracting: (p1<=p76)
states: 20,923,000,001 (10)
abstracting: (p31<=1)
states: 24,010,000,001 (10)
abstracting: (p149<=p122)
states: 24,010,000,001 (10)
abstracting: (p141<=0)
states: 1
abstracting: (1<=p141)
states: 24,010,000,000 (10)
abstracting: (p13<=p133)
states: 24,010,000,001 (10)
abstracting: (1<=p33)
states: 2,401,000,000 (9)
abstracting: (p41<=p95)
states: 21,849,100,001 (10)
abstracting: (1<=p40)
states: 2,401,000,000 (9)
abstracting: (p194<=1)
states: 24,010,000,001 (10)
abstracting: (p134<=p133)
states: 24,010,000,001 (10)
abstracting: (p41<=1)
states: 24,010,000,001 (10)
abstracting: (p131<=p134)
states: 24,010,000,001 (10)
abstracting: (1<=p187)
states: 24,010,000,000 (10)
abstracting: (1<=p125)
states: 24,010,000,000 (10)
abstracting: (1<=p49)
states: 2,401,000,000 (9)
abstracting: (p52<=1)
states: 24,010,000,001 (10)
abstracting: (p61<=0)
states: 21,609,000,001 (10)
abstracting: (p67<=0)
states: 21,609,000,001 (10)
abstracting: (p69<=p3)
states: 21,952,000,001 (10)
abstracting: (p150<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.420sec

checking: AG [[[~ [1<=p55] | [~ [p96<=0] & ~ [[[[[1<=p190 & [1<=p133 | p75<=1]] & [p57<=1 | [1<=p176 | p169<=1]]] & ~ [[p78<=0 | [p39<=0 | p195<=0]]]] | ~ [p139<=1]]]]] | ~ [[[[[p107<=p41 & 1<=p62] | [[p4<=1 | 1<=p131] | [[p96<=0 & ~ [p72<=p139]] & p125<=p61]]] & p71<=p103] | [[[[p154<=0 | [[1<=p18 & p153<=p3] | [1<=p8 & p5<=0]]] | [~ [1<=p65] | [[p127<=p100 & p99<=p41] & ~ [p190<=0]]]] & p138<=0] | ~ [[[1<=p44 | [p151<=p32 | ~ [1<=p4]]] & [1<=p79 | ~ [p123<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[[1<=p79 | ~ [p123<=0]] & [1<=p44 | [p151<=p32 | ~ [1<=p4]]]]] | [p138<=0 & [[[~ [p190<=0] & [p127<=p100 & p99<=p41]] | ~ [1<=p65]] | [p154<=0 | [[1<=p8 & p5<=0] | [1<=p18 & p153<=p3]]]]]] | [p71<=p103 & [[[p125<=p61 & [p96<=0 & ~ [p72<=p139]]] | [p4<=1 | 1<=p131]] | [p107<=p41 & 1<=p62]]]]] | [[~ [[~ [p139<=1] | [~ [[p78<=0 | [p39<=0 | p195<=0]]] & [[p57<=1 | [1<=p176 | p169<=1]] & [1<=p190 & [1<=p133 | p75<=1]]]]]] & ~ [p96<=0]] | ~ [1<=p55]]]]]]

abstracting: (1<=p55)
states: 2,401,000,000 (9)
abstracting: (p96<=0)
states: 21,609,000,001 (10)
abstracting: (p75<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p133)
states: 24,010,000,000 (10)
abstracting: (1<=p190)
states: 24,010,000,000 (10)
abstracting: (p169<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p176)
states: 24,010,000,000 (10)
abstracting: (p57<=1)
states: 24,010,000,001 (10)
abstracting: (p195<=0)
states: 1
abstracting: (p39<=0)
states: 21,609,000,001 (10)
abstracting: (p78<=0)
states: 21,609,000,001 (10)
abstracting: (p139<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p62)
states: 2,401,000,000 (9)
abstracting: (p107<=p41)
states: 2,401,000,001 (9)
abstracting: (1<=p131)
states: 24,010,000,000 (10)
abstracting: (p4<=1)
states: 24,010,000,001 (10)
abstracting: (p72<=p139)
states: 24,010,000,001 (10)
abstracting: (p96<=0)
states: 21,609,000,001 (10)
abstracting: (p125<=p61)
states: 2,401,000,001 (9)
abstracting: (p71<=p103)
states: 24,010,000,001 (10)
abstracting: (p153<=p3)
states: 3,430,000,001 (9)
abstracting: (1<=p18)
states: 3,430,000,000 (9)
abstracting: (p5<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p8)
states: 3,430,000,000 (9)
abstracting: (p154<=0)
states: 1
abstracting: (1<=p65)
states: 2,401,000,000 (9)
abstracting: (p99<=p41)
states: 2,401,000,001 (9)
abstracting: (p127<=p100)
states: 24,010,000,001 (10)
abstracting: (p190<=0)
states: 1
abstracting: (p138<=0)
states: 1
abstracting: (1<=p4)
states: 3,430,000,000 (9)
abstracting: (p151<=p32)
states: 2,401,000,001 (9)
abstracting: (1<=p44)
states: 2,401,000,000 (9)
abstracting: (p123<=0)
states: 1
abstracting: (1<=p79)
states: 2,401,000,000 (9)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.372sec

checking: AG [[[1<=p115 | 1<=p164] | [[[p116<=p73 | [~ [1<=p79] & [~ [[[p14<=p186 | 1<=p78] & ~ [1<=p4]]] & [~ [p164<=p61] & [[p95<=0 & p195<=0] & ~ [1<=p52]]]]]] | [[p41<=1 & [p64<=0 & 1<=p91]] | ~ [[[[~ [p139<=p47] & ~ [1<=p81]] | [[1<=p40 | p113<=0] & ~ [1<=p141]]] | p84<=1]]]] | ~ [[[p146<=p186 & [~ [p190<=1] | [[~ [p86<=p156] & ~ [p80<=p87]] & [[1<=p136 & p44<=p119] & ~ [p158<=0]]]]] | [~ [[[[p3<=p78 | p128<=0] | [1<=p96 | p67<=p23]] & [[1<=p35 & p92<=1] & [1<=p120 | p58<=p139]]]] | p134<=p56]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[p134<=p56 | ~ [[[[1<=p120 | p58<=p139] & [1<=p35 & p92<=1]] & [[1<=p96 | p67<=p23] | [p3<=p78 | p128<=0]]]]] | [p146<=p186 & [[[~ [p158<=0] & [1<=p136 & p44<=p119]] & [~ [p80<=p87] & ~ [p86<=p156]]] | ~ [p190<=1]]]]] | [[~ [[p84<=1 | [[~ [1<=p141] & [1<=p40 | p113<=0]] | [~ [1<=p81] & ~ [p139<=p47]]]]] | [p41<=1 & [p64<=0 & 1<=p91]]] | [p116<=p73 | [[[[~ [1<=p52] & [p95<=0 & p195<=0]] & ~ [p164<=p61]] & ~ [[~ [1<=p4] & [p14<=p186 | 1<=p78]]]] & ~ [1<=p79]]]]] | [1<=p115 | 1<=p164]]]]]

abstracting: (1<=p164)
states: 24,010,000,000 (10)
abstracting: (1<=p115)
states: 24,010,000,000 (10)
abstracting: (1<=p79)
states: 2,401,000,000 (9)
abstracting: (1<=p78)
states: 2,401,000,000 (9)
abstracting: (p14<=p186)
states: 24,010,000,001 (10)
abstracting: (1<=p4)
states: 3,430,000,000 (9)
abstracting: (p164<=p61)
states: 2,401,000,001 (9)
abstracting: (p195<=0)
states: 1
abstracting: (p95<=0)
states: 21,609,000,001 (10)
abstracting: (1<=p52)
states: 2,401,000,000 (9)
abstracting: (p116<=p73)
states: 2,401,000,001 (9)
abstracting: (1<=p91)
states: 2,401,000,000 (9)
abstracting: (p64<=0)
states: 21,609,000,001 (10)
abstracting: (p41<=1)
states: 24,010,000,001 (10)
abstracting: (p139<=p47)
states: 2,401,000,001 (9)
abstracting: (1<=p81)
states: 2,401,000,000 (9)
abstracting: (p113<=0)
states: 1
abstracting: (1<=p40)
states: 2,401,000,000 (9)
abstracting: (1<=p141)
states: 24,010,000,000 (10)
abstracting: (p84<=1)
states: 24,010,000,001 (10)
abstracting: (p190<=1)
states: 24,010,000,001 (10)
abstracting: (p86<=p156)
states: 24,010,000,001 (10)
abstracting: (p80<=p87)
states: 21,609,000,001 (10)
abstracting: (p44<=p119)
states: 24,010,000,001 (10)
abstracting: (1<=p136)
states: 24,010,000,000 (10)
abstracting: (p158<=0)
states: 1
abstracting: (p146<=p186)
states: 24,010,000,001 (10)
abstracting: (p128<=0)
states: 1
abstracting: (p3<=p78)
states: 20,923,000,001 (10)
abstracting: (p67<=p23)
states: 21,952,000,001 (10)
abstracting: (1<=p96)
states: 2,401,000,000 (9)
abstracting: (p92<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p35)
states: 2,401,000,000 (9)
abstracting: (p58<=p139)
states: 24,010,000,001 (10)
abstracting: (1<=p120)
states: 24,010,000,000 (10)
abstracting: (p134<=p56)
states: 2,401,000,001 (9)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.332sec

checking: EF [[[[[~ [[[[~ [1<=p19] & [p58<=0 & p85<=0]] & p123<=0] | 1<=p127]] & [[~ [p67<=1] | [[[p59<=p15 | p143<=p193] | [1<=p86 & 1<=p177]] | [[p104<=0 & 1<=p77] & p79<=1]]] & [[p45<=p80 & 1<=p117] | ~ [[[p22<=p20 | 1<=p172] | ~ [1<=p160]]]]]] | ~ [p60<=0]] | ~ [[p162<=p21 & [~ [[1<=p119 | p97<=1]] | [[1<=p181 & p29<=p192] & ~ [p157<=p24]]]]]] & [[1<=p110 & [[p75<=p83 | 1<=p138] & [~ [p19<=1] & [[[1<=p54 | [1<=p25 | p111<=p143]] & [[p117<=0 | p60<=0] & [1<=p164 & p175<=p14]]] | 1<=p7]]]] & ~ [[p145<=p33 | 1<=p1]]]]]
normalized: E [true U [[~ [[p145<=p33 | 1<=p1]] & [1<=p110 & [[[1<=p7 | [[[1<=p164 & p175<=p14] & [p117<=0 | p60<=0]] & [1<=p54 | [1<=p25 | p111<=p143]]]] & ~ [p19<=1]] & [p75<=p83 | 1<=p138]]]] & [~ [[p162<=p21 & [[~ [p157<=p24] & [1<=p181 & p29<=p192]] | ~ [[1<=p119 | p97<=1]]]]] | [~ [p60<=0] | [[[~ [[~ [1<=p160] | [p22<=p20 | 1<=p172]]] | [p45<=p80 & 1<=p117]] & [[[p79<=1 & [p104<=0 & 1<=p77]] | [[1<=p86 & 1<=p177] | [p59<=p15 | p143<=p193]]] | ~ [p67<=1]]] & ~ [[1<=p127 | [p123<=0 & [[p58<=0 & p85<=0] & ~ [1<=p19]]]]]]]]]]

abstracting: (1<=p19)
states: 3,430,000,000 (9)
abstracting: (p85<=0)
states: 21,609,000,001 (10)
abstracting: (p58<=0)
states: 21,609,000,001 (10)
abstracting: (p123<=0)
states: 1
abstracting: (1<=p127)
states: 24,010,000,000 (10)
abstracting: (p67<=1)
states: 24,010,000,001 (10)
abstracting: (p143<=p193)
states: 24,010,000,001 (10)
abstracting: (p59<=p15)
states: 21,952,000,001 (10)
abstracting: (1<=p177)
states: 24,010,000,000 (10)
abstracting: (1<=p86)
states: 2,401,000,000 (9)
abstracting: (1<=p77)
states: 2,401,000,000 (9)
abstracting: (p104<=0)
states: 1
abstracting: (p79<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p117)
states: 24,010,000,000 (10)
abstracting: (p45<=p80)
states: 21,849,100,001 (10)
abstracting: (1<=p172)
states: 24,010,000,000 (10)
abstracting: (p22<=p20)
states: 21,070,000,001 (10)
abstracting: (1<=p160)
states: 24,010,000,000 (10)
abstracting: (p60<=0)
states: 21,609,000,001 (10)
abstracting: (p97<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p119)
states: 24,010,000,000 (10)
abstracting: (p29<=p192)
states: 24,010,000,001 (10)
abstracting: (1<=p181)
states: 24,010,000,000 (10)
abstracting: (p157<=p24)
states: 3,430,000,001 (9)
abstracting: (p162<=p21)
states: 3,430,000,001 (9)
abstracting: (1<=p138)
states: 24,010,000,000 (10)
abstracting: (p75<=p83)
states: 21,849,100,001 (10)
abstracting: (p19<=1)
states: 24,010,000,001 (10)
abstracting: (p111<=p143)
states: 24,010,000,001 (10)
abstracting: (1<=p25)
states: 3,430,000,000 (9)
abstracting: (1<=p54)
states: 2,401,000,000 (9)
abstracting: (p60<=0)
states: 21,609,000,001 (10)
abstracting: (p117<=0)
states: 1
abstracting: (p175<=p14)
states: 3,430,000,001 (9)
abstracting: (1<=p164)
states: 24,010,000,000 (10)
abstracting: (1<=p7)
states: 3,430,000,000 (9)
abstracting: (1<=p110)
states: 24,010,000,000 (10)
abstracting: (1<=p1)
states: 3,430,000,000 (9)
abstracting: (p145<=p33)
states: 2,401,000,001 (9)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.385sec

checking: AG [[[[[~ [[1<=p186 | ~ [p184<=1]]] | ~ [[~ [1<=p5] | [p107<=1 | 1<=p75]]]] & [[p124<=p24 & ~ [p112<=p86]] | ~ [[p44<=0 | [[~ [p13<=p48] | [1<=p145 & p169<=p83]] & [[1<=p167 & p21<=0] | ~ [1<=p57]]]]]]] & 1<=p46] & [[[~ [[[[1<=p18 | p17<=1] & [1<=p81 | p92<=p42]] | 1<=p36]] | ~ [[~ [[p113<=1 | ~ [1<=p42]]] & p154<=p67]]] | ~ [p63<=0]] | [~ [p135<=1] | [[[[[[p102<=p47 | p57<=1] & ~ [p23<=1]] | [[p62<=p97 & p1<=1] | 1<=p10]] & [p3<=1 & p1<=1]] & ~ [[[[1<=p185 | 1<=p118] | [p166<=0 & 1<=p192]] | ~ [p168<=1]]]] | [p49<=0 | [[[p179<=0 & ~ [p174<=p152]] | ~ [1<=p160]] & 1<=p42]]]]]]]
normalized: ~ [E [true U ~ [[[[[[p49<=0 | [1<=p42 & [~ [1<=p160] | [p179<=0 & ~ [p174<=p152]]]]] | [~ [[~ [p168<=1] | [[p166<=0 & 1<=p192] | [1<=p185 | 1<=p118]]]] & [[p3<=1 & p1<=1] & [[1<=p10 | [p62<=p97 & p1<=1]] | [~ [p23<=1] & [p102<=p47 | p57<=1]]]]]] | ~ [p135<=1]] | [~ [p63<=0] | [~ [[p154<=p67 & ~ [[p113<=1 | ~ [1<=p42]]]]] | ~ [[1<=p36 | [[1<=p81 | p92<=p42] & [1<=p18 | p17<=1]]]]]]] & [1<=p46 & [[~ [[p44<=0 | [[~ [1<=p57] | [1<=p167 & p21<=0]] & [[1<=p145 & p169<=p83] | ~ [p13<=p48]]]]] | [p124<=p24 & ~ [p112<=p86]]] & [~ [[[p107<=1 | 1<=p75] | ~ [1<=p5]]] | ~ [[1<=p186 | ~ [p184<=1]]]]]]]]]]

abstracting: (p184<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p186)
states: 24,010,000,000 (10)
abstracting: (1<=p5)
states: 3,430,000,000 (9)
abstracting: (1<=p75)
states: 2,401,000,000 (9)
abstracting: (p107<=1)
states: 24,010,000,001 (10)
abstracting: (p112<=p86)
states: 2,401,000,001 (9)
abstracting: (p124<=p24)
states: 3,430,000,001 (9)
abstracting: (p13<=p48)
states: 20,923,000,001 (10)
abstracting: (p169<=p83)
states: 2,401,000,001 (9)
abstracting: (1<=p145)
states: 24,010,000,000 (10)
abstracting: (p21<=0)
states: 20,580,000,001 (10)
abstracting: (1<=p167)
states: 24,010,000,000 (10)
abstracting: (1<=p57)
states: 2,401,000,000 (9)
abstracting: (p44<=0)
states: 21,609,000,001 (10)
abstracting: (1<=p46)
states: 2,401,000,000 (9)
abstracting: (p17<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p18)
states: 3,430,000,000 (9)
abstracting: (p92<=p42)
states: 21,849,100,001 (10)
abstracting: (1<=p81)
states: 2,401,000,000 (9)
abstracting: (1<=p36)
states: 2,401,000,000 (9)
abstracting: (1<=p42)
states: 2,401,000,000 (9)
abstracting: (p113<=1)
states: 24,010,000,001 (10)
abstracting: (p154<=p67)
states: 2,401,000,001 (9)
abstracting: (p63<=0)
states: 21,609,000,001 (10)
abstracting: (p135<=1)
states: 24,010,000,001 (10)
abstracting: (p57<=1)
states: 24,010,000,001 (10)
abstracting: (p102<=p47)
states: 2,401,000,001 (9)
abstracting: (p23<=1)
states: 24,010,000,001 (10)
abstracting: (p1<=1)
states: 24,010,000,001 (10)
abstracting: (p62<=p97)
states: 21,849,100,001 (10)
abstracting: (1<=p10)
states: 3,430,000,000 (9)
abstracting: (p1<=1)
states: 24,010,000,001 (10)
abstracting: (p3<=1)
states: 24,010,000,001 (10)
abstracting: (1<=p118)
states: 24,010,000,000 (10)
abstracting: (1<=p185)
states: 24,010,000,000 (10)
abstracting: (1<=p192)
states: 24,010,000,000 (10)
abstracting: (p166<=0)
states: 1
abstracting: (p168<=1)
states: 24,010,000,001 (10)
abstracting: (p174<=p152)
states: 24,010,000,001 (10)
abstracting: (p179<=0)
states: 1
abstracting: (1<=p160)
states: 24,010,000,000 (10)
abstracting: (1<=p42)
states: 2,401,000,000 (9)
abstracting: (p49<=0)
states: 21,609,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

totally nodes used: 1439857 (1.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7445129 42497456 49942585
used/not used/entry size/cache size: 30924270 36184594 16 1024MB
basic ops cache: hits/miss/sum: 933579 5290461 6224040
used/not used/entry size/cache size: 6227750 10549466 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: 199179 1009575 1208754
used/not used/entry size/cache size: 954246 7434362 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 65698214
1 1382630
2 26887
3 1081
4 50
5 2
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m19.971sec


BK_STOP 1678452866970

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


iterations count:37778 (28), effective:88 (0)

initing FirstDep: 0m 0.006sec


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

iterations count:10780 (8), effective:19 (0)

iterations count:6052 (4), effective:20 (0)

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-06a"
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 DLCround-PT-06a, 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 r106-tall-167814483000670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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