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

About the Execution of Marcie+red for ShieldIIPs-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10136.516 3277579.00 3348682.00 194.80 FTFFTFFFFTTFTFTF 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.r394-oct2-167903717400062.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-004B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 16:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 66K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679484611570

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=ShieldIIPs-PT-004B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:30:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:30:14] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-22 11:30:14] [INFO ] Transformed 243 places.
[2023-03-22 11:30:14] [INFO ] Transformed 239 transitions.
[2023-03-22 11:30:14] [INFO ] Found NUPN structural information;
[2023-03-22 11:30:14] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 17 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 12) seen :10
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 239 rows 243 cols
[2023-03-22 11:30:14] [INFO ] Computed 37 place invariants in 17 ms
[2023-03-22 11:30:15] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:30:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2023-03-22 11:30:15] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:30:15] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 30 ms to minimize.
[2023-03-22 11:30:15] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-22 11:30:15] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-22 11:30:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 873 ms
[2023-03-22 11:30:16] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-22 11:30:16] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 26 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 239/239 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 243 transition count 224
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 228 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 226 transition count 222
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 34 place count 226 transition count 203
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 72 place count 207 transition count 203
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 96 place count 183 transition count 179
Iterating global reduction 3 with 24 rules applied. Total rules applied 120 place count 183 transition count 179
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 120 place count 183 transition count 173
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 132 place count 177 transition count 173
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 220 place count 133 transition count 129
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 243 place count 133 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 132 transition count 128
Applied a total of 244 rules in 112 ms. Remains 132 /243 variables (removed 111) and now considering 128/239 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 132/243 places, 128/239 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1610248 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :{}
Probabilistic random walk after 1610248 steps, saw 273620 distinct states, run finished after 3011 ms. (steps per millisecond=534 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 132 cols
[2023-03-22 11:30:19] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-22 11:30:19] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:30:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2023-03-22 11:30:20] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:30:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 653 ms
[2023-03-22 11:30:20] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-22 11:30:20] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 128/128 transitions.
Applied a total of 0 rules in 15 ms. Remains 132 /132 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 132/132 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-22 11:30:20] [INFO ] Invariant cache hit.
[2023-03-22 11:30:20] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-22 11:30:20] [INFO ] Invariant cache hit.
[2023-03-22 11:30:21] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-22 11:30:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 11:30:21] [INFO ] Invariant cache hit.
[2023-03-22 11:30:21] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 759 ms. Remains : 132/132 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 11:30:21] [INFO ] Invariant cache hit.
[2023-03-22 11:30:21] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:30:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 11:30:21] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:30:21] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:30:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 533 ms
[2023-03-22 11:30:22] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 11:30:22] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 11:30:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 11:30:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 128 transitions and 521 arcs took 2 ms.
[2023-03-22 11:30:22] [INFO ] Flatten gal took : 35 ms
Total runtime 8653 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: ShieldIIPs_PT_004B
(NrP: 132 NrTr: 128 NrArc: 521)

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

net check time: 0m 0.000sec

init dd package: 0m 2.891sec


before gc: list nodes free: 1261322

after gc: idd nodes used:116065, unused:63883935; list nodes free:293059493

before gc: list nodes free: 835325

after gc: idd nodes used:139818, unused:63860182; list nodes free:292960348

before gc: list nodes free: 160968

after gc: idd nodes used:156667, unused:63843333; list nodes free:292881859

before gc: list nodes free: 1319826

after gc: idd nodes used:187825, unused:63812175; list nodes free:292744903

before gc: list nodes free: 640388

after gc: idd nodes used:219871, unused:63780129; list nodes free:292591861

before gc: list nodes free: 21182

after gc: idd nodes used:266177, unused:63733823; list nodes free:294461660

before gc: list nodes free: 1289751

after gc: idd nodes used:276862, unused:63723138; list nodes free:294431236

before gc: list nodes free: 973374

after gc: idd nodes used:288957, unused:63711043; list nodes free:294352914

before gc: list nodes free: 308501

after gc: idd nodes used:288423, unused:63711577; list nodes free:294381251

before gc: list nodes free: 2132024

