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-167814482800494.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-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 110K 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-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678410279012

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-60a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 01:04:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 01:04:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:04:40] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-10 01:04:40] [INFO ] Transformed 354 places.
[2023-03-10 01:04:40] [INFO ] Transformed 311 transitions.
[2023-03-10 01:04:40] [INFO ] Found NUPN structural information;
[2023-03-10 01:04:40] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 215 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 14) seen :4
FORMULA DES-PT-60a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 297 rows 354 cols
[2023-03-10 01:04:41] [INFO ] Computed 59 place invariants in 36 ms
[2023-03-10 01:04:42] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-10 01:04:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-10 01:04:42] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-10 01:04:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-10 01:04:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-10 01:04:47] [INFO ] After 4215ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-10 01:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 01:04:49] [INFO ] After 2050ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-10 01:04:53] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
[2023-03-10 01:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-10 01:04:54] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-10 01:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-10 01:04:54] [INFO ] After 6524ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 7429 ms.
[2023-03-10 01:05:01] [INFO ] After 19572ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA DES-PT-60a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 568 ms.
Support contains 27 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 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 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
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 353 transition count 294
Applied a total of 9 rules in 85 ms. Remains 353 /354 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 353/354 places, 294/297 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 678852 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678852 steps, saw 97583 distinct states, run finished after 3002 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 294 rows 353 cols
[2023-03-10 01:05:06] [INFO ] Computed 61 place invariants in 19 ms
[2023-03-10 01:05:06] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-10 01:05:06] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-10 01:05:06] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 01:05:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-10 01:05:06] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-10 01:05:07] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 01:05:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 01:05:07] [INFO ] After 375ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-10 01:05:08] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 376 ms.
[2023-03-10 01:05:08] [INFO ] After 2065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 410 ms.
Support contains 13 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-10 01:05:08] [INFO ] Invariant cache hit.
[2023-03-10 01:05:09] [INFO ] Implicit Places using invariants in 204 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 238 ms. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1024495 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1024495 steps, saw 144759 distinct states, run finished after 3005 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-10 01:05:12] [INFO ] Computed 60 place invariants in 24 ms
[2023-03-10 01:05:12] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-10 01:05:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-10 01:05:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 01:05:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-10 01:05:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-10 01:05:13] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 01:05:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 01:05:13] [INFO ] After 149ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 01:05:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2023-03-10 01:05:13] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-10 01:05:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-03-10 01:05:13] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-10 01:05:13] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-60a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 109 ms.
Support contains 9 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-10 01:05:13] [INFO ] Invariant cache hit.
[2023-03-10 01:05:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-10 01:05:14] [INFO ] Invariant cache hit.
[2023-03-10 01:05:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 01:05:14] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-10 01:05:14] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 01:05:14] [INFO ] Invariant cache hit.
[2023-03-10 01:05:14] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-10 01:05:14] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-10 01:05:14] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:05:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-10 01:05:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 223 ms returned sat
[2023-03-10 01:05:15] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 01:05:15] [INFO ] After 562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-10 01:05:15] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-10 01:05:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-10 01:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 352 places, 294 transitions and 1444 arcs took 3 ms.
[2023-03-10 01:05:16] [INFO ] Flatten gal took : 65 ms
Total runtime 35687 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_60a
(NrP: 352 NrTr: 294 NrArc: 1444)

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

net check time: 0m 0.000sec

init dd package: 0m 2.754sec


RS generation: 5m57.701sec


-> reachability set: #nodes 1739578 (1.7e+06) #states 42,496,037,427,343 (13)



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

checking: AG [[[1<=p126 & p126<=1] | [p169<=0 & 0<=p169]]]
normalized: ~ [E [true U ~ [[[1<=p126 & p126<=1] | [p169<=0 & 0<=p169]]]]]

abstracting: (0<=p169)
states: 42,496,037,427,343 (13)
abstracting: (p169<=0)
states: 41,769,073,084,785 (13)
abstracting: (p126<=1)
states: 42,496,037,427,343 (13)
abstracting: (1<=p126)
states: 726,964,342,558 (11)

before gc: list nodes free: 1043160

after gc: idd nodes used:3403068, unused:60596932; list nodes free:259514244

before gc: list nodes free: 2159514

after gc: idd nodes used:5116478, unused:58883522; list nodes free:251799020

before gc: list nodes free: 4605751

after gc: idd nodes used:5328729, unused:58671271; list nodes free:250872742

before gc: list nodes free: 1051357

after gc: idd nodes used:5334919, unused:58665081; list nodes free:250839237

before gc: list nodes free: 2864667

after gc: idd nodes used:4547945, unused:59452055; list nodes free:254458239
MC time: 27m 1.661sec

checking: EF [[[[[[[p72<=1 & 1<=p72] & [p166<=0 & 0<=p166]] | [p36<=1 & 1<=p36]] | [0<=p348 & p348<=0]] & [[p299<=0 & 0<=p299] | [1<=p249 & p249<=1]]] & [1<=p63 & p63<=1]]]
normalized: E [true U [[1<=p63 & p63<=1] & [[[1<=p249 & p249<=1] | [p299<=0 & 0<=p299]] & [[0<=p348 & p348<=0] | [[p36<=1 & 1<=p36] | [[p166<=0 & 0<=p166] & [p72<=1 & 1<=p72]]]]]]]

abstracting: (1<=p72)
states: 739,740,050,404 (11)
abstracting: (p72<=1)
states: 42,496,037,427,343 (13)
abstracting: (0<=p166)
states: 42,496,037,427,343 (13)
abstracting: (p166<=0)
states: 41,769,073,084,785 (13)
abstracting: (1<=p36)
states: 739,740,050,404 (11)
abstracting: (p36<=1)
states: 42,496,037,427,343 (13)
abstracting: (p348<=0)
states: 34,966,365,000,325 (13)
abstracting: (0<=p348)
states: 42,496,037,427,343 (13)
abstracting: (0<=p299)
states: 42,496,037,427,343 (13)
abstracting: (p299<=0)
states: 26,788,793,938,739 (13)
abstracting: (p249<=1)
states: 42,496,037,427,343 (13)
abstracting: (1<=p249)
states: 26,817,416,940,828 (13)
abstracting: (p63<=1)
states: 42,496,037,427,343 (13)
abstracting: (1<=p63)
states: 739,739,583,792 (11)

before gc: list nodes free: 1899973

after gc: idd nodes used:3965142, unused:60034858; list nodes free:261325598

before gc: list nodes free: 5484338

after gc: idd nodes used:4413144, unused:59586856; list nodes free:259319496
-> the formula is TRUE

FORMULA DES-PT-60a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6274640 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099836 kB

BK_TIME_CONFINEMENT_REACHED

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

864279 1474662 1683268 1545520 1530210 1571701 1551213 1559555 1570211 1566128 1571274 1600211 1635536 1581788 1610198 1645629 1591320 1600377 1594570 1599652 1623960 1604487 1595166 1688633 1720407
iterations count:2575745 (8761), effective:120695 (410)

initing FirstDep: 0m 0.001sec


sat_reach.icc:155: Timeout: after 1619 sec

1030719 1297848 1307474 1313171 1318189 1322658 1235662 1154339 1162863 1312517 1604459 1301331 1038797 1050731 1068300 1064894 1147923 1601682
iterations count:1841869 (6264), effective:78847 (268)

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

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