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-167903719100678.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 ShieldPPPt-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 7.8K Feb 25 21:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 21:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 337K 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 ShieldPPPt-PT-050A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679577811901

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=ShieldPPPt-PT-050A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:23:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:23:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:23:33] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-23 13:23:34] [INFO ] Transformed 1253 places.
[2023-03-23 13:23:34] [INFO ] Transformed 903 transitions.
[2023-03-23 13:23:34] [INFO ] Found NUPN structural information;
[2023-03-23 13:23:34] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 902 rows 1253 cols
[2023-03-23 13:23:35] [INFO ] Computed 551 place invariants in 17 ms
[2023-03-23 13:23:36] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 13:23:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 91 ms returned sat
[2023-03-23 13:23:38] [INFO ] After 1865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 13:23:41] [INFO ] After 4385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1018 ms.
[2023-03-23 13:23:42] [INFO ] After 6055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 923 ms.
Support contains 69 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 901
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 0 with 178 rules applied. Total rules applied 180 place count 1252 transition count 901
Applied a total of 180 rules in 326 ms. Remains 1252 /1253 variables (removed 1) and now considering 901/902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 1252/1253 places, 901/902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 100984 steps, run timeout after 3009 ms. (steps per millisecond=33 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 100984 steps, saw 98218 distinct states, run finished after 3019 ms. (steps per millisecond=33 ) properties seen :5
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 901 rows 1252 cols
[2023-03-23 13:23:47] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-23 13:23:47] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 13:23:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 94 ms returned sat
[2023-03-23 13:23:49] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 13:23:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-23 13:23:49] [INFO ] After 534ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 13:23:50] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-23 13:23:50] [INFO ] After 2601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 148 ms.
Support contains 51 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 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 1252 transition count 901
Applied a total of 6 rules in 250 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1252/1252 places, 901/901 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162030 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 162030 steps, saw 156306 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 901 rows 1252 cols
[2023-03-23 13:23:54] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-23 13:23:54] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 13:23:54] [INFO ] [Nat]Absence check using 551 positive place invariants in 131 ms returned sat
[2023-03-23 13:23:55] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 13:23:55] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-23 13:23:56] [INFO ] After 536ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 13:23:57] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-23 13:23:57] [INFO ] After 3343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 193 ms.
Support contains 51 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Applied a total of 0 rules in 45 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1252/1252 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Applied a total of 0 rules in 29 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2023-03-23 13:23:57] [INFO ] Invariant cache hit.
[2023-03-23 13:23:58] [INFO ] Implicit Places using invariants in 864 ms returned [1245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 869 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1252 places, 901/901 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1251 transition count 899
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 899
Applied a total of 4 rules in 89 ms. Remains 1249 /1251 variables (removed 2) and now considering 899/901 (removed 2) transitions.
// Phase 1: matrix 899 rows 1249 cols
[2023-03-23 13:23:58] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-23 13:23:59] [INFO ] Implicit Places using invariants in 831 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 832 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1247/1252 places, 899/901 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 897
Applied a total of 4 rules in 103 ms. Remains 1245 /1247 variables (removed 2) and now considering 897/899 (removed 2) transitions.
// Phase 1: matrix 897 rows 1245 cols
[2023-03-23 13:23:59] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-23 13:24:00] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-23 13:24:00] [INFO ] Invariant cache hit.
[2023-03-23 13:24:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 13:24:03] [INFO ] Implicit Places using invariants and state equation in 3004 ms returned []
Implicit Place search using SMT with State Equation took 3835 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1245/1252 places, 897/901 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5759 ms. Remains : 1245/1252 places, 897/901 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 156384 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156384 steps, saw 150835 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 13:24:07] [INFO ] Invariant cache hit.
[2023-03-23 13:24:07] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 13:24:07] [INFO ] [Nat]Absence check using 548 positive place invariants in 83 ms returned sat
[2023-03-23 13:24:08] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 13:24:08] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 13:24:09] [INFO ] After 1579ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 13:24:10] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-23 13:24:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-23 13:24:10] [INFO ] After 2189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1061 ms.
[2023-03-23 13:24:11] [INFO ] After 4411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 147 ms.
Support contains 51 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 42 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1245/1245 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 85 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2023-03-23 13:24:11] [INFO ] Invariant cache hit.
[2023-03-23 13:24:12] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-23 13:24:12] [INFO ] Invariant cache hit.
[2023-03-23 13:24:13] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 13:24:15] [INFO ] Implicit Places using invariants and state equation in 2740 ms returned []
Implicit Place search using SMT with State Equation took 3465 ms to find 0 implicit places.
[2023-03-23 13:24:15] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-23 13:24:15] [INFO ] Invariant cache hit.
[2023-03-23 13:24:15] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4092 ms. Remains : 1245/1245 places, 897/897 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 1245 transition count 897
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1245 transition count 857
Applied a total of 80 rules in 109 ms. Remains 1245 /1245 variables (removed 0) and now considering 857/897 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 857 rows 1245 cols
[2023-03-23 13:24:16] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-23 13:24:16] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 13:24:16] [INFO ] [Nat]Absence check using 548 positive place invariants in 102 ms returned sat
[2023-03-23 13:24:17] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 13:24:17] [INFO ] After 1034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-23 13:24:17] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 13:24:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-23 13:24:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1245 places, 897 transitions and 4082 arcs took 11 ms.
[2023-03-23 13:24:18] [INFO ] Flatten gal took : 165 ms
Total runtime 44784 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 050A
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: 1245 places, 897 transitions, 4082 arcs.
Final Score: 185536.876
Took : 39 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-050A-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) & ( ( ( (tk(P1042)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1042)) ) ) & ( ( (tk(P1123)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1123)) ) ) ) ) & ( ( ( ( (tk(P1126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1126)) ) ) & ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P122)) ) ) | ( ( (tk(P1136)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1136)) ) ) ) ) & ( ( ( ( (tk(P522)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P522)) ) ) | ( ( ( (tk(P737)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P737)) ) ) & ( ( ( (tk(P663)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P663)) ) ) & ( ( ( (tk(P580)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P580)) ) ) | ( ( (tk(P408)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P408)) ) ) ) ) ) ) & ( ( ( (tk(P328)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P328)) ) ) | ( ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) | ( ( ( (tk(P82)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P82)) ) ) & ( ( ( ( (tk(P518)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P518)) ) ) & ( ( ( (tk(P487)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P487)) ) ) & ( ( (tk(P202)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P202)) ) ) ) ) | ( ( ( (tk(P881)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P881)) ) ) & ( ( ( (tk(P930)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P930)) ) ) & ( ( (tk(P1058)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1058)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-050A-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( (tk(P477)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P477)) ) ) | ( ( (tk(P392)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P392)) ) ) ) | ( ( ( (tk(P1238)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1238)) ) ) | ( ( ( (tk(P255)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P255)) ) ) | ( ( ( (tk(P877)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P877)) ) ) & ( ( (tk(P1076)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1076)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P205)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P205)) ) ) & ( ( (tk(P1050)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1050)) ) ) ) | ( ( ( ( (tk(P171)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P171)) ) ) & ( ( (tk(P1227)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1227)) ) ) ) & ( ( ( ( (tk(P724)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P724)) ) ) | ( ( (tk(P265)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P265)) ) ) ) & ( ( ( ( (tk(P1194)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1194)) ) ) | ( ( ( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P67)) ) ) & ( ( (tk(P634)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P634)) ) ) ) & ( ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) & ( ( (tk(P1079)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1079)) ) ) ) ) ) & ( ( ( (tk(P282)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P282)) ) ) | ( ( (tk(P1017)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1017)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P736)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P736)) ) ) & ( ( ( (tk(P646)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P646)) ) ) & ( ( ( (tk(P765)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P765)) ) ) | ( ( ( (tk(P814)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P814)) ) ) | ( ( (tk(P1058)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1058)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P708)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P708)) ) ) & ( ( (tk(P55)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P55)) ) ) ) & ( ( ( (tk(P705)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P705)) ) ) & ( ( ( (tk(P310)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P310)) ) ) | ( ( ( (tk(P766)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P766)) ) ) | ( ( (tk(P181)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P181)) ) ) ) ) ) ) | ( ( ( (tk(P202)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P202)) ) ) & ( ( ( (tk(P198)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P198)) ) ) | ( ( (tk(P519)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P519)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 10760004 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16103144 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
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="ShieldPPPt-PT-050A"
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 ShieldPPPt-PT-050A, 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-167903719100678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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