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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 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.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 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 253K 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-030A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679556482423

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-030A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:28:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:28:05] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-23 07:28:05] [INFO ] Transformed 753 places.
[2023-03-23 07:28:05] [INFO ] Transformed 723 transitions.
[2023-03-23 07:28:05] [INFO ] Found NUPN structural information;
[2023-03-23 07:28:05] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 10) seen :8
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-23 07:28:06] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-23 07:28:06] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:28:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 49 ms returned sat
[2023-03-23 07:28:07] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:28:07] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 9 ms to minimize.
[2023-03-23 07:28:08] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-23 07:28:08] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 1 ms to minimize.
[2023-03-23 07:28:08] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2023-03-23 07:28:08] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-23 07:28:09] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:28:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1447 ms
[2023-03-23 07:28:09] [INFO ] Deduced a trap composed of 18 places in 503 ms of which 0 ms to minimize.
[2023-03-23 07:28:10] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
[2023-03-23 07:28:10] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 9 ms to minimize.
[2023-03-23 07:28:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1200 ms
[2023-03-23 07:28:10] [INFO ] After 3853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 578 ms.
[2023-03-23 07:28:11] [INFO ] After 4739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 212 ms.
Support contains 39 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 0 with 189 rules applied. Total rules applied 193 place count 751 transition count 721
Applied a total of 193 rules in 202 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 751/753 places, 721/723 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 204004 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{0=1}
Probabilistic random walk after 204004 steps, saw 134978 distinct states, run finished after 3005 ms. (steps per millisecond=67 ) properties seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-23 07:28:14] [INFO ] Computed 271 place invariants in 24 ms
[2023-03-23 07:28:15] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:28:15] [INFO ] [Nat]Absence check using 264 positive place invariants in 101 ms returned sat
[2023-03-23 07:28:15] [INFO ] [Nat]Absence check using 264 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 07:28:15] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:28:16] [INFO ] After 100ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:16] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-23 07:28:16] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-23 07:28:17] [INFO ] Deduced a trap composed of 9 places in 1095 ms of which 16 ms to minimize.
[2023-03-23 07:28:17] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-23 07:28:18] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-23 07:28:18] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-23 07:28:18] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-23 07:28:18] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:28:18] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-23 07:28:19] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3776 ms
[2023-03-23 07:28:19] [INFO ] After 4058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-23 07:28:20] [INFO ] After 5033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 751 transition count 721
Applied a total of 9 rules in 65 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 751/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244505 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244505 steps, saw 170816 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-23 07:28:23] [INFO ] Computed 271 place invariants in 43 ms
[2023-03-23 07:28:23] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:28:23] [INFO ] [Nat]Absence check using 267 positive place invariants in 46 ms returned sat
[2023-03-23 07:28:23] [INFO ] [Nat]Absence check using 267 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 07:28:24] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:28:24] [INFO ] After 182ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:24] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-23 07:28:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 956 ms
[2023-03-23 07:28:25] [INFO ] After 1268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-23 07:28:25] [INFO ] After 2208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 27 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 29 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 33 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-23 07:28:25] [INFO ] Invariant cache hit.
[2023-03-23 07:28:26] [INFO ] Implicit Places using invariants in 639 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 643 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 20 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 696 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249432 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249432 steps, saw 169460 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-23 07:28:29] [INFO ] Computed 270 place invariants in 7 ms
[2023-03-23 07:28:30] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:28:30] [INFO ] [Nat]Absence check using 266 positive place invariants in 60 ms returned sat
[2023-03-23 07:28:30] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 20 ms returned sat
[2023-03-23 07:28:30] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:31] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 0 ms to minimize.
[2023-03-23 07:28:31] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-23 07:28:31] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2023-03-23 07:28:31] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-23 07:28:32] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2023-03-23 07:28:32] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-23 07:28:32] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-23 07:28:32] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:28:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1606 ms
[2023-03-23 07:28:32] [INFO ] After 2314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-23 07:28:32] [INFO ] After 2743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 27 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 36 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-23 07:28:32] [INFO ] Invariant cache hit.
[2023-03-23 07:28:33] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-23 07:28:33] [INFO ] Invariant cache hit.
[2023-03-23 07:28:35] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2023-03-23 07:28:35] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 07:28:35] [INFO ] Invariant cache hit.
[2023-03-23 07:28:35] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2994 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 07:28:35] [INFO ] Invariant cache hit.
[2023-03-23 07:28:36] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:28:36] [INFO ] [Nat]Absence check using 266 positive place invariants in 58 ms returned sat
[2023-03-23 07:28:36] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 07:28:36] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:36] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2023-03-23 07:28:37] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:28:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 33 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:28:39] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2632 ms
[2023-03-23 07:28:39] [INFO ] After 3290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-23 07:28:39] [INFO ] After 3590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-23 07:28:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3657 arcs took 4 ms.
[2023-03-23 07:28:40] [INFO ] Flatten gal took : 138 ms
Total runtime 35034 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (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: 750 places, 721 transitions, 3657 arcs.
Final Score: 60130.195
Took : 36 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-030A-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( ( ( (tk(P178)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P178)) ) ) | ( ( (tk(P444)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P444)) ) ) ) | ( ( ( (tk(P630)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P630)) ) ) | ( ( (tk(P182)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P182)) ) ) ) ) | ( ( ( ( (tk(P353)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P353)) ) ) | ( ( (tk(P418)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P418)) ) ) ) | ( ( ( (tk(P627)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P627)) ) ) | ( ( (tk(P504)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P504)) ) ) ) ) ) | ( ( ( ( ( (tk(P668)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P668)) ) ) | ( ( (tk(P542)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P542)) ) ) ) | ( ( ( (tk(P226)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P226)) ) ) | ( ( (tk(P310)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P310)) ) ) ) ) | ( ( ( ( ( (tk(P264)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P264)) ) ) & ( ( ( (tk(P451)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P451)) ) ) | ( ( ( (tk(P643)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P643)) ) ) & ( ( (tk(P182)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P182)) ) ) ) ) ) | ( ( ( (tk(P653)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P653)) ) ) & ( ( (tk(P119)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P119)) ) ) ) ) | ( ( ( ( (tk(P391)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P391)) ) ) & ( ( ( (tk(P618)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P618)) ) ) | ( ( ( (tk(P613)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P613)) ) ) | ( ( (tk(P218)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P218)) ) ) ) ) ) | ( ( ( (tk(P478)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P478)) ) ) & ( ( ( (tk(P365)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P365)) ) ) | ( ( ( (tk(P703)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P703)) ) ) | ( ( ( (tk(P427)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P427)) ) ) & ( ( ( (tk(P81)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P81)) ) ) & ( ( (tk(P543)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P543)) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6134516 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104940 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-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 ShieldIIPs-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-167903718400118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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