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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8619.336 134497.00 139398.00 760.20 TFFFTTFFFFTTTFFF 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-167814482700414.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 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.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 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 43K 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-10a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678387598189

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-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 18:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 18:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 18:46:39] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-09 18:46:39] [INFO ] Transformed 155 places.
[2023-03-09 18:46:39] [INFO ] Transformed 112 transitions.
[2023-03-09 18:46:39] [INFO ] Found NUPN structural information;
[2023-03-09 18:46:39] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 225 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :6
FORMULA DES-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 98 rows 155 cols
[2023-03-09 18:46:40] [INFO ] Computed 59 place invariants in 12 ms
[2023-03-09 18:46:40] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 18:46:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 18:46:40] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:46:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 18:46:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-09 18:46:40] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 18:46:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 18:46:41] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 18:46:41] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-09 18:46:41] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 23 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 154 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 154 transition count 96
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 154 transition count 96
Applied a total of 6 rules in 41 ms. Remains 154 /155 variables (removed 1) and now considering 96/98 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 154/155 places, 96/98 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1094548 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1094548 steps, saw 149972 distinct states, run finished after 3002 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 154 cols
[2023-03-09 18:46:44] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 18:46:44] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 18:46:44] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 18:46:44] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:46:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 18:46:44] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-09 18:46:44] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 18:46:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 18:46:44] [INFO ] After 40ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 18:46:44] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-09 18:46:44] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 606 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=202 )
FORMULA DES-PT-10a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 11 ms.
All properties solved without resorting to model-checking.
Total runtime 5138 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_10a
(NrP: 155 NrTr: 112 NrArc: 552)

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

net check time: 0m 0.000sec

init dd package: 0m 2.708sec


RS generation: 0m 5.283sec


-> reachability set: #nodes 102633 (1.0e+05) #states 1,600,305,869,653 (12)



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

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

abstracting: (p81<=0)
states: 1,012,857,873,225 (12)
-> the formula is FALSE

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

MC time: 0m12.492sec

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

abstracting: (p28<=1)
states: 1,600,305,869,653 (12)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (p81<=1)
states: 1,600,305,869,653 (12)
-> the formula is TRUE

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

MC time: 0m 0.061sec

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

abstracting: (p149<=p106)
states: 1,541,003,128,061 (12)
-> the formula is FALSE

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

MC time: 0m14.319sec

checking: AG [[p117<=1 | p30<=p31]]
normalized: ~ [E [true U ~ [[p117<=1 | p30<=p31]]]]

abstracting: (p30<=p31)
states: 1,548,574,638,841 (12)
abstracting: (p117<=1)
states: 1,600,305,869,653 (12)
-> the formula is TRUE

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

MC time: 0m 0.137sec

checking: EF [[[~ [1<=p147] & ~ [p20<=1]] | 1<=p15]]
normalized: E [true U [1<=p15 | [~ [p20<=1] & ~ [1<=p147]]]]

abstracting: (1<=p147)
states: 380,114,646,657 (11)
abstracting: (p20<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p15)
states: 216,317,008,320 (11)
-> the formula is TRUE

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

MC time: 0m 4.793sec

checking: AG [[[[p96<=0 | [p33<=p122 | ~ [p9<=p138]]] | ~ [p10<=0]] | p137<=1]]
normalized: ~ [E [true U ~ [[p137<=1 | [~ [p10<=0] | [p96<=0 | [p33<=p122 | ~ [p9<=p138]]]]]]]]

abstracting: (p9<=p138)
states: 1,485,864,766,684 (12)
abstracting: (p33<=p122)
states: 1,495,309,213,561 (12)
abstracting: (p96<=0)
states: 587,447,996,429 (11)
abstracting: (p10<=0)
states: 1,507,855,477,469 (12)
abstracting: (p137<=1)
states: 1,600,305,869,653 (12)
-> the formula is TRUE

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

MC time: 0m 0.358sec

checking: EF [~ [[[p48<=p116 | [p37<=0 | ~ [[p73<=0 & [p71<=p51 | p102<=1]]]]] | p4<=1]]]
normalized: E [true U ~ [[p4<=1 | [p48<=p116 | [p37<=0 | ~ [[p73<=0 & [p71<=p51 | p102<=1]]]]]]]]

