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

About the Execution of Marcie+red for DES-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5701.344 18612.00 23157.00 250.80 TFTFTTTFFFTFFTTF 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-167814482600366.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 DES-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 32K 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 DES-PT-01a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-01a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678378163934

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=DES-PT-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 16:09:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 16:09:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:09:25] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-09 16:09:25] [INFO ] Transformed 119 places.
[2023-03-09 16:09:25] [INFO ] Transformed 76 transitions.
[2023-03-09 16:09:25] [INFO ] Found NUPN structural information;
[2023-03-09 16:09:25] [INFO ] Parsed PT model containing 119 places and 76 transitions and 381 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 418 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 14) seen :10
FORMULA DES-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :1
FORMULA DES-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 62 rows 119 cols
[2023-03-09 16:09:26] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-09 16:09:26] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 16:09:26] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-09 16:09:26] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-09 16:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 16:09:26] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :1 real:1
[2023-03-09 16:09:26] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 16:09:26] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 16:09:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 16:09:26] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-09 16:09:26] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-09 16:09:26] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-09 16:09:26] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 16:09:26] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA DES-PT-01a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-01a-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 62/62 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 118 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 118 transition count 59
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 118 transition count 59
Applied a total of 11 rules in 34 ms. Remains 118 /119 variables (removed 1) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 118/119 places, 59/62 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2167581 steps, run timeout after 3001 ms. (steps per millisecond=722 ) properties seen :{}
Probabilistic random walk after 2167581 steps, saw 281928 distinct states, run finished after 3002 ms. (steps per millisecond=722 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 118 cols
[2023-03-09 16:09:29] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-09 16:09:29] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2023-03-09 16:09:29] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 16:09:29] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:09:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2023-03-09 16:09:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-09 16:09:29] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:09:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 16:09:29] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:09:29] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-09 16:09:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-09 16:09:29] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-09 16:09:29] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA DES-PT-01a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 4596 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: DES_PT_01a
(NrP: 119 NrTr: 76 NrArc: 381)

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

net check time: 0m 0.000sec

init dd package: 0m 2.732sec


RS generation: 0m 0.509sec


-> reachability set: #nodes 24378 (2.4e+04) #states 108,580,356 (8)



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

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

abstracting: (p12<=1)
states: 108,580,356 (8)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

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

abstracting: (1<=p25)
states: 35,497,022 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.446sec

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

abstracting: (1<=p67)
states: 36,853,356 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.287sec

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

abstracting: (p78<=p68)
states: 97,053,408 (7)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.359sec

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

abstracting: (p53<=p76)
states: 83,253,948 (7)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.113sec

checking: AG [~ [[1<=p110 & 1<=p91]]]
normalized: ~ [E [true U [1<=p110 & 1<=p91]]]

abstracting: (1<=p91)
states: 69,249,003 (7)
abstracting: (1<=p110)
states: 22,918,477 (7)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.708sec

checking: EF [[~ [p24<=p34] | [p96<=0 & ~ [[p22<=1 | 1<=p58]]]]]
normalized: E [true U [[p96<=0 & ~ [[p22<=1 | 1<=p58]]] | ~ [p24<=p34]]]

abstracting: (p24<=p34)
states: 108,580,356 (8)
abstracting: (1<=p58)
states: 71,726,999 (7)
abstracting: (p22<=1)
states: 108,580,356 (8)
abstracting: (p96<=0)
states: 97,446 (4)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[1<=p51 & ~ [[[[~ [[p3<=p63 & p78<=1]] | ~ [[p98<=0 & 1<=p53]]] | ~ [[1<=p118 | ~ [p61<=p60]]]] | p85<=p19]]]]
normalized: E [true U [1<=p51 & ~ [[p85<=p19 | [[~ [[p98<=0 & 1<=p53]] | ~ [[p3<=p63 & p78<=1]]] | ~ [[1<=p118 | ~ [p61<=p60]]]]]]]]

