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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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 ShieldIIPs-PT-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679556634860

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=ShieldIIPs-PT-040A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:30:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:30:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:30:37] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-23 07:30:37] [INFO ] Transformed 1003 places.
[2023-03-23 07:30:37] [INFO ] Transformed 963 transitions.
[2023-03-23 07:30:37] [INFO ] Found NUPN structural information;
[2023-03-23 07:30:37] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 13) seen :8
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-23 07:30:38] [INFO ] Computed 361 place invariants in 19 ms
[2023-03-23 07:30:39] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:30:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 90 ms returned sat
[2023-03-23 07:30:43] [INFO ] After 2992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 12 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 5 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 3 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1283 ms
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-23 07:30:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 697 ms
[2023-03-23 07:30:48] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:30:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2023-03-23 07:30:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-03-23 07:30:49] [INFO ] After 8565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2985 ms.
[2023-03-23 07:30:52] [INFO ] After 12163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 682 ms.
Support contains 128 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1003 transition count 963
Applied a total of 203 rules in 131 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-23 07:30:53] [INFO ] Computed 361 place invariants in 31 ms
[2023-03-23 07:30:53] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:30:54] [INFO ] [Nat]Absence check using 353 positive place invariants in 62 ms returned sat
[2023-03-23 07:30:54] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 07:30:57] [INFO ] After 2897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:30:57] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 9 places in 509 ms of which 1 ms to minimize.
[2023-03-23 07:30:58] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:30:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-23 07:31:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3002 ms
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 5 places in 402 ms of which 2 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-23 07:31:02] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Deduced a trap composed of 12 places in 703 ms of which 0 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:31:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2603 ms
[2023-03-23 07:31:04] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2023-03-23 07:31:04] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-23 07:31:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 864 ms
[2023-03-23 07:31:06] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 0 ms to minimize.
[2023-03-23 07:31:09] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2023-03-23 07:31:09] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-23 07:31:09] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 13 ms to minimize.
[2023-03-23 07:31:10] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 16 ms to minimize.
[2023-03-23 07:31:10] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-23 07:31:10] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 0 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-23 07:31:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5488 ms
[2023-03-23 07:31:11] [INFO ] After 17492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2818 ms.
[2023-03-23 07:31:14] [INFO ] After 20749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 357 ms.
Support contains 127 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 63 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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
Interrupted probabilistic random walk after 104109 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{2=1}
Probabilistic random walk after 104109 steps, saw 96816 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-23 07:31:18] [INFO ] Invariant cache hit.
[2023-03-23 07:31:18] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:31:19] [INFO ] [Nat]Absence check using 353 positive place invariants in 113 ms returned sat
[2023-03-23 07:31:19] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 07:31:22] [INFO ] After 2996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:31:22] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 9 ms to minimize.
[2023-03-23 07:31:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 672 ms
[2023-03-23 07:31:24] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-23 07:31:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 916 ms
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 16 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:31:25] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-23 07:31:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 613 ms
[2023-03-23 07:31:26] [INFO ] After 6826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1683 ms.
[2023-03-23 07:31:27] [INFO ] After 8910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 255 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 1003 transition count 963
Applied a total of 20 rules in 56 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 133275 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133275 steps, saw 119426 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-23 07:31:31] [INFO ] Computed 361 place invariants in 38 ms
[2023-03-23 07:31:31] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:31:32] [INFO ] [Nat]Absence check using 349 positive place invariants in 177 ms returned sat
[2023-03-23 07:31:32] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 78 ms returned sat
[2023-03-23 07:31:35] [INFO ] After 3421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:31:37] [INFO ] Deduced a trap composed of 5 places in 817 ms of which 0 ms to minimize.
[2023-03-23 07:31:37] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2023-03-23 07:31:37] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 22 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-23 07:31:38] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 13 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-23 07:31:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2891 ms
[2023-03-23 07:31:39] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 16 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 9 places in 597 ms of which 1 ms to minimize.
[2023-03-23 07:31:40] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 0 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-23 07:31:41] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:31:42] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 0 ms to minimize.
[2023-03-23 07:31:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4219 ms
[2023-03-23 07:31:44] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:31:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-23 07:31:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2035 ms
[2023-03-23 07:31:46] [INFO ] After 14189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1191 ms.
[2023-03-23 07:31:47] [INFO ] After 16043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 290 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 22 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1003/1003 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 25 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-23 07:31:48] [INFO ] Invariant cache hit.
[2023-03-23 07:31:49] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-23 07:31:49] [INFO ] Invariant cache hit.
[2023-03-23 07:31:51] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 3514 ms to find 0 implicit places.
[2023-03-23 07:31:51] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-23 07:31:51] [INFO ] Invariant cache hit.
[2023-03-23 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4567 ms. Remains : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 33 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-23 07:31:52] [INFO ] Invariant cache hit.
[2023-03-23 07:31:53] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:31:53] [INFO ] [Nat]Absence check using 349 positive place invariants in 57 ms returned sat
[2023-03-23 07:31:53] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 07:31:55] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:31:56] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
[2023-03-23 07:31:57] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 1 ms to minimize.
[2023-03-23 07:31:57] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 13 ms to minimize.
[2023-03-23 07:31:57] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-23 07:31:58] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-23 07:31:58] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:31:58] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2023-03-23 07:31:58] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 6 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-23 07:31:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3113 ms
[2023-03-23 07:32:00] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 14 ms to minimize.
[2023-03-23 07:32:00] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-23 07:32:01] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2023-03-23 07:32:01] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:32:01] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-23 07:32:02] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2023-03-23 07:32:02] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-23 07:32:02] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 0 ms to minimize.
[2023-03-23 07:32:03] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-23 07:32:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2706 ms
[2023-03-23 07:32:04] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-23 07:32:04] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-23 07:32:05] [INFO ] Deduced a trap composed of 13 places in 981 ms of which 1 ms to minimize.
[2023-03-23 07:32:05] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-23 07:32:05] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-23 07:32:05] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 20 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-23 07:32:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3191 ms
[2023-03-23 07:32:06] [INFO ] After 13463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1876 ms.
[2023-03-23 07:32:08] [INFO ] After 15705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:32:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 20 ms.
[2023-03-23 07:32:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4802 arcs took 13 ms.
[2023-03-23 07:32:09] [INFO ] Flatten gal took : 206 ms
Total runtime 91759 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 040A
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: 1003 places, 963 transitions, 4802 arcs.
Final Score: 145913.301
Took : 47 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-040A-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P990)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P990)) ) ) | ( ( ( (tk(P796)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P796)) ) ) | ( ( (tk(P941)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P941)) ) ) ) ) | ( ( ( ( (tk(P555)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P555)) ) ) | ( ( (tk(P822)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P822)) ) ) ) | ( ( ( ( (tk(P363)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P363)) ) ) & ( ( ( ( (tk(P853)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P853)) ) ) | ( ( (tk(P837)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P837)) ) ) ) | ( ( ( (tk(P825)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P825)) ) ) | ( ( ( (tk(P268)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P268)) ) ) | ( ( ( (tk(P127)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P127)) ) ) & ( ( ( (tk(P803)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P803)) ) ) | ( ( ( (tk(P348)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P348)) ) ) | ( ( (tk(P989)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P989)) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P725)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P725)) ) ) & ( ( ( (tk(P168)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P168)) ) ) & ( ( (tk(P499)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P499)) ) ) ) ) & ( ( ( (tk(P492)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P492)) ) ) & ( ( ( (tk(P303)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P303)) ) ) & ( ( (tk(P752)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P752)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-040A-ReachabilityCardinality-01 (reachable & potential(( ( ( ( ( (tk(P783)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P783)) ) ) & ( ( ( (tk(P669)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P669)) ) ) & ( ( (tk(P900)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P900)) ) ) ) ) & ( ( ( ( (tk(P139)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P139)) ) ) & ( ( (tk(P158)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P158)) ) ) ) & ( ( ( (tk(P594)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P594)) ) ) & ( ( (tk(P961)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P961)) ) ) ) ) ) & ( ( ( ( ( (tk(P618)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P618)) ) ) & ( ( (tk(P522)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P522)) ) ) ) & ( ( ( ( (tk(P109)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P109)) ) ) | ( ( ( ( ( (tk(P530)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P530)) ) ) | ( ( ( ( (tk(P391)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P391)) ) ) & ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) | ( ( ( (tk(P795)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P795)) ) ) & ( ( ( (tk(P983)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P983)) ) ) & ( ( (tk(P264)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P264)) ) ) ) ) ) ) & ( ( ( ( (tk(P792)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P792)) ) ) | ( ( ( (tk(P184)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P184)) ) ) & ( ( (tk(P261)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P261)) ) ) ) ) & ( ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) & ( ( (tk(P131)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P131)) ) ) ) | ( ( ( (tk(P462)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P462)) ) ) & ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) ) ) ) ) | ( ( ( (tk(P995)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P995)) ) ) & ( ( ( (tk(P791)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P791)) ) ) & ( ( ( ( (tk(P738)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P738)) ) ) | ( ( ( (tk(P264)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P264)) ) ) | ( ( (tk(P73)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P73)) ) ) ) ) | ( ( ( (tk(P598)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P598)) ) ) | ( ( ( (tk(P516)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P516)) ) ) | ( ( (tk(P267)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P267)) ) ) ) ) ) ) ) ) ) & ( ( ( (tk(P785)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P785)) ) ) | ( ( (tk(P83)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P83)) ) ) ) ) ) & ( ( ( ( ( ( ( (tk(P749)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P749)) ) ) | ( ( (tk(P735)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P735)) ) ) ) | ( ( ( (tk(P382)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P382)) ) ) | ( ( (tk(P224)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P224)) ) ) ) ) | ( ( ( ( (tk(P794)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P794)) ) ) | ( ( (tk(P746)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P746)) ) ) ) | ( ( ( ( (tk(P955)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P955)) ) ) & ( ( (tk(P984)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P984)) ) ) ) | ( ( ( ( ( (tk(P265)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P265)) ) ) | ( ( (tk(P644)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P644)) ) ) ) & ( ( ( (tk(P507)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P507)) ) ) | ( ( (tk(P467)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P467)) ) ) ) ) | ( ( ( (tk(P482)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P482)) ) ) & ( ( (tk(P656)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P656)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P293)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P293)) ) ) | ( ( ( (tk(P138)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P138)) ) ) | ( ( (tk(P200)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P200)) ) ) ) ) | ( ( ( ( (tk(P194)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P194)) ) ) & ( ( (tk(P828)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P828)) ) ) ) | ( ( ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) & ( ( ( (tk(P72)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P72)) ) ) | ( ( (tk(P42)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P42)) ) ) ) ) | ( ( ( ( (tk(P196)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P196)) ) ) | ( ( (tk(P843)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P843)) ) ) ) & ( ( ( (tk(P640)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P640)) ) ) | ( ( (tk(P668)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P668)) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P582)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P582)) ) ) | ( ( ( (tk(P444)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P444)) ) ) | ( ( ( ( (tk(P282)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P282)) ) ) & ( ( (tk(P320)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P320)) ) ) ) & ( ( ( (tk(P663)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P663)) ) ) & ( ( ( (tk(P423)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P423)) ) ) | ( ( (tk(P451)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P451)) ) ) ) ) ) ) ) & ( ( ( (tk(P946)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P946)) ) ) | ( ( (tk(P481)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P481)) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-040A-ReachabilityCardinality-04 (reachable & potential(( ( ( ( (tk(P594)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P594)) ) ) & ( ( ( (tk(P766)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P766)) ) ) & ( ( (tk(P506)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P506)) ) ) ) ) & ( ( ( (tk(P956)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P956)) ) ) & ( ( ( (tk(P712)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P712)) ) ) & ( ( ( (tk(P201)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P201)) ) ) | ( ( (tk(P471)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P471)) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7230468 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102184 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
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="ShieldIIPs-PT-040A"
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 ShieldIIPs-PT-040A, 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-167903718400134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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