abstracting: (p102<=1)
states: 1,600,305,869,653 (12)
abstracting: (p71<=p51)
states: 1,125,822,058,493 (12)
abstracting: (p73<=0)
states: 1,064,486,692,580 (12)
abstracting: (p37<=0)
states: 1,382,895,603,117 (12)
abstracting: (p48<=p116)
states: 1,244,467,514,353 (12)
abstracting: (p4<=1)
states: 1,600,305,869,653 (12)
-> the formula is FALSE

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

MC time: 0m 0.322sec

checking: EF [[~ [[~ [[[[1<=p124 & [p37<=p152 | p42<=p110]] & 1<=p13] & [[p12<=0 & [p66<=0 & p110<=p5]] | ~ [1<=p43]]]] & p102<=p39]] & [1<=p129 | ~ [[~ [[~ [[[p80<=p71 | 1<=p70] | ~ [1<=p88]]] | p55<=0]] | p15<=p37]]]]]
normalized: E [true U [[1<=p129 | ~ [[p15<=p37 | ~ [[p55<=0 | ~ [[~ [1<=p88] | [p80<=p71 | 1<=p70]]]]]]]] & ~ [[p102<=p39 & ~ [[[~ [1<=p43] | [p12<=0 & [p66<=0 & p110<=p5]]] & [1<=p13 & [1<=p124 & [p37<=p152 | p42<=p110]]]]]]]]]

abstracting: (p42<=p110)
states: 1,320,181,115,465 (12)
abstracting: (p37<=p152)
states: 1,522,564,894,957 (12)
abstracting: (1<=p124)
states: 533,102,181,777 (11)
abstracting: (1<=p13)
states: 217,410,166,516 (11)
abstracting: (p110<=p5)
states: 724,424,694,221 (11)
abstracting: (p66<=0)
states: 810,642,385,835 (11)
abstracting: (p12<=0)
states: 1,383,292,630,449 (12)
abstracting: (1<=p43)
states: 802,037,760,028 (11)
abstracting: (p102<=p39)
states: 694,600,789,367 (11)
abstracting: (1<=p70)
states: 844,534,003,286 (11)
abstracting: (p80<=p71)
states: 1,065,786,772,637 (12)
abstracting: (1<=p88)
states: 1,012,857,873,224 (12)
abstracting: (p55<=0)
states: 1,181,766,269,731 (12)
abstracting: (p15<=p37)
states: 1,451,738,198,601 (12)
abstracting: (1<=p129)
states: 50,670,080,931 (10)
-> the formula is TRUE

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

MC time: 0m21.052sec

checking: AG [[~ [[[~ [1<=p147] & ~ [p12<=p45]] | [1<=p38 | [~ [p11<=1] & ~ [1<=p8]]]]] | [[~ [p134<=0] | [[[1<=p16 | [[[1<=p144 | p129<=p76] & [p35<=1 | 1<=p111]] | [~ [p67<=p63] & ~ [p43<=p79]]]] & [p24<=0 & p27<=0]] & 1<=p37]] & p14<=0]]]
normalized: ~ [E [true U ~ [[[p14<=0 & [[1<=p37 & [[p24<=0 & p27<=0] & [1<=p16 | [[~ [p43<=p79] & ~ [p67<=p63]] | [[p35<=1 | 1<=p111] & [1<=p144 | p129<=p76]]]]]] | ~ [p134<=0]]] | ~ [[[1<=p38 | [~ [1<=p8] & ~ [p11<=1]]] | [~ [p12<=p45] & ~ [1<=p147]]]]]]]]

