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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6017.955 44838.00 50704.00 562.60 TTTFTFTTFTFFTFTF 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-167814482700398.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-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:45 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.6K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:47 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 37K 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-05a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-05a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678384261079

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-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 17:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 17:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:51:02] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-09 17:51:02] [INFO ] Transformed 135 places.
[2023-03-09 17:51:02] [INFO ] Transformed 92 transitions.
[2023-03-09 17:51:02] [INFO ] Found NUPN structural information;
[2023-03-09 17:51:02] [INFO ] Parsed PT model containing 135 places and 92 transitions and 457 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-05a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 220 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 10) seen :8
FORMULA DES-PT-05a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :1
FORMULA DES-PT-05a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 135 cols
[2023-03-09 17:51:03] [INFO ] Computed 59 place invariants in 13 ms
[2023-03-09 17:51:03] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:51:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 17:51:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 17:51:03] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 17:51:03] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:03] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 17:51:03] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 78/78 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 135 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 134 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 134 transition count 75
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 134 transition count 75
Applied a total of 9 rules in 34 ms. Remains 134 /135 variables (removed 1) and now considering 75/78 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 134/135 places, 75/78 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2018131 steps, run timeout after 3001 ms. (steps per millisecond=672 ) properties seen :{}
Probabilistic random walk after 2018131 steps, saw 280462 distinct states, run finished after 3002 ms. (steps per millisecond=672 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 134 cols
[2023-03-09 17:51:06] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-09 17:51:06] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:51:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 17:51:06] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:51:06] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 17:51:06] [INFO ] After 21ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2023-03-09 17:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 17:51:06] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 17:51:06] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 75/75 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 134/134 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-09 17:51:06] [INFO ] Invariant cache hit.
[2023-03-09 17:51:06] [INFO ] Implicit Places using invariants in 87 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/134 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101 ms. Remains : 133/134 places, 75/75 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2192818 steps, run timeout after 3001 ms. (steps per millisecond=730 ) properties seen :{}
Probabilistic random walk after 2192818 steps, saw 305485 distinct states, run finished after 3001 ms. (steps per millisecond=730 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 133 cols
[2023-03-09 17:51:10] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 17:51:10] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:51:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 17:51:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:51:10] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 17:51:10] [INFO ] After 29ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:10] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2023-03-09 17:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 17:51:10] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 17:51:10] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 75/75 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 133/133 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-09 17:51:10] [INFO ] Invariant cache hit.
[2023-03-09 17:51:10] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-09 17:51:10] [INFO ] Invariant cache hit.
[2023-03-09 17:51:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 17:51:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-09 17:51:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 17:51:10] [INFO ] Invariant cache hit.
[2023-03-09 17:51:10] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 133/133 places, 75/75 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 75
Applied a total of 1 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 133 cols
[2023-03-09 17:51:10] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 17:51:10] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:51:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 17:51:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:51:10] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:10] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2023-03-09 17:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-09 17:51:10] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 17:51:10] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:51:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-09 17:51:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 75 transitions and 405 arcs took 2 ms.
[2023-03-09 17:51:11] [INFO ] Flatten gal took : 33 ms
Total runtime 8704 ms.
There are residual formulas that ITS could not solve within timeout
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_05a
(NrP: 133 NrTr: 75 NrArc: 405)

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

net check time: 0m 0.000sec

init dd package: 0m 2.708sec


RS generation: 0m25.939sec


-> reachability set: #nodes 1115000 (1.1e+06) #states 109,887,892,537 (11)



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

checking: AG [[[[[[[0<=p89 & p89<=0] & [p129<=1 & 1<=p129]] | [p30<=1 & 1<=p30]] | [0<=p11 & p11<=0]] | [[0<=p51 & p51<=0] | [1<=p54 & p54<=1]]] | [[[0<=p21 & p21<=0] | [1<=p116 & p116<=1]] | [[0<=p95 & p95<=0] | [1<=p112 & p112<=1]]]]]
normalized: ~ [E [true U ~ [[[[[0<=p95 & p95<=0] | [1<=p112 & p112<=1]] | [[0<=p21 & p21<=0] | [1<=p116 & p116<=1]]] | [[[1<=p54 & p54<=1] | [0<=p51 & p51<=0]] | [[0<=p11 & p11<=0] | [[p30<=1 & 1<=p30] | [[0<=p89 & p89<=0] & [p129<=1 & 1<=p129]]]]]]]]]

abstracting: (1<=p129)
states: 15,574,985,970 (10)
abstracting: (p129<=1)
states: 109,887,892,537 (11)
abstracting: (p89<=0)
states: 39,798,410,753 (10)
abstracting: (0<=p89)
states: 109,887,892,537 (11)
abstracting: (1<=p30)
states: 64,411,154,260 (10)
abstracting: (p30<=1)
states: 109,887,892,537 (11)
abstracting: (p11<=0)
states: 109,887,876,285 (11)
abstracting: (0<=p11)
states: 109,887,892,537 (11)
abstracting: (p51<=0)
states: 35,327,404,109 (10)
abstracting: (0<=p51)
states: 109,887,892,537 (11)
abstracting: (p54<=1)
states: 109,887,892,537 (11)
abstracting: (1<=p54)
states: 73,851,477,958 (10)
abstracting: (p116<=1)
states: 109,887,892,537 (11)
abstracting: (1<=p116)
states: 3,227,600,080 (9)
abstracting: (p21<=0)
states: 47,275,496,347 (10)
abstracting: (0<=p21)
states: 109,887,892,537 (11)
abstracting: (p112<=1)
states: 109,887,892,537 (11)
abstracting: (1<=p112)
states: 9,675,375,990 (9)
abstracting: (p95<=0)
states: 73,513,673,545 (10)
abstracting: (0<=p95)
states: 109,887,892,537 (11)
-> the formula is TRUE

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

MC time: 0m 1.761sec

totally nodes used: 7855026 (7.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11886753 78241181 90127934
used/not used/entry size/cache size: 47949971 19158893 16 1024MB
basic ops cache: hits/miss/sum: 776831 5342743 6119574
used/not used/entry size/cache size: 6300861 10476355 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: 256207 1551852 1808059
used/not used/entry size/cache size: 1418267 6970341 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 60349900
1 5842929
2 762629
3 130373
4 19887
5 2755
6 344
7 44
8 2
9 1
>= 10 0

Total processing time: 0m33.773sec


BK_STOP 1678384305917

--------------------
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:67367 (898), effective:7799 (103)

initing FirstDep: 0m 0.000sec

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

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