Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500119.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:40 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.9K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 191K 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 ShieldRVs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679342084333

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:54:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:54:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:54:46] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-20 19:54:46] [INFO ] Transformed 423 places.
[2023-03-20 19:54:46] [INFO ] Transformed 573 transitions.
[2023-03-20 19:54:46] [INFO ] Found NUPN structural information;
[2023-03-20 19:54:46] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 24 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 16) seen :12
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 573 rows 423 cols
[2023-03-20 19:54:47] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-20 19:54:47] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 19:54:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 19:54:48] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 6 ms to minimize.
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-20 19:54:48] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-03-20 19:54:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1710 ms
[2023-03-20 19:54:50] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:54:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-20 19:54:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-20 19:54:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-20 19:54:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2023-03-20 19:54:50] [INFO ] After 2854ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-20 19:54:50] [INFO ] After 3315ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 82 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 43 place count 422 transition count 572
Applied a total of 43 rules in 99 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 422/423 places, 572/573 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2023-03-20 19:54:51] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 19:54:51] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:54:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 19:54:51] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-20 19:54:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 916 ms
[2023-03-20 19:54:52] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-20 19:54:53] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 54 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 422 transition count 572
Applied a total of 10 rules in 92 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 422/422 places, 572/572 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 484248 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 484248 steps, saw 101990 distinct states, run finished after 3002 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2023-03-20 19:54:56] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-20 19:54:56] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:54:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 19:54:56] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 5 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:54:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:54:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1726 ms
[2023-03-20 19:54:58] [INFO ] After 2112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-20 19:54:58] [INFO ] After 2344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 54 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 36 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 422/422 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 30 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-20 19:54:58] [INFO ] Invariant cache hit.
[2023-03-20 19:54:59] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-20 19:54:59] [INFO ] Invariant cache hit.
[2023-03-20 19:54:59] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-20 19:54:59] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-20 19:54:59] [INFO ] Invariant cache hit.
[2023-03-20 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 19:55:00] [INFO ] Invariant cache hit.
[2023-03-20 19:55:00] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:55:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 19:55:00] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:55:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:55:01] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2023-03-20 19:55:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-20 19:55:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2204 ms
[2023-03-20 19:55:03] [INFO ] After 2734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-20 19:55:03] [INFO ] After 3058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 19:55:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 19:55:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 422 places, 572 transitions and 2860 arcs took 5 ms.
[2023-03-20 19:55:03] [INFO ] Flatten gal took : 108 ms
Total runtime 17384 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_030A
(NrP: 422 NrTr: 572 NrArc: 2860)

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

net check time: 0m 0.000sec

init dd package: 0m 3.168sec


before gc: list nodes free: 862285

after gc: idd nodes used:11383, unused:63988617; list nodes free:285156815

before gc: list nodes free: 454316

after gc: idd nodes used:12166, unused:63987834; list nodes free:285153460

before gc: list nodes free: 179851

after gc: idd nodes used:14262, unused:63985738; list nodes free:285142814

before gc: list nodes free: 136684

after gc: idd nodes used:15945, unused:63984055; list nodes free:285135042

before gc: list nodes free: 1492101

after gc: idd nodes used:16526, unused:63983474; list nodes free:287229748

before gc: list nodes free: 1496649

after gc: idd nodes used:17889, unused:63982111; list nodes free:287223367

before gc: list nodes free: 1179291

after gc: idd nodes used:18028, unused:63981972; list nodes free:287222445

before gc: list nodes free: 1840699

after gc: idd nodes used:18190, unused:63981810; list nodes free:287221932

before gc: list nodes free: 2445131

after gc: idd nodes used:18058, unused:63981942; list nodes free:287222735

before gc: list nodes free: 1815983

after gc: idd nodes used:19042, unused:63980958; list nodes free:287218213

before gc: list nodes free: 1257722

after gc: idd nodes used:19364, unused:63980636; list nodes free:287216630

before gc: list nodes free: 1225481

after gc: idd nodes used:19407, unused:63980593; list nodes free:287215739

before gc: list nodes free: 2334913

after gc: idd nodes used:18911, unused:63981089; list nodes free:287218729

before gc: list nodes free: 1459932

after gc: idd nodes used:18584, unused:63981416; list nodes free:287220042
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6231148 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100216 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 ReachabilityFireability -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.003sec

5155 6663 7033 7161 7342 8114 8582 8984 9506 8894 10373 10621 11120 11741 10891 11767 11436 12083 11718 11621 11675 11722 11944 12015 11529 11849 12025 12500 11758 11930 11905 12250 12891 12263 12241 12526 12484 12319 12453 12522 12034 12306 12148 12257 11996 12153 11994 12176 12703 12850 12348 12345 13115 12837 12577 13382 13782 13329 13588 12908 13801 13961 13190 13743 13775 14322 14708 14297 14171 14258 13805 14695 14986 14547 14341 14478 14608 14929 14772 14979 14338 14918 15021 14480 14934 15642 15149 15611 15334 15420 15355 15404 15120 14849 15043 14117 15763 16126 15754 15608 16571 16966 16999 16900 16508 16360 17328 17105 17224 17447 17994 17096 17543 17663 17919 18111 17208 17823 18536 17605 17884 17479 17890 17640 17988 17617 17425 17636 17976 17413 18071 18511 18106 18540 18451 18466 18623 18138 18373 17945 18110 17379 18202 18017 17385 17356 18160 18617 18748 18817 18507 18975 18426 18525 18818 18106 18390 18416 18206 18259 18634 18409 18230 18229 18217 18464 18553 17858 17775 18224 18505 18235 18479 18793 18719 18533 18684 19001 18683 18582 18808 18891 18611 18594 17967 18282 18377 18076 17859 18653 18904 18785 18533 18309 18468 18858 18753 19116 19749 17955 18716 19056 18976 19039 18985 18660 19262 19271 18383 18279 18321 18615 18880 18251 18246 18450 18584 18592 18687 19504 19166 18995 19217 19337 19201 18845 19277 18843 18796 18367 18118 18388 18298 17952 18157 18789 18953 19393 19230 19407 18250 18717 18720 19186 18984 18911 19282 18568 18843 19133 18962 19034 18702 19003 19055 18918 18747 18289 18966 19275 18696 18920 19344 19146 19378 19169 19173 19166 19035 19086 18921 19043 18418 18922 19525 19561 18725 18672 18810 18737 18948 18309 18079 18473 18764 18527 19479 20527

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="ShieldRVs-PT-030A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVs-PT-030A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978500119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;