abstracting: (1<=p147)
states: 380,114,646,657 (11)
abstracting: (p12<=p45)
states: 1,455,752,093,559 (12)
abstracting: (p11<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p8)
states: 203,602,876,310 (11)
abstracting: (1<=p38)
states: 210,097,347,675 (11)
abstracting: (p134<=0)
states: 1,427,737,907,736 (12)
abstracting: (p129<=p76)
states: 1,596,641,894,600 (12)
abstracting: (1<=p144)
states: 160,097,934,051 (11)
abstracting: (1<=p111)
states: 587,447,996,428 (11)
abstracting: (p35<=1)
states: 1,600,305,869,653 (12)
abstracting: (p67<=p63)
states: 950,437,310,563 (11)
abstracting: (p43<=p79)
states: 1,308,170,650,939 (12)
abstracting: (1<=p16)
states: 206,269,852,760 (11)
abstracting: (p27<=0)
states: 1,422,781,595,813 (12)
abstracting: (p24<=0)
states: 1,422,781,595,813 (12)
abstracting: (1<=p37)
states: 217,410,266,536 (11)
abstracting: (p14<=0)
states: 1,382,897,061,557 (12)
-> the formula is FALSE

FORMULA DES-PT-10a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.577sec

checking: AG [[~ [[~ [p12<=p93] & [[~ [p44<=p46] & ~ [[[1<=p112 | 1<=p73] | [p131<=p151 | 1<=p144]]]] | [p60<=0 & [[~ [1<=p62] & [~ [p64<=p114] | [p2<=p119 | p6<=p22]]] & [[[1<=p117 & p63<=p81] & ~ [p94<=0]] | p36<=0]]]]]] | 1<=p131]]
normalized: ~ [E [true U ~ [[1<=p131 | ~ [[[[~ [[[p131<=p151 | 1<=p144] | [1<=p112 | 1<=p73]]] & ~ [p44<=p46]] | [p60<=0 & [[p36<=0 | [~ [p94<=0] & [1<=p117 & p63<=p81]]] & [[[p2<=p119 | p6<=p22] | ~ [p64<=p114]] & ~ [1<=p62]]]]] & ~ [p12<=p93]]]]]]]

abstracting: (p12<=p93)
states: 1,463,592,388,661 (12)
abstracting: (1<=p62)
states: 430,660,274,358 (11)
abstracting: (p64<=p114)
states: 1,335,424,427,901 (12)
abstracting: (p6<=p22)
states: 1,407,095,204,129 (12)
abstracting: (p2<=p119)
states: 1,578,996,185,489 (12)
abstracting: (p63<=p81)
states: 1,372,072,667,049 (12)
abstracting: (1<=p117)
states: 957,014,919,151 (11)
abstracting: (p94<=0)
states: 587,447,996,429 (11)
abstracting: (p36<=0)
states: 1,382,898,198,429 (12)
abstracting: (p60<=0)
states: 1,304,843,747,859 (12)
abstracting: (p44<=p46)
states: 1,067,243,391,194 (12)
abstracting: (1<=p73)
states: 535,819,177,073 (11)
abstracting: (1<=p112)
states: 533,102,181,777 (11)
abstracting: (1<=p144)
states: 160,097,934,051 (11)
abstracting: (p131<=p151)
states: 1,591,180,173,106 (12)
abstracting: (1<=p131)
states: 9,583,332,983 (9)
-> the formula is FALSE

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

MC time: 0m12.517sec

checking: AG [[p85<=p126 & ~ [[[[~ [[1<=p73 | 1<=p58]] | [~ [[p126<=1 & 1<=p20]] & [[p26<=p92 | 1<=p139] | ~ [1<=p17]]]] & p81<=0] & [[[[[p61<=p136 | p93<=0] & [p37<=1 | p0<=0]] | [~ [1<=p113] & [1<=p115 | 1<=p98]]] | [[1<=p74 | ~ [p128<=1]] & [1<=p33 & [p143<=1 | 1<=p36]]]] & [[p106<=0 & ~ [p0<=p111]] & [[p36<=1 | ~ [p151<=p134]] & 1<=p144]]]]]]]
normalized: ~ [E [true U ~ [[p85<=p126 & ~ [[[[[1<=p144 & [p36<=1 | ~ [p151<=p134]]] & [p106<=0 & ~ [p0<=p111]]] & [[[1<=p33 & [p143<=1 | 1<=p36]] & [1<=p74 | ~ [p128<=1]]] | [[[1<=p115 | 1<=p98] & ~ [1<=p113]] | [[p37<=1 | p0<=0] & [p61<=p136 | p93<=0]]]]] & [p81<=0 & [[[~ [1<=p17] | [p26<=p92 | 1<=p139]] & ~ [[p126<=1 & 1<=p20]]] | ~ [[1<=p73 | 1<=p58]]]]]]]]]]