after gc: idd nodes used:299990, unused:63700010; list nodes free:294333424

before gc: list nodes free: 1871057

after gc: idd nodes used:293967, unused:63706033; list nodes free:294361632

before gc: list nodes free: 1908585

after gc: idd nodes used:303591, unused:63696409; list nodes free:296408610

before gc: list nodes free: 4106099

after gc: idd nodes used:309172, unused:63690828; list nodes free:296387622

RS generation: 53m57.768sec


-> reachability set: #nodes 202004 (2.0e+05) #states 6,450,855,562,862,311 (15)



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

checking: AG [[[[p10<=0 & 0<=p10] | [p11<=1 & 1<=p11]] | [[p33<=1 & 1<=p33] | [[[[p129<=1 & 1<=p129] & [[p7<=0 & 0<=p7] & [p120<=0 & 0<=p120]]] & [[p127<=1 & 1<=p127] & [[[[0<=p5 & p5<=0] | [p105<=0 & 0<=p105]] | [[[p57<=0 & 0<=p57] & [p43<=1 & 1<=p43]] | [[p43<=0 & 0<=p43] & [p98<=1 & 1<=p98]]]] & [[p46<=1 & 1<=p46] | [[p73<=0 & 0<=p73] & [[p21<=1 & 1<=p21] & [[p30<=0 & 0<=p30] | [[[p84<=0 & 0<=p84] & [p92<=1 & 1<=p92]] | [[p116<=0 & 0<=p116] & [[p70<=1 & 1<=p70] & [p14<=0 & 0<=p14]]]]]]]]]]] | [[p3<=0 & 0<=p3] & [[[p103<=0 & 0<=p103] | [p36<=1 & 1<=p36]] & [[p6<=0 & 0<=p6] | [p71<=1 & 1<=p71]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p73<=0 & 0<=p73] & [[[p30<=0 & 0<=p30] | [[[p84<=0 & 0<=p84] & [p92<=1 & 1<=p92]] | [[p116<=0 & 0<=p116] & [[p70<=1 & 1<=p70] & [p14<=0 & 0<=p14]]]]] & [p21<=1 & 1<=p21]]] | [p46<=1 & 1<=p46]] & [[[[p98<=1 & 1<=p98] & [p43<=0 & 0<=p43]] | [[p43<=1 & 1<=p43] & [p57<=0 & 0<=p57]]] | [[p105<=0 & 0<=p105] | [0<=p5 & p5<=0]]]] & [p127<=1 & 1<=p127]] & [[[p120<=0 & 0<=p120] & [p7<=0 & 0<=p7]] & [p129<=1 & 1<=p129]]] | [[p3<=0 & 0<=p3] & [[[p103<=0 & 0<=p103] | [p36<=1 & 1<=p36]] & [[p6<=0 & 0<=p6] | [p71<=1 & 1<=p71]]]]] | [p33<=1 & 1<=p33]] | [[p11<=1 & 1<=p11] | [p10<=0 & 0<=p10]]]]]]

