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-167903717900470.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 ShieldPPPs-PT-030A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:50 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 4.1K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 265K 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 ShieldPPPs-PT-030A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679516669134

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=ShieldPPPs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:24:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 20:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:24:32] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-22 20:24:32] [INFO ] Transformed 933 places.
[2023-03-22 20:24:32] [INFO ] Transformed 783 transitions.
[2023-03-22 20:24:33] [INFO ] Found NUPN structural information;
[2023-03-22 20:24:33] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 14) seen :12
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-22 20:24:33] [INFO ] Computed 331 place invariants in 17 ms
[2023-03-22 20:24:34] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:24:35] [INFO ] [Nat]Absence check using 331 positive place invariants in 125 ms returned sat
[2023-03-22 20:24:36] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:24:36] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 33 ms to minimize.
[2023-03-22 20:24:37] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 5 ms to minimize.
[2023-03-22 20:24:37] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 4 ms to minimize.
[2023-03-22 20:24:37] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 10 ms to minimize.
[2023-03-22 20:24:37] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 14 ms to minimize.
[2023-03-22 20:24:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-22 20:24:38] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:24:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1646 ms
[2023-03-22 20:24:38] [INFO ] After 3039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-22 20:24:38] [INFO ] After 4075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 157 ms.
Support contains 50 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 783/783 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 931 transition count 781
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 240 place count 931 transition count 781
Applied a total of 240 rules in 204 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 931/933 places, 781/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 209422 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{0=1}
Probabilistic random walk after 209422 steps, saw 193157 distinct states, run finished after 3021 ms. (steps per millisecond=69 ) properties seen :1
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 20:24:42] [INFO ] Computed 331 place invariants in 57 ms
[2023-03-22 20:24:43] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:24:43] [INFO ] [Nat]Absence check using 313 positive place invariants in 104 ms returned sat
[2023-03-22 20:24:43] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-22 20:24:44] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:24:44] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-22 20:24:45] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-22 20:24:45] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 9 ms to minimize.
[2023-03-22 20:24:46] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2023-03-22 20:24:46] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2023-03-22 20:24:46] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 3 ms to minimize.
[2023-03-22 20:24:47] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-22 20:24:47] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2023-03-22 20:24:47] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:24:48] [INFO ] Deduced a trap composed of 5 places in 650 ms of which 1 ms to minimize.
[2023-03-22 20:24:48] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:24:49] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2023-03-22 20:24:49] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-22 20:24:49] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 22 ms to minimize.
[2023-03-22 20:24:49] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-22 20:24:50] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2023-03-22 20:24:50] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-22 20:24:50] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-03-22 20:24:51] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 20:24:51] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2023-03-22 20:24:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:24:52] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 0 ms to minimize.
[2023-03-22 20:24:52] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-22 20:24:52] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 5 ms to minimize.
[2023-03-22 20:24:53] [INFO ] Deduced a trap composed of 18 places in 380 ms of which 1 ms to minimize.
[2023-03-22 20:24:53] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8779 ms
[2023-03-22 20:24:53] [INFO ] After 9882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-22 20:24:53] [INFO ] After 10763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 931 transition count 781
Applied a total of 6 rules in 100 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227703 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227703 steps, saw 201228 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 20:24:57] [INFO ] Computed 331 place invariants in 26 ms
[2023-03-22 20:24:57] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:24:57] [INFO ] [Nat]Absence check using 312 positive place invariants in 98 ms returned sat
[2023-03-22 20:24:57] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 20:24:58] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:24:59] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 14 ms to minimize.
[2023-03-22 20:24:59] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2023-03-22 20:24:59] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-22 20:24:59] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:25:00] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-22 20:25:00] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-22 20:25:00] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2023-03-22 20:25:01] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2023-03-22 20:25:01] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-22 20:25:01] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 14 ms to minimize.
[2023-03-22 20:25:02] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2023-03-22 20:25:02] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 21 ms to minimize.
[2023-03-22 20:25:02] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-22 20:25:02] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 0 ms to minimize.
[2023-03-22 20:25:03] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-22 20:25:03] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:25:03] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 7 ms to minimize.
[2023-03-22 20:25:03] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 20:25:03] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-22 20:25:04] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-22 20:25:04] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-22 20:25:04] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:25:04] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 27 ms to minimize.
[2023-03-22 20:25:06] [INFO ] Deduced a trap composed of 6 places in 1545 ms of which 0 ms to minimize.
[2023-03-22 20:25:06] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-22 20:25:06] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2023-03-22 20:25:07] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 20:25:07] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-22 20:25:07] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-22 20:25:08] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 14 ms to minimize.
[2023-03-22 20:25:08] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:25:08] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:25:08] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:25:08] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2023-03-22 20:25:09] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-22 20:25:09] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 3 ms to minimize.
[2023-03-22 20:25:09] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-22 20:25:09] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10834 ms
[2023-03-22 20:25:09] [INFO ] After 11747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-22 20:25:10] [INFO ] After 12628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 61 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 931/931 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 42 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 20:25:10] [INFO ] Invariant cache hit.
[2023-03-22 20:25:11] [INFO ] Implicit Places using invariants in 1231 ms returned []
[2023-03-22 20:25:11] [INFO ] Invariant cache hit.
[2023-03-22 20:25:13] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2023-03-22 20:25:13] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 20:25:13] [INFO ] Invariant cache hit.
[2023-03-22 20:25:14] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4026 ms. Remains : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 23 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 20:25:14] [INFO ] Invariant cache hit.
[2023-03-22 20:25:14] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:25:14] [INFO ] [Nat]Absence check using 312 positive place invariants in 70 ms returned sat
[2023-03-22 20:25:14] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 19 ms returned sat
[2023-03-22 20:25:15] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:25:15] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-22 20:25:16] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-22 20:25:16] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 20:25:16] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 20:25:17] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 2 ms to minimize.
[2023-03-22 20:25:17] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-22 20:25:17] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-22 20:25:17] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-22 20:25:18] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-22 20:25:18] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-22 20:25:18] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-22 20:25:18] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-22 20:25:19] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-22 20:25:19] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-22 20:25:19] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-22 20:25:19] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:25:20] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-22 20:25:20] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:25:20] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-22 20:25:20] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-22 20:25:21] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 20:25:21] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-22 20:25:21] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 1 ms to minimize.
[2023-03-22 20:25:22] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:25:22] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 1 ms to minimize.
[2023-03-22 20:25:22] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-22 20:25:22] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-22 20:25:23] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 1 ms to minimize.
[2023-03-22 20:25:23] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 20:25:24] [INFO ] Deduced a trap composed of 17 places in 493 ms of which 44 ms to minimize.
[2023-03-22 20:25:24] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:25:24] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:25:24] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-22 20:25:24] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-22 20:25:25] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:25:25] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 20:25:25] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:25:25] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-22 20:25:26] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-22 20:25:26] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-22 20:25:26] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:25:26] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-22 20:25:27] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
[2023-03-22 20:25:27] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-22 20:25:27] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2023-03-22 20:25:28] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-22 20:25:28] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 20:25:28] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-22 20:25:28] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-22 20:25:28] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:25:29] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 2 ms to minimize.
[2023-03-22 20:25:29] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2023-03-22 20:25:29] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-22 20:25:29] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-22 20:25:30] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 17 ms to minimize.
[2023-03-22 20:25:30] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-22 20:25:30] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 0 ms to minimize.
[2023-03-22 20:25:31] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2023-03-22 20:25:31] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:25:31] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-22 20:25:31] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:25:32] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-22 20:25:32] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-22 20:25:32] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 16568 ms
[2023-03-22 20:25:32] [INFO ] After 17377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 639 ms.
[2023-03-22 20:25:32] [INFO ] After 18436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:25:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 16 ms.
[2023-03-22 20:25:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3671 arcs took 7 ms.
[2023-03-22 20:25:33] [INFO ] Flatten gal took : 198 ms
Total runtime 60816 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: ShieldPPPs_PT_030A
(NrP: 931 NrTr: 781 NrArc: 3671)

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

net check time: 0m 0.000sec

init dd package: 0m 3.045sec


before gc: list nodes free: 1526002

after gc: idd nodes used:1128466, unused:62871534; list nodes free:286273078

before gc: list nodes free: 1504302

after gc: idd nodes used:1369009, unused:62630991; list nodes free:289382529
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6090624 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16094504 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.016sec

208086 360756 562155 585702 966408 1128350 1091158 1226851 1262397 1227629 2540452

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="ShieldPPPs-PT-030A"
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 ShieldPPPs-PT-030A, 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-167903717900470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030A.tgz
mv ShieldPPPs-PT-030A 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 ;