abstracting: (1<=p58)
states: 382,820,246,214 (11)
abstracting: (1<=p73)
states: 535,819,177,073 (11)
abstracting: (1<=p20)
states: 3,506,780,078 (9)
abstracting: (p126<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p139)
states: 354,935,234,730 (11)
abstracting: (p26<=p92)
states: 1,535,142,237,429 (12)
abstracting: (1<=p17)
states: 169,861,413,517 (11)
abstracting: (p81<=0)
states: 1,012,857,873,225 (12)
abstracting: (p93<=0)
states: 1,012,857,873,225 (12)
abstracting: (p61<=p136)
states: 1,326,272,720,841 (12)
abstracting: (p0<=0)
states: 1,600,305,869,652 (12)
abstracting: (p37<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p113)
states: 957,014,919,151 (11)
abstracting: (1<=p98)
states: 1,012,857,873,224 (12)
abstracting: (1<=p115)
states: 957,014,919,151 (11)
abstracting: (p128<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p74)
states: 538,983,987,148 (11)
abstracting: (1<=p36)
states: 217,407,671,224 (11)
abstracting: (p143<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p33)
states: 156,713,283,696 (11)
abstracting: (p0<=p111)
states: 1,600,305,869,652 (12)
abstracting: (p106<=0)
states: 587,447,996,429 (11)
abstracting: (p151<=p134)
states: 1,352,512,813,376 (12)
abstracting: (p36<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p144)
states: 160,097,934,051 (11)
abstracting: (p85<=p126)
states: 1,214,950,664,922 (12)
-> the formula is FALSE

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

MC time: 0m 7.276sec

checking: AG [[p122<=p130 | [~ [p16<=0] | [[~ [[p12<=0 | ~ [[[p152<=1 | p42<=p109] & [p24<=0 & p22<=p130]]]]] & [[[[~ [p67<=1] & ~ [1<=p75]] & ~ [[p57<=p42 | p14<=0]]] & p153<=0] | 1<=p67]] & [[~ [p105<=p80] | [~ [1<=p95] | ~ [[[p2<=0 & 1<=p32] & [p12<=p50 | p43<=p51]]]]] | [[~ [[[1<=p23 | p85<=p91] | ~ [p28<=p86]]] | ~ [p142<=0]] & [[1<=p149 & p65<=p89] | 1<=p55]]]]]]]
normalized: ~ [E [true U ~ [[p122<=p130 | [[[[[1<=p55 | [1<=p149 & p65<=p89]] & [~ [p142<=0] | ~ [[~ [p28<=p86] | [1<=p23 | p85<=p91]]]]] | [[~ [[[p12<=p50 | p43<=p51] & [p2<=0 & 1<=p32]]] | ~ [1<=p95]] | ~ [p105<=p80]]] & [[1<=p67 | [p153<=0 & [~ [[p57<=p42 | p14<=0]] & [~ [1<=p75] & ~ [p67<=1]]]]] & ~ [[p12<=0 | ~ [[[p24<=0 & p22<=p130] & [p152<=1 | p42<=p109]]]]]]] | ~ [p16<=0]]]]]]