abstracting: (0<=p10)
states: 6,450,855,562,862,311 (15)
abstracting: (p10<=0)
states: 3,199,637,371,137,289 (15)
abstracting: (1<=p11)
states: 1,091,700,980,286,790 (15)
abstracting: (p11<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (1<=p33)
states: 1,085,197,144,686,150 (15)
abstracting: (p33<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (1<=p71)
states: 11,178 (4)
abstracting: (p71<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p6)
states: 6,450,855,562,862,311 (15)
abstracting: (p6<=0)
states: 6,450,855,269,802,472 (15)
abstracting: (1<=p36)
states: 1,156,703,497,423,816 (15)
abstracting: (p36<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p103)
states: 6,450,855,562,862,311 (15)
abstracting: (p103<=0)
states: 6,450,855,562,860,529 (15)
abstracting: (0<=p3)
states: 6,450,855,562,862,311 (15)
abstracting: (p3<=0)
states: 6,450,855,465,175,698 (15)
abstracting: (1<=p129)
states: 1,261,133,083,730,634 (15)
abstracting: (p129<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p7)
states: 6,450,855,562,862,311 (15)
abstracting: (p7<=0)
states: 6,450,854,976,742,633 (15)
abstracting: (0<=p120)
states: 6,450,855,562,862,311 (15)
abstracting: (p120<=0)
states: 4,758,202,490,175,151 (15)
abstracting: (1<=p127)
states: 1,288,629,703,182,228 (15)
abstracting: (p127<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (p5<=0)
states: 6,450,855,269,802,472 (15)
abstracting: (0<=p5)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p105)
states: 6,450,855,562,862,311 (15)
abstracting: (p105<=0)
states: 6,450,017,026,844,173 (15)
abstracting: (0<=p57)
states: 6,450,855,562,862,311 (15)
abstracting: (p57<=0)
states: 6,443,037,606,386,486 (15)
abstracting: (1<=p43)
states: 1,290,642,936,547,646 (15)
abstracting: (p43<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p43)
states: 6,450,855,562,862,311 (15)
abstracting: (p43<=0)
states: 5,160,212,626,314,665 (15)
abstracting: (1<=p98)
states: 1,385,156,993,892,050 (15)
abstracting: (p98<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (1<=p46)
states: 2,555,265,213,778,272 (15)
abstracting: (p46<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (1<=p21)
states: 4,388,285,731,265 (12)
abstracting: (p21<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p14)
states: 6,450,855,562,862,311 (15)
abstracting: (p14<=0)
states: 4,304,869,026,059,219 (15)
abstracting: (1<=p70)
states: 11,178 (4)
abstracting: (p70<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p116)
states: 6,450,855,562,862,311 (15)
abstracting: (p116<=0)
states: 3,225,427,781,435,165 (15)
abstracting: (1<=p92)
states: 70,065 (4)
abstracting: (p92<=1)
states: 6,450,855,562,862,311 (15)
abstracting: (0<=p84)
states: 6,450,855,562,862,311 (15)
abstracting: (p84<=0)
states: 4,291,747,381,015,869 (15)
abstracting: (0<=p30)
states: 6,450,855,562,862,311 (15)
abstracting: (p30<=0)
states: 5,409,828,992,256,017 (15)
abstracting: (0<=p73)
states: 6,450,855,562,862,311 (15)
abstracting: (p73<=0)
states: 4,307,586,409,751,953 (15)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-004B-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.102sec

totally nodes used: 874922032 (8.7e+08)
number of garbage collections: 13
fire ops cache: hits/miss/sum: 3388188961 3923687673 3016909338
used/not used/entry size/cache size: 66935955 172909 16 1024MB
basic ops cache: hits/miss/sum: 12054552 29038225 41092777
used/not used/entry size/cache size: 9644981 7132235 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: 771318 2015828 2787146
used/not used/entry size/cache size: 1800575 6588033 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 34412227
1 22326679
2 7915507
3 1989990
4 391493
5 63251
6 8619
7 978
8 113
9 7
>= 10 0

Total processing time: 54m25.964sec


BK_STOP 1679487889149

--------------------
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

18164 23860 39830 49754 48932 55812 54552 60854 82036 74281 80746 88354 89389 129555 142503 139612 138489 133342 135947 139804 139145 139336 139775 141382 138677 138172 154721 167062 167501 171460 174080 177259 176000 189773 187546 186415 180152 185708 186049 189916 189107 188651 189245 187324 235906 227674 186818 194612 201361 205723 204248 267294 295230 274853 250823 231766 236776 239814 241538 243365 240761 242912 241919 232456 226430 300456 282081 277090 290965 298942 300688 303173 305682 303675 296221 298841 304945 300042 302493 306348 303143 293636 296649 291289 292539 347556 342409 335635 312244 309517 302249 306688 308456 311017 285392 281996 305514 305739 290189 293425 297727 304253 306092 309277 296621 297501 301500 302435 303343 307594 299291 312325 310409 253205 243762
iterations count:11568020 (90375), effective:1667608 (13028)

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="ShieldIIPs-PT-004B"
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 ShieldIIPs-PT-004B, 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 r394-oct2-167903717400062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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