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.r395-oct2-167903718800470.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 smartxred
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 r395-oct2-167903718800470
=====================================================================

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

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 10:55:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 10:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 10:55:48] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-23 10:55:48] [INFO ] Transformed 933 places.
[2023-03-23 10:55:48] [INFO ] Transformed 783 transitions.
[2023-03-23 10:55:48] [INFO ] Found NUPN structural information;
[2023-03-23 10:55:48] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 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 449 ms. (steps per millisecond=22 ) properties (out of 14) seen :10
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-23 10:55:48] [INFO ] Computed 331 place invariants in 25 ms
[2023-03-23 10:55:49] [INFO ] [Real]Absence check using 331 positive place invariants in 53 ms returned sat
[2023-03-23 10:55:49] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:55:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 74 ms returned sat
[2023-03-23 10:55:51] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:55:52] [INFO ] After 2136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 845 ms.
[2023-03-23 10:55:53] [INFO ] After 3411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 200 ms.
Support contains 58 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 13 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 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 238 place count 931 transition count 781
Applied a total of 238 rules in 234 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 235 ms. Remains : 931/933 places, 781/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :3
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-04 FALSE 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 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-23 10:55:53] [INFO ] Computed 331 place invariants in 35 ms
[2023-03-23 10:55:54] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:55:54] [INFO ] [Nat]Absence check using 315 positive place invariants in 128 ms returned sat
[2023-03-23 10:55:54] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 10:55:54] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:55:55] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 14 ms to minimize.
[2023-03-23 10:55:55] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 12 ms to minimize.
[2023-03-23 10:55:55] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-23 10:55:56] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 14 ms to minimize.
[2023-03-23 10:55:56] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-23 10:55:56] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-23 10:55:56] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-23 10:55:56] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 13 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-23 10:55:57] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2023-03-23 10:55:58] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-23 10:55:58] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-23 10:55:58] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-23 10:55:58] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-23 10:55:59] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-23 10:55:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 0 ms to minimize.
[2023-03-23 10:55:59] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2023-03-23 10:55:59] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4576 ms
[2023-03-23 10:55:59] [INFO ] After 5177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-23 10:55:59] [INFO ] After 5732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 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 188 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 188 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) 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 220214 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220214 steps, saw 197041 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-23 10:56:03] [INFO ] Computed 331 place invariants in 35 ms
[2023-03-23 10:56:03] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:56:03] [INFO ] [Nat]Absence check using 315 positive place invariants in 46 ms returned sat
[2023-03-23 10:56:03] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 10:56:04] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:56:04] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-23 10:56:05] [INFO ] Deduced a trap composed of 7 places in 456 ms of which 1 ms to minimize.
[2023-03-23 10:56:05] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-23 10:56:05] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-23 10:56:06] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-23 10:56:06] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-23 10:56:06] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-23 10:56:06] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 2 ms to minimize.
[2023-03-23 10:56:06] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 3 ms to minimize.
[2023-03-23 10:56:07] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 13 ms to minimize.
[2023-03-23 10:56:07] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-23 10:56:07] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-23 10:56:07] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-23 10:56:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3644 ms
[2023-03-23 10:56:07] [INFO ] After 4358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-23 10:56:08] [INFO ] After 4972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 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 71 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 71 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 48 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-23 10:56:08] [INFO ] Invariant cache hit.
[2023-03-23 10:56:10] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2023-03-23 10:56:10] [INFO ] Invariant cache hit.
[2023-03-23 10:56:12] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 3699 ms to find 0 implicit places.
[2023-03-23 10:56:12] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-23 10:56:12] [INFO ] Invariant cache hit.
[2023-03-23 10:56:12] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4433 ms. Remains : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 31 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 10:56:12] [INFO ] Invariant cache hit.
[2023-03-23 10:56:13] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:56:13] [INFO ] [Nat]Absence check using 315 positive place invariants in 54 ms returned sat
[2023-03-23 10:56:13] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 10:56:13] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:56:14] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-23 10:56:14] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 0 ms to minimize.
[2023-03-23 10:56:14] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2023-03-23 10:56:15] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-23 10:56:15] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-23 10:56:15] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-23 10:56:15] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-23 10:56:15] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-23 10:56:16] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-23 10:56:16] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-23 10:56:16] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-23 10:56:16] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 2 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 13 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-23 10:56:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3978 ms
[2023-03-23 10:56:17] [INFO ] After 4570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-23 10:56:18] [INFO ] After 5169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:56:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-23 10:56:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3665 arcs took 16 ms.
[2023-03-23 10:56:18] [INFO ] Flatten gal took : 124 ms
Total runtime 30804 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 030A
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 931 places, 781 transitions, 3665 arcs.
Final Score: 88206.959
Took : 38 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPs-PT-030A-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( (tk(P125)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P125)) ) ) | ( ( ( (tk(P260)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P260)) ) ) | ( ( (tk(P923)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P923)) ) ) ) ) | ( ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) | ( ( ( (tk(P226)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P226)) ) ) | ( ( (tk(P435)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P435)) ) ) ) ) ) | ( ( ( ( (tk(P476)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P476)) ) ) | ( ( ( (tk(P746)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P746)) ) ) | ( ( (tk(P219)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P219)) ) ) ) ) | ( ( ( ( ( (tk(P856)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P856)) ) ) & ( ( (tk(P276)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P276)) ) ) ) | ( ( ( (tk(P751)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P751)) ) ) & ( ( ( (tk(P407)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P407)) ) ) | ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) ) ) ) | ( ( ( ( ( (tk(P286)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P286)) ) ) | ( ( (tk(P573)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P573)) ) ) ) & ( ( ( (tk(P596)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P596)) ) ) | ( ( (tk(P866)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P866)) ) ) ) ) | ( ( ( ( (tk(P757)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P757)) ) ) | ( ( (tk(P702)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P702)) ) ) ) & ( ( ( ( (tk(P611)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P611)) ) ) | ( ( (tk(P200)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P200)) ) ) ) | ( ( ( (tk(P754)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P754)) ) ) | ( ( ( ( (tk(P788)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P788)) ) ) & ( ( (tk(P390)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P390)) ) ) ) | ( ( ( (tk(P518)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P518)) ) ) & ( ( ( (tk(P761)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P761)) ) ) | ( ( (tk(P328)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P328)) ) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8046792 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16107524 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r395-oct2-167903718800470"
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 ;