abstracting: (p16<=0)
states: 1,394,036,016,893 (12)
abstracting: (p42<=p109)
states: 1,116,874,593,757 (12)
abstracting: (p152<=1)
states: 1,600,305,869,653 (12)
abstracting: (p22<=p130)
states: 1,433,937,194,651 (12)
abstracting: (p24<=0)
states: 1,422,781,595,813 (12)
abstracting: (p12<=0)
states: 1,383,292,630,449 (12)
abstracting: (p67<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p75)
states: 1,061,321,882,504 (12)
abstracting: (p14<=0)
states: 1,382,897,061,557 (12)
abstracting: (p57<=p42)
states: 1,395,496,062,463 (12)
abstracting: (p153<=0)
states: 602,634,285,201 (11)
abstracting: (1<=p67)
states: 810,642,385,834 (11)
abstracting: (p105<=p80)
states: 1,371,025,003,913 (12)
abstracting: (1<=p95)
states: 587,447,996,428 (11)
abstracting: (1<=p32)
states: 88,963,946,428 (10)
abstracting: (p2<=0)
states: 1,544,577,726,441 (12)
abstracting: (p43<=p51)
states: 1,096,562,912,171 (12)
abstracting: (p12<=p50)
states: 1,523,294,642,469 (12)
abstracting: (p85<=p91)
states: 1,242,138,738,965 (12)
abstracting: (1<=p23)
states: 177,524,273,840 (11)
abstracting: (p28<=p86)
states: 1,537,362,433,389 (12)
abstracting: (p142<=0)
states: 1,105,444,505,540 (12)
abstracting: (p65<=p89)
states: 1,350,968,758,709 (12)
abstracting: (1<=p149)
states: 167,289,650,043 (11)
abstracting: (1<=p55)
states: 418,539,599,922 (11)
abstracting: (p122<=p130)
states: 1,067,203,687,876 (12)
-> the formula is FALSE

FORMULA DES-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.069sec

checking: AG [[[~ [[[~ [[p47<=0 & ~ [[p76<=0 | p117<=p28]]]] & [[[[p8<=p106 & p94<=p99] | ~ [p87<=0]] & [p127<=0 | [1<=p123 & p101<=p117]]] & [[~ [p14<=p141] & ~ [1<=p64]] & [~ [p145<=0] & [1<=p19 & p26<=p28]]]]] & [[[p118<=1 & [~ [1<=p100] | [p125<=0 & 1<=p101]]] | [[[1<=p22 & p22<=p30] | [p154<=p74 | 1<=p40]] & p0<=p47]] & p72<=p58]]] | [~ [[p27<=1 | [~ [1<=p145] & [~ [1<=p138] | [p33<=1 & p39<=1]]]]] | 1<=p39]] | [[1<=p25 | ~ [p71<=0]] | p55<=1]]]
normalized: ~ [E [true U ~ [[[p55<=1 | [1<=p25 | ~ [p71<=0]]] | [[1<=p39 | ~ [[p27<=1 | [[[p33<=1 & p39<=1] | ~ [1<=p138]] & ~ [1<=p145]]]]] | ~ [[[p72<=p58 & [[p0<=p47 & [[p154<=p74 | 1<=p40] | [1<=p22 & p22<=p30]]] | [p118<=1 & [[p125<=0 & 1<=p101] | ~ [1<=p100]]]]] & [[[[[1<=p19 & p26<=p28] & ~ [p145<=0]] & [~ [1<=p64] & ~ [p14<=p141]]] & [[p127<=0 | [1<=p123 & p101<=p117]] & [~ [p87<=0] | [p8<=p106 & p94<=p99]]]] & ~ [[p47<=0 & ~ [[p76<=0 | p117<=p28]]]]]]]]]]]]

abstracting: (p117<=p28)
states: 745,831,699,692 (11)
abstracting: (p76<=0)
states: 118,117,225,732 (11)
abstracting: (p47<=0)
states: 1,062,531,024,525 (12)
abstracting: (p94<=p99)
states: 945,615,127,117 (11)
abstracting: (p8<=p106)
states: 1,525,363,140,129 (12)
abstracting: (p87<=0)
states: 1,012,857,873,225 (12)
abstracting: (p101<=p117)
states: 1,509,371,958,345 (12)
abstracting: (1<=p123)
states: 957,014,919,151 (11)
abstracting: (p127<=0)
states: 643,290,950,502 (11)
abstracting: (p14<=p141)
states: 1,393,394,072,405 (12)
abstracting: (1<=p64)
states: 397,126,357,432 (11)
abstracting: (p145<=0)
states: 1,334,419,941,068 (12)
abstracting: (p26<=p28)
states: 1,422,781,595,813 (12)
abstracting: (1<=p19)
states: 37,524,807,111 (10)
abstracting: (1<=p100)
states: 1,012,857,873,224 (12)
abstracting: (1<=p101)
states: 587,447,996,428 (11)
abstracting: (p125<=0)
states: 643,290,950,502 (11)
abstracting: (p118<=1)
states: 1,600,305,869,653 (12)
abstracting: (p22<=p30)
states: 1,422,781,595,813 (12)
abstracting: (1<=p22)
states: 177,524,273,840 (11)
abstracting: (1<=p40)
states: 91,248,935,068 (10)
abstracting: (p154<=p74)
states: 1,397,420,012,377 (12)
abstracting: (p0<=p47)
states: 1,600,305,869,652 (12)
abstracting: (p72<=p58)
states: 790,559,404,426 (11)
abstracting: (1<=p145)
states: 265,885,928,585 (11)
abstracting: (1<=p138)
states: 497,010,864,384 (11)
abstracting: (p39<=1)
states: 1,600,305,869,653 (12)
abstracting: (p33<=1)
states: 1,600,305,869,653 (12)
abstracting: (p27<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p39)
states: 170,156,033,251 (11)
abstracting: (p71<=0)
states: 844,534,003,287 (11)
abstracting: (1<=p25)
states: 177,524,273,840 (11)
abstracting: (p55<=1)
states: 1,600,305,869,653 (12)
-> the formula is TRUE

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