abstracting: (p61<=p60)
states: 71,727,000 (7)
abstracting: (1<=p118)
states: 43,157,585 (7)
abstracting: (p78<=1)
states: 108,580,356 (8)
abstracting: (p3<=p63)
states: 108,571,928 (8)
abstracting: (1<=p53)
states: 36,853,356 (7)
abstracting: (p98<=0)
states: 95,238,761 (7)
abstracting: (p85<=p19)
states: 73,890,261 (7)
abstracting: (1<=p51)
states: 36,853,356 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.894sec

checking: AG [~ [[1<=p57 & ~ [[p79<=0 & [[~ [[p28<=0 & p18<=1]] | [[p98<=p99 | [1<=p63 | p95<=1]] | p50<=1]] | [1<=p52 | [p38<=p100 & ~ [p28<=p84]]]]]]]]]
normalized: ~ [E [true U [1<=p57 & ~ [[p79<=0 & [[1<=p52 | [p38<=p100 & ~ [p28<=p84]]] | [[p50<=1 | [p98<=p99 | [1<=p63 | p95<=1]]] | ~ [[p28<=0 & p18<=1]]]]]]]]]

abstracting: (p18<=1)
states: 108,580,356 (8)
abstracting: (p28<=0)
states: 68,517,348 (7)
abstracting: (p95<=1)
states: 108,580,356 (8)
abstracting: (1<=p63)
states: 36,853,356 (7)
abstracting: (p98<=p99)
states: 95,238,761 (7)
abstracting: (p50<=1)
states: 108,580,356 (8)
abstracting: (p28<=p84)
states: 81,271,932 (7)
abstracting: (p38<=p100)
states: 76,350,157 (7)
abstracting: (1<=p52)
states: 71,726,999 (7)
abstracting: (p79<=0)
states: 39,331,353 (7)
abstracting: (1<=p57)
states: 36,853,356 (7)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

checking: EF [[[[~ [p104<=1] | [~ [[p97<=0 & 1<=p17]] & ~ [1<=p78]]] & 1<=p78] & ~ [[~ [1<=p4] | ~ [[[[1<=p62 | p53<=1] | ~ [[p86<=p82 & p84<=p44]]] | [[[p68<=1 | [p104<=p94 & p24<=1]] & [1<=p89 & p61<=1]] | [[[1<=p118 & 1<=p1] & [1<=p77 & 1<=p14]] & [~ [1<=p6] | 1<=p24]]]]]]]]]
normalized: E [true U [~ [[~ [[[[[1<=p24 | ~ [1<=p6]] & [[1<=p77 & 1<=p14] & [1<=p118 & 1<=p1]]] | [[1<=p89 & p61<=1] & [p68<=1 | [p104<=p94 & p24<=1]]]] | [~ [[p86<=p82 & p84<=p44]] | [1<=p62 | p53<=1]]]] | ~ [1<=p4]]] & [1<=p78 & [[~ [1<=p78] & ~ [[p97<=0 & 1<=p17]]] | ~ [p104<=1]]]]]

abstracting: (p104<=1)
states: 108,580,356 (8)
abstracting: (1<=p17)
states: 95,507,346 (7)
abstracting: (p97<=0)
states: 108,482,911 (8)
abstracting: (1<=p78)
states: 34,580,844 (7)
abstracting: (1<=p78)
states: 34,580,844 (7)
abstracting: (1<=p4)
states: 4
abstracting: (p53<=1)
states: 108,580,356 (8)
abstracting: (1<=p62)
states: 71,726,999 (7)
abstracting: (p84<=p44)
states: 97,053,408 (7)
abstracting: (p86<=p82)
states: 85,526,460 (7)
abstracting: (p24<=1)
states: 108,580,356 (8)
abstracting: (p104<=p94)
states: 95,773,648 (7)
abstracting: (p68<=1)
states: 108,580,356 (8)
abstracting: (p61<=1)
states: 108,580,356 (8)
abstracting: (1<=p89)
states: 69,249,003 (7)
abstracting: (1<=p1)
states: 108,571,453 (8)
abstracting: (1<=p118)
states: 43,157,585 (7)
abstracting: (1<=p14)
states: 48,990,584 (7)
abstracting: (1<=p77)
states: 69,249,003 (7)
abstracting: (1<=p6)
states: 22,316,309 (7)
abstracting: (1<=p24)
states: 5,239,513 (6)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.188sec