MC time: 0m 2.310sec

checking: EF [[[[p30<=p7 | ~ [[~ [[[1<=p121 & ~ [p83<=p85]] & [[p7<=p101 | p42<=1] & [p60<=1 | 1<=p141]]]] & ~ [p70<=0]]]] | ~ [p125<=0]] & [[[p10<=p69 & [[~ [[p70<=p22 | p144<=1]] & p134<=p28] & 1<=p37]] & p51<=p71] & [[p98<=1 | [~ [[[p124<=p120 & 1<=p34] | [p125<=0 & 1<=p69]]] & ~ [p82<=p114]]] & [[[[1<=p25 & [1<=p114 & 1<=p81]] | [[p45<=p96 | p146<=1] | 1<=p116]] | ~ [1<=p2]] & [[[[[p19<=p64 | p105<=0] | [p40<=p70 | 1<=p147]] & 1<=p80] & ~ [[~ [p114<=0] & ~ [p74<=1]]]] & ~ [[~ [[p32<=0 | 1<=p0]] & ~ [p90<=p65]]]]]]]]]
normalized: E [true U [[[[[~ [[~ [p90<=p65] & ~ [[p32<=0 | 1<=p0]]]] & [~ [[~ [p74<=1] & ~ [p114<=0]]] & [1<=p80 & [[p40<=p70 | 1<=p147] | [p19<=p64 | p105<=0]]]]] & [~ [1<=p2] | [[1<=p116 | [p45<=p96 | p146<=1]] | [1<=p25 & [1<=p114 & 1<=p81]]]]] & [p98<=1 | [~ [p82<=p114] & ~ [[[p125<=0 & 1<=p69] | [p124<=p120 & 1<=p34]]]]]] & [p51<=p71 & [p10<=p69 & [1<=p37 & [p134<=p28 & ~ [[p70<=p22 | p144<=1]]]]]]] & [~ [p125<=0] | [p30<=p7 | ~ [[~ [p70<=0] & ~ [[[[p60<=1 | 1<=p141] & [p7<=p101 | p42<=1]] & [1<=p121 & ~ [p83<=p85]]]]]]]]]]

abstracting: (p83<=p85)
states: 1,242,138,738,965 (12)
abstracting: (1<=p121)
states: 957,014,919,151 (11)
abstracting: (p42<=1)
states: 1,600,305,869,653 (12)
abstracting: (p7<=p101)
states: 1,464,164,190,439 (12)
abstracting: (1<=p141)
states: 78,055,549,106 (10)
abstracting: (p60<=1)
states: 1,600,305,869,653 (12)
abstracting: (p70<=0)
states: 755,771,866,367 (11)
abstracting: (p30<=p7)
states: 1,555,346,337,607 (12)
abstracting: (p125<=0)
states: 643,290,950,502 (11)
abstracting: (p144<=1)
states: 1,600,305,869,653 (12)
abstracting: (p70<=p22)
states: 844,534,003,287 (11)
abstracting: (p134<=p28)
states: 1,446,227,485,106 (12)
abstracting: (1<=p37)
states: 217,410,266,536 (11)
abstracting: (p10<=p69)
states: 1,549,366,245,017 (12)
abstracting: (p51<=p71)
states: 1,285,969,745,230 (12)
abstracting: (1<=p34)
states: 200,860,215,370 (11)
abstracting: (p124<=p120)
states: 1,269,296,479,573 (12)
abstracting: (1<=p69)
states: 791,557,875,855 (11)
abstracting: (p125<=0)
states: 643,290,950,502 (11)
abstracting: (p82<=p114)
states: 1,083,962,081,549 (12)
abstracting: (p98<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p81)
states: 587,447,996,428 (11)
abstracting: (1<=p114)
states: 533,102,181,777 (11)
abstracting: (1<=p25)
states: 177,524,273,840 (11)
abstracting: (p146<=1)
states: 1,600,305,869,653 (12)
abstracting: (p45<=p96)
states: 1,405,361,358,003 (12)
abstracting: (1<=p116)
states: 533,102,181,777 (11)
abstracting: (1<=p2)
states: 55,728,143,212 (10)
abstracting: (p105<=0)
states: 1,012,857,873,225 (12)
abstracting: (p19<=p64)
states: 1,573,558,224,547 (12)
abstracting: (1<=p147)
states: 380,114,646,657 (11)
abstracting: (p40<=p70)
states: 1,557,174,201,063 (12)
abstracting: (1<=p80)
states: 1,012,857,873,224 (12)
abstracting: (p114<=0)
states: 1,067,203,687,876 (12)
abstracting: (p74<=1)
states: 1,600,305,869,653 (12)
abstracting: (1<=p0)
states: 1
abstracting: (p32<=0)
states: 1,511,341,923,225 (12)
abstracting: (p90<=p65)
states: 836,785,107,373 (11)
-> the formula is FALSE

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

MC time: 0m 2.662sec

checking: EF [[[[[1<=p45 | [1<=p134 | [1<=p45 & ~ [p140<=p49]]]] | p99<=p145] & [~ [[[~ [[~ [1<=p121] & ~ [p98<=p150]]] | ~ [p33<=0]] & [~ [[~ [p63<=0] | 1<=p85]] | [[~ [p154<=p50] | ~ [p152<=p154]] & [[p23<=p37 & p125<=0] & ~ [p132<=p89]]]]]] & [[[1<=p71 | [[~ [1<=p146] & ~ [1<=p79]] | [p69<=p108 | [1<=p70 | 1<=p75]]]] | [[[~ [p131<=p148] | ~ [p107<=p13]] | [[1<=p25 | p63<=p23] & [p48<=1 & p149<=p102]]] & ~ [[p144<=p23 & p69<=p50]]]] | ~ [[p1<=p8 | ~ [[1<=p38 & 1<=p148]]]]]]] & [~ [[[~ [p142<=p87] | p16<=p14] | ~ [[[~ [p113<=p26] | ~ [1<=p136]] & ~ [p98<=1]]]]] & ~ [p109<=p138]]]]
normalized: E [true U [[~ [p109<=p138] & ~ [[~ [[~ [p98<=1] & [~ [1<=p136] | ~ [p113<=p26]]]] | [p16<=p14 | ~ [p142<=p87]]]]] & [[[~ [[p1<=p8 | ~ [[1<=p38 & 1<=p148]]]] | [[~ [[p144<=p23 & p69<=p50]] & [[[p48<=1 & p149<=p102] & [1<=p25 | p63<=p23]] | [~ [p107<=p13] | ~ [p131<=p148]]]] | [1<=p71 | [[p69<=p108 | [1<=p70 | 1<=p75]] | [~ [1<=p79] & ~ [1<=p146]]]]]] & ~ [[[[[~ [p132<=p89] & [p23<=p37 & p125<=0]] & [~ [p152<=p154] | ~ [p154<=p50]]] | ~ [[1<=p85 | ~ [p63<=0]]]] & [~ [p33<=0] | ~ [[~ [p98<=p150] & ~ [1<=p121]]]]]]] & [p99<=p145 | [1<=p45 | [1<=p134 | [1<=p45 & ~ [p140<=p49]]]]]]]]