checking: EF [[~ [[[p97<=p115 | ~ [[~ [[[p14<=1 | 1<=p8] & ~ [p58<=p59]]] & ~ [[1<=p13 & p108<=1]]]]] | [[[~ [p38<=0] & [~ [[1<=p7 | p83<=0]] | [~ [p1<=0] | [p8<=1 & p15<=1]]]] | [[[[p66<=p67 & p84<=0] & [1<=p104 & 1<=p6]] & ~ [p55<=p36]] & p42<=p0]] & [~ [1<=p0] | p3<=1]]]] & p100<=1]]
normalized: E [true U [p100<=1 & ~ [[[[p3<=1 | ~ [1<=p0]] & [[p42<=p0 & [~ [p55<=p36] & [[1<=p104 & 1<=p6] & [p66<=p67 & p84<=0]]]] | [[[[p8<=1 & p15<=1] | ~ [p1<=0]] | ~ [[1<=p7 | p83<=0]]] & ~ [p38<=0]]]] | [p97<=p115 | ~ [[~ [[1<=p13 & p108<=1]] & ~ [[~ [p58<=p59] & [p14<=1 | 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 45,021,787 (7)
abstracting: (p14<=1)
states: 108,580,356 (8)
abstracting: (p58<=p59)
states: 36,853,357 (7)
abstracting: (p108<=1)
states: 108,580,356 (8)
abstracting: (1<=p13)
states: 94,870,994 (7)
abstracting: (p97<=p115)
states: 108,482,911 (8)
abstracting: (p38<=0)
states: 52,946,750 (7)
abstracting: (p83<=0)
states: 39,331,353 (7)
abstracting: (1<=p7)
states: 63,558,568 (7)
abstracting: (p1<=0)
states: 8,903 (3)
abstracting: (p15<=1)
states: 108,580,356 (8)
abstracting: (p8<=1)
states: 108,580,356 (8)
abstracting: (p84<=0)
states: 73,999,512 (7)
abstracting: (p66<=p67)
states: 36,853,357 (7)
abstracting: (1<=p6)
states: 22,316,309 (7)
abstracting: (1<=p104)
states: 13,336,176 (7)
abstracting: (p55<=p36)
states: 108,580,356 (8)
abstracting: (p42<=p0)
states: 58,283,554 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p3<=1)
states: 108,580,356 (8)
abstracting: (p100<=1)
states: 108,580,356 (8)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.211sec

checking: EF [[[~ [p25<=0] & p73<=1] & [~ [1<=p25] | [[~ [[[~ [[p102<=p76 | 1<=p56]] | [1<=p41 | [p34<=1 | p72<=p54]]] & p49<=p108]] & [p64<=1 | [[[~ [p73<=1] & ~ [p97<=p91]] & [~ [p85<=1] & [p67<=p102 & p100<=p30]]] | 1<=p106]]] | [[p96<=p82 & [~ [p113<=1] & 1<=p79]] | ~ [1<=p22]]]]]]
normalized: E [true U [[[[~ [1<=p22] | [p96<=p82 & [1<=p79 & ~ [p113<=1]]]] | [[p64<=1 | [1<=p106 | [[[p67<=p102 & p100<=p30] & ~ [p85<=1]] & [~ [p97<=p91] & ~ [p73<=1]]]]] & ~ [[p49<=p108 & [[1<=p41 | [p34<=1 | p72<=p54]] | ~ [[p102<=p76 | 1<=p56]]]]]]] | ~ [1<=p25]] & [p73<=1 & ~ [p25<=0]]]]

abstracting: (p25<=0)
states: 73,083,334 (7)
abstracting: (p73<=1)
states: 108,580,356 (8)
abstracting: (1<=p25)
states: 35,497,022 (7)
abstracting: (1<=p56)
states: 71,726,999 (7)
abstracting: (p102<=p76)
states: 92,640,557 (7)
abstracting: (p72<=p54)
states: 84,390,204 (7)
abstracting: (p34<=1)
states: 108,580,356 (8)
abstracting: (1<=p41)
states: 33,566 (4)
abstracting: (p49<=p108)
states: 75,342,496 (7)
abstracting: (p73<=1)
states: 108,580,356 (8)
abstracting: (p97<=p91)
states: 108,517,572 (8)
abstracting: (p85<=1)
states: 108,580,356 (8)
abstracting: (p100<=p30)
states: 97,980,509 (7)
abstracting: (p67<=p102)
states: 79,669,465 (7)
abstracting: (1<=p106)
states: 15,383,795 (7)
abstracting: (p64<=1)
states: 108,580,356 (8)
abstracting: (p113<=1)
states: 108,580,356 (8)
abstracting: (1<=p79)
states: 69,249,003 (7)
abstracting: (p96<=p82)
states: 34,678,290 (7)
abstracting: (1<=p22)
states: 26,737,791 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.271sec

checking: EF [[1<=p76 & ~ [[[~ [p28<=0] & [~ [[[[p107<=0 & p118<=1] & p33<=p116] | [~ [1<=p78] | ~ [1<=p115]]]] & 1<=p90]] & [p39<=p48 & [[[[~ [p13<=p14] | [p48<=p64 & 1<=p13]] & [[p109<=0 & p24<=p86] | p92<=0]] & [~ [p29<=p48] | ~ [p0<=p114]]] & [[~ [1<=p103] | ~ [p14<=p72]] | [[~ [p100<=p43] | [p107<=1 & p71<=p59]] | [p25<=1 & [p69<=0 & p3<=0]]]]]]]]]]
normalized: E [true U [1<=p76 & ~ [[[p39<=p48 & [[[[p25<=1 & [p69<=0 & p3<=0]] | [[p107<=1 & p71<=p59] | ~ [p100<=p43]]] | [~ [p14<=p72] | ~ [1<=p103]]] & [[~ [p0<=p114] | ~ [p29<=p48]] & [[p92<=0 | [p109<=0 & p24<=p86]] & [[p48<=p64 & 1<=p13] | ~ [p13<=p14]]]]]] & [[1<=p90 & ~ [[[~ [1<=p115] | ~ [1<=p78]] | [p33<=p116 & [p107<=0 & p118<=1]]]]] & ~ [p28<=0]]]]]]

abstracting: (p28<=0)
states: 68,517,348 (7)
abstracting: (p118<=1)
states: 108,580,356 (8)
abstracting: (p107<=0)
states: 103,853,723 (8)
abstracting: (p33<=p116)
states: 89,637,546 (7)
abstracting: (1<=p78)
states: 34,580,844 (7)
abstracting: (1<=p115)
states: 2,572 (3)
abstracting: (1<=p90)
states: 34,580,844 (7)
abstracting: (p13<=p14)
states: 51,683,058 (7)
abstracting: (1<=p13)
states: 94,870,994 (7)
abstracting: (p48<=p64)
states: 71,727,000 (7)
abstracting: (p24<=p86)
states: 105,011,711 (8)
abstracting: (p109<=0)
states: 88,983,036 (7)
abstracting: (p92<=0)
states: 104,374,028 (8)
abstracting: (p29<=p48)
states: 100,434,080 (8)
abstracting: (p0<=p114)
states: 108,580,355 (8)
abstracting: (1<=p103)
states: 10,129,293 (7)
abstracting: (p14<=p72)
states: 91,981,748 (7)
abstracting: (p100<=p43)
states: 85,178,704 (7)
abstracting: (p71<=p59)
states: 84,390,204 (7)
abstracting: (p107<=1)
states: 108,580,356 (8)
abstracting: (p3<=0)
states: 108,571,928 (8)
abstracting: (p69<=0)
states: 71,727,000 (7)
abstracting: (p25<=1)
states: 108,580,356 (8)
abstracting: (p39<=p48)
states: 90,591,835 (7)
abstracting: (1<=p76)
states: 34,580,844 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.744sec

checking: AG [~ [[[[[[[[p112<=p13 & ~ [p110<=1]] | ~ [1<=p52]] | p65<=0] | [[~ [p45<=1] & p58<=1] | [p111<=p55 & [[p62<=p38 | 1<=p66] | [1<=p110 | p95<=p49]]]]] | ~ [[[[1<=p67 | p37<=p0] & [p68<=1 | p68<=p105]] & ~ [p36<=p104]]]] | [[1<=p41 | ~ [p61<=0]] | [~ [1<=p14] | [p38<=p49 & [[[p118<=p57 | p63<=1] & [p86<=0 | 1<=p81]] | ~ [p35<=p68]]]]]] & ~ [[[p118<=p68 | p80<=0] | [1<=p87 | 1<=p84]]]]]]
normalized: ~ [E [true U [~ [[[1<=p87 | 1<=p84] | [p118<=p68 | p80<=0]]] & [[[[p38<=p49 & [~ [p35<=p68] | [[p86<=0 | 1<=p81] & [p118<=p57 | p63<=1]]]] | ~ [1<=p14]] | [1<=p41 | ~ [p61<=0]]] | [~ [[~ [p36<=p104] & [[p68<=1 | p68<=p105] & [1<=p67 | p37<=p0]]]] | [[[p111<=p55 & [[1<=p110 | p95<=p49] | [p62<=p38 | 1<=p66]]] | [p58<=1 & ~ [p45<=1]]] | [p65<=0 | [~ [1<=p52] | [p112<=p13 & ~ [p110<=1]]]]]]]]]]

abstracting: (p110<=1)
states: 108,580,356 (8)
abstracting: (p112<=p13)
states: 105,868,227 (8)
abstracting: (1<=p52)
states: 71,726,999 (7)
abstracting: (p65<=0)
states: 71,727,000 (7)
abstracting: (p45<=1)
states: 108,580,356 (8)
abstracting: (p58<=1)
states: 108,580,356 (8)
abstracting: (1<=p66)
states: 71,726,999 (7)
abstracting: (p62<=p38)
states: 73,622,128 (7)
abstracting: (p95<=p49)
states: 108,517,572 (8)
abstracting: (1<=p110)
states: 22,918,477 (7)
abstracting: (p111<=p55)
states: 93,444,133 (7)
abstracting: (p37<=p0)
states: 108,549,910 (8)
abstracting: (1<=p67)
states: 36,853,356 (7)
abstracting: (p68<=p105)
states: 36,864,559 (7)
abstracting: (p68<=1)
states: 108,580,356 (8)
abstracting: (p36<=p104)
states: 13,366,623 (7)
abstracting: (p61<=0)
states: 71,727,000 (7)
abstracting: (1<=p41)
states: 33,566 (4)
abstracting: (1<=p14)
states: 48,990,584 (7)
abstracting: (p63<=1)
states: 108,580,356 (8)
abstracting: (p118<=p57)
states: 80,074,145 (7)
abstracting: (1<=p81)
states: 69,249,003 (7)
abstracting: (p86<=0)
states: 73,999,512 (7)
abstracting: (p35<=p68)
states: 108,580,356 (8)
abstracting: (p38<=p49)
states: 71,811,585 (7)
abstracting: (p80<=0)
states: 73,999,512 (7)
abstracting: (p118<=p68)
states: 93,928,982 (7)
abstracting: (1<=p84)
states: 34,580,844 (7)
abstracting: (1<=p87)
states: 69,249,003 (7)
-> the formula is FALSE

FORMULA DES-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.788sec

checking: EF [[~ [[1<=p31 | [~ [[[[1<=p112 & p51<=p37] & ~ [p0<=p64]] & [[1<=p25 & 1<=p107] & [1<=p69 & p49<=0]]]] & [p101<=p29 | [[[~ [p60<=p16] & [p73<=p73 | 1<=p10]] & p88<=p52] & 1<=p53]]]]] | [1<=p45 & [[[[1<=p66 & [[p94<=0 | ~ [p29<=p55]] & p24<=p95]] | 1<=p86] & [[[[~ [1<=p57] & [p62<=1 & p5<=p78]] & ~ [p112<=p61]] & ~ [[~ [p118<=0] & ~ [1<=p30]]]] | ~ [[[p87<=p57 | [p34<=1 | p55<=0]] & [1<=p87 | [p9<=p83 & p59<=0]]]]]] | p23<=p31]]]]
normalized: E [true U [[1<=p45 & [p23<=p31 | [[~ [[[1<=p87 | [p9<=p83 & p59<=0]] & [p87<=p57 | [p34<=1 | p55<=0]]]] | [~ [[~ [1<=p30] & ~ [p118<=0]]] & [~ [p112<=p61] & [[p62<=1 & p5<=p78] & ~ [1<=p57]]]]] & [1<=p86 | [1<=p66 & [p24<=p95 & [p94<=0 | ~ [p29<=p55]]]]]]]] | ~ [[1<=p31 | [[p101<=p29 | [1<=p53 & [p88<=p52 & [[p73<=p73 | 1<=p10] & ~ [p60<=p16]]]]] & ~ [[[[1<=p69 & p49<=0] & [1<=p25 & 1<=p107]] & [~ [p0<=p64] & [1<=p112 & p51<=p37]]]]]]]]]

abstracting: (p51<=p37)
states: 71,727,000 (7)
abstracting: (1<=p112)
states: 22,904,732 (7)
abstracting: (p0<=p64)
states: 108,580,355 (8)
abstracting: (1<=p107)
states: 4,726,633 (6)
abstracting: (1<=p25)
states: 35,497,022 (7)
abstracting: (p49<=0)
states: 71,727,000 (7)
abstracting: (1<=p69)
states: 36,853,356 (7)
abstracting: (p60<=p16)
states: 108,580,356 (8)
abstracting: (1<=p10)
states: 37,225,674 (7)
abstracting: (p73<=p73)
states: 108,580,356 (8)
abstracting: (p88<=p52)
states: 97,053,408 (7)
abstracting: (1<=p53)
states: 36,853,356 (7)
abstracting: (p101<=p29)
states: 108,557,178 (8)
abstracting: (1<=p31)
states: 18,608,845 (7)
abstracting: (p29<=p55)
states: 92,703,849 (7)
abstracting: (p94<=0)
states: 103,892,632 (8)
abstracting: (p24<=p95)
states: 103,346,775 (8)
abstracting: (1<=p66)
states: 71,726,999 (7)
abstracting: (1<=p86)
states: 34,580,844 (7)
abstracting: (1<=p57)
states: 36,853,356 (7)
abstracting: (p5<=p78)
states: 49,785,030 (7)
abstracting: (p62<=1)
states: 108,580,356 (8)
abstracting: (p112<=p61)
states: 93,453,248 (7)
abstracting: (p118<=0)
states: 65,422,771 (7)
abstracting: (1<=p30)
states: 89,971,510 (7)
abstracting: (p55<=0)
states: 71,727,000 (7)
abstracting: (p34<=1)
states: 108,580,356 (8)
abstracting: (p87<=p57)
states: 62,385,249 (7)
abstracting: (p59<=0)
states: 71,727,000 (7)
abstracting: (p9<=p83)
states: 95,113,064 (7)
abstracting: (1<=p87)
states: 69,249,003 (7)
abstracting: (p23<=p31)
states: 102,074,252 (8)
abstracting: (1<=p45)
states: 36,853,356 (7)
-> the formula is TRUE

FORMULA DES-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.805sec

checking: AG [[[[~ [[[~ [[p2<=0 | p66<=p49]] & [1<=p16 | 1<=p96]] & ~ [[[[1<=p62 | 1<=p83] & [1<=p107 | 1<=p97]] | p104<=1]]]] | [1<=p51 & [[[[[1<=p79 | 1<=p54] | [1<=p90 & p86<=1]] & ~ [[p82<=0 & 1<=p11]]] & [[[p29<=p6 | p69<=p97] | ~ [p92<=0]] | [[p31<=1 & p106<=p17] & p77<=p31]]] | p62<=p83]]] | ~ [[[~ [p49<=p29] | [~ [[p107<=1 | p17<=1]] | [[~ [p17<=p118] | [1<=p104 & p74<=1]] & [[p44<=0 | p54<=0] | p43<=p24]]]] & p38<=p108]]] | [~ [[p88<=p100 & [[p42<=0 | p0<=p29] & [p106<=1 & [[p117<=0 & p74<=p29] & ~ [[p24<=0 & p52<=1]]]]]]] | ~ [[[[[[p95<=1 & [p3<=0 & p106<=p40]] | [[p27<=p57 | p9<=p56] & [1<=p82 | 1<=p70]]] | [[[1<=p72 & p63<=p47] | 1<=p2] | p19<=0]] | p41<=0] & ~ [[[[[p12<=p50 | p98<=1] & ~ [1<=p94]] | p101<=0] | ~ [[[p58<=p118 & 1<=p112] & ~ [p67<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[~ [[~ [p67<=1] & [p58<=p118 & 1<=p112]]] | [p101<=0 | [~ [1<=p94] & [p12<=p50 | p98<=1]]]]] & [p41<=0 | [[p19<=0 | [1<=p2 | [1<=p72 & p63<=p47]]] | [[[1<=p82 | 1<=p70] & [p27<=p57 | p9<=p56]] | [p95<=1 & [p3<=0 & p106<=p40]]]]]]] | ~ [[p88<=p100 & [[p106<=1 & [~ [[p24<=0 & p52<=1]] & [p117<=0 & p74<=p29]]] & [p42<=0 | p0<=p29]]]]] | [~ [[p38<=p108 & [[[[p43<=p24 | [p44<=0 | p54<=0]] & [[1<=p104 & p74<=1] | ~ [p17<=p118]]] | ~ [[p107<=1 | p17<=1]]] | ~ [p49<=p29]]]] | [[1<=p51 & [p62<=p83 | [[[p77<=p31 & [p31<=1 & p106<=p17]] | [~ [p92<=0] | [p29<=p6 | p69<=p97]]] & [~ [[p82<=0 & 1<=p11]] & [[1<=p90 & p86<=1] | [1<=p79 | 1<=p54]]]]]] | ~ [[~ [[p104<=1 | [[1<=p107 | 1<=p97] & [1<=p62 | 1<=p83]]]] & [[1<=p16 | 1<=p96] & ~ [[p2<=0 | p66<=p49]]]]]]]]]]]

abstracting: (p66<=p49)
states: 61,043,509 (7)
abstracting: (p2<=0)
states: 108,579,512 (8)
abstracting: (1<=p96)
states: 108,482,910 (8)
abstracting: (1<=p16)
states: 108,580,355 (8)
abstracting: (1<=p83)
states: 69,249,003 (7)
abstracting: (1<=p62)
states: 71,726,999 (7)
abstracting: (1<=p97)
states: 97,445 (4)
abstracting: (1<=p107)
states: 4,726,633 (6)
abstracting: (p104<=1)
states: 108,580,356 (8)
abstracting: (1<=p54)
states: 71,726,999 (7)
abstracting: (1<=p79)
states: 69,249,003 (7)
abstracting: (p86<=1)
states: 108,580,356 (8)
abstracting: (1<=p90)
states: 34,580,844 (7)
abstracting: (1<=p11)
states: 34,129,003 (7)
abstracting: (p82<=0)
states: 73,999,512 (7)
abstracting: (p69<=p97)
states: 71,727,000 (7)
abstracting: (p29<=p6)
states: 90,157,348 (7)
abstracting: (p92<=0)
states: 104,374,028 (8)
abstracting: (p106<=p17)
states: 108,262,180 (8)
abstracting: (p31<=1)
states: 108,580,356 (8)
abstracting: (p77<=p31)
states: 51,210,210 (7)
abstracting: (p62<=p83)
states: 83,048,464 (7)
abstracting: (1<=p51)
states: 36,853,356 (7)
abstracting: (p49<=p29)
states: 79,873,276 (7)
abstracting: (p17<=1)
states: 108,580,356 (8)
abstracting: (p107<=1)
states: 108,580,356 (8)
abstracting: (p17<=p118)
states: 50,525,397 (7)
abstracting: (p74<=1)
states: 108,580,356 (8)
abstracting: (1<=p104)
states: 13,336,176 (7)
abstracting: (p54<=0)
states: 36,853,357 (7)
abstracting: (p44<=0)
states: 36,853,357 (7)
abstracting: (p43<=p24)
states: 53,413,772 (7)
abstracting: (p38<=p108)
states: 59,621,445 (7)
abstracting: (p0<=p29)
states: 108,580,355 (8)
abstracting: (p42<=0)
states: 58,283,554 (7)
abstracting: (p74<=p29)
states: 52,729,864 (7)
abstracting: (p117<=0)
states: 86,314,287 (7)
abstracting: (p52<=1)
states: 108,580,356 (8)
abstracting: (p24<=0)
states: 103,340,843 (8)
abstracting: (p106<=1)
states: 108,580,356 (8)
abstracting: (p88<=p100)
states: 91,902,294 (7)
abstracting: (p106<=p40)
states: 108,575,808 (8)
abstracting: (p3<=0)
states: 108,571,928 (8)
abstracting: (p95<=1)
states: 108,580,356 (8)
abstracting: (p9<=p56)
states: 95,954,676 (7)
abstracting: (p27<=p57)
states: 103,080,345 (8)
abstracting: (1<=p70)
states: 71,726,999 (7)
abstracting: (1<=p82)
states: 34,580,844 (7)
abstracting: (p63<=p47)
states: 71,727,000 (7)
abstracting: (1<=p72)
states: 71,726,999 (7)
abstracting: (1<=p2)
states: 844
abstracting: (p19<=0)
states: 54,357,440 (7)
abstracting: (p41<=0)
states: 108,546,790 (8)
abstracting: (p98<=1)
states: 108,580,356 (8)
abstracting: (p12<=p50)
states: 103,945,236 (8)
abstracting: (1<=p94)
states: 4,687,724 (6)
abstracting: (p101<=0)
states: 108,549,535 (8)
abstracting: (1<=p112)
states: 22,904,732 (7)
abstracting: (p58<=p118)
states: 65,359,568 (7)
abstracting: (p67<=1)
states: 108,580,356 (8)
-> the formula is TRUE

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

MC time: 0m 0.518sec

totally nodes used: 3246655 (3.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2270610 13655991 15926601
used/not used/entry size/cache size: 13828887 53279977 16 1024MB
basic ops cache: hits/miss/sum: 997965 6414968 7412933
used/not used/entry size/cache size: 7703645 9073571 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: 121234 718403 839637
used/not used/entry size/cache size: 689165 7699443 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 64158936
1 2690529
2 226022
3 29758
4 3310
5 287
6 21
7 1
8 0
9 0
>= 10 0

Total processing time: 0m11.773sec


BK_STOP 1678378182546

--------------------
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:1792 (23), effective:197 (2)

initing FirstDep: 0m 0.000sec


iterations count:845 (11), effective:78 (1)

iterations count:1064 (14), effective:111 (1)

iterations count:1088 (14), effective:115 (1)

iterations count:842 (11), effective:83 (1)

iterations count:1185 (15), effective:132 (1)

iterations count:1178 (15), effective:129 (1)

iterations count:940 (12), effective:101 (1)

iterations count:1121 (14), effective:115 (1)

iterations count:1073 (14), effective:112 (1)

iterations count:1111 (14), effective:119 (1)

iterations count:982 (12), effective:104 (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="DES-PT-01a"
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 DES-PT-01a, 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-167814482600366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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