abstracting: (p140<=p49)
states: 1,575,237,502,378 (12)
abstracting: (1<=p45)
states: 531,265,512,264 (11)
abstracting: (1<=p134)
states: 172,567,961,917 (11)
abstracting: (1<=p45)
states: 531,265,512,264 (11)
abstracting: (p99<=p145)
states: 1,107,528,379,441 (12)
abstracting: (1<=p121)
states: 957,014,919,151 (11)
abstracting: (p98<=p150)
states: 776,801,045,049 (11)
abstracting: (p33<=0)
states: 1,443,592,585,957 (12)
abstracting: (p63<=0)
states: 1,239,912,664,455 (12)
abstracting: (1<=p85)
states: 587,447,996,428 (11)
abstracting: (p154<=p50)
states: 1,518,121,567,317 (12)
abstracting: (p152<=p154)
states: 858,443,507,050 (11)
abstracting: (p125<=0)
states: 643,290,950,502 (11)
abstracting: (p23<=p37)
states: 1,446,978,542,133 (12)
abstracting: (p132<=p89)
states: 675,725,085,286 (11)
abstracting: (1<=p146)
states: 380,114,646,657 (11)
abstracting: (1<=p79)
states: 1,017,718,802,431 (12)
abstracting: (1<=p75)
states: 1,061,321,882,504 (12)
abstracting: (1<=p70)
states: 844,534,003,286 (11)
abstracting: (p69<=p108)
states: 1,309,896,585,494 (12)
abstracting: (1<=p71)
states: 755,771,866,366 (11)
abstracting: (p131<=p148)
states: 1,593,289,137,057 (12)
abstracting: (p107<=p13)
states: 1,093,291,437,889 (12)
abstracting: (p63<=p23)
states: 1,280,954,676,491 (12)
abstracting: (1<=p25)
states: 177,524,273,840 (11)
abstracting: (p149<=p102)
states: 1,541,003,128,061 (12)
abstracting: (p48<=1)
states: 1,600,305,869,653 (12)
abstracting: (p69<=p50)
states: 1,304,354,881,860 (12)
abstracting: (p144<=p23)
states: 1,457,964,730,708 (12)
abstracting: (1<=p148)
states: 406,900,997,710 (11)
abstracting: (1<=p38)
states: 210,097,347,675 (11)
abstracting: (p1<=p8)
states: 1,568,461,172,851 (12)
abstracting: (p142<=p87)
states: 1,297,095,456,838 (12)
abstracting: (p16<=p14)
states: 1,394,036,016,893 (12)
abstracting: (p113<=p26)
states: 749,459,188,704 (11)
abstracting: (1<=p136)
states: 290,778,061,351 (11)
abstracting: (p98<=1)
states: 1,600,305,869,653 (12)
abstracting: (p109<=p138)
states: 1,193,854,288,190 (12)
-> the formula is FALSE

FORMULA DES-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.268sec

totally nodes used: 43776067 (4.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 83258753 245025710 328284463
used/not used/entry size/cache size: 65782159 1326705 16 1024MB
basic ops cache: hits/miss/sum: 18976006 60224914 79200920
used/not used/entry size/cache size: 16706774 70442 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: 1470129 4864954 6335083
used/not used/entry size/cache size: 3688130 4700478 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 36257806
1 20959655
2 7440253
3 1963131
4 406815
5 69610
6 10155
7 1275
8 141
9 19
>= 10 4

Total processing time: 2m 6.947sec


BK_STOP 1678387732686

--------------------
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:72986 (651), effective:8762 (78)

initing FirstDep: 0m 0.000sec


iterations count:5253 (46), effective:350 (3)

iterations count:17985 (160), effective:1900 (16)

iterations count:15145 (135), effective:1548 (13)

iterations count:9627 (85), effective:1083 (9)

iterations count:26473 (236), effective:2803 (25)

iterations count:34447 (307), effective:3773 (33)

iterations count:5272 (47), effective:352 (3)

iterations count:16824 (150), effective:1974 (17)

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-10a"
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-10a, 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-167814482700414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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