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-167903718500239.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 ShieldIIPt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718500239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:05 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.5K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 67K 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 ShieldIIPt-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679560170169

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-004B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:29:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 08:29:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:29:32] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-23 08:29:32] [INFO ] Transformed 283 places.
[2023-03-23 08:29:32] [INFO ] Transformed 263 transitions.
[2023-03-23 08:29:32] [INFO ] Found NUPN structural information;
[2023-03-23 08:29:32] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 283 cols
[2023-03-23 08:29:33] [INFO ] Computed 37 place invariants in 9 ms
[2023-03-23 08:29:33] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:29:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 93 ms returned sat
[2023-03-23 08:29:34] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:29:34] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 10 ms to minimize.
[2023-03-23 08:29:34] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2023-03-23 08:29:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2023-03-23 08:29:35] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 14 ms to minimize.
[2023-03-23 08:29:35] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 17 ms to minimize.
[2023-03-23 08:29:35] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 0 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1794 ms
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 11 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-23 08:29:36] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 13 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2023-03-23 08:29:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1079 ms
[2023-03-23 08:29:37] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-23 08:29:38] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 0 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 20 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 13 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 13 ms to minimize.
[2023-03-23 08:29:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2043 ms
[2023-03-23 08:29:39] [INFO ] After 6080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-23 08:29:40] [INFO ] After 6542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 85 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 263/263 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 283 transition count 244
Reduce places removed 19 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 29 rules applied. Total rules applied 48 place count 264 transition count 234
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 58 place count 254 transition count 234
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 254 transition count 217
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 237 transition count 217
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 107 place count 222 transition count 202
Iterating global reduction 3 with 15 rules applied. Total rules applied 122 place count 222 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 222 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 221 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 125 place count 221 transition count 198
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 129 place count 219 transition count 198
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 187 place count 190 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 191 place count 188 transition count 169
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 188 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 197 place count 185 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 200 place count 185 transition count 166
Applied a total of 200 rules in 99 ms. Remains 185 /283 variables (removed 98) and now considering 166/263 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 185/283 places, 166/263 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 166 rows 185 cols
[2023-03-23 08:29:40] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-23 08:29:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:29:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-23 08:29:40] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-23 08:29:40] [INFO ] After 135ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:40] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 20 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 591 ms
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-23 08:29:41] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-23 08:29:42] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2023-03-23 08:29:42] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-23 08:29:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-23 08:29:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 686 ms
[2023-03-23 08:29:42] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-23 08:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-23 08:29:42] [INFO ] After 1629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-23 08:29:42] [INFO ] After 1935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 63 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 166/166 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 185 transition count 161
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 180 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 179 transition count 160
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 179 transition count 153
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 172 transition count 153
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 48 place count 161 transition count 142
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 161 transition count 139
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 158 transition count 139
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 158 transition count 139
Applied a total of 56 rules in 32 ms. Remains 158 /185 variables (removed 27) and now considering 139/166 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 158/185 places, 139/166 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 373066 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373066 steps, saw 194480 distinct states, run finished after 3003 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 139 rows 158 cols
[2023-03-23 08:29:45] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-23 08:29:45] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:29:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-23 08:29:45] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-23 08:29:45] [INFO ] After 57ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 372 ms
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-23 08:29:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-23 08:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-23 08:29:46] [INFO ] After 727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-23 08:29:46] [INFO ] After 1052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 63 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 158/158 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-23 08:29:46] [INFO ] Invariant cache hit.
[2023-03-23 08:29:47] [INFO ] Implicit Places using invariants in 166 ms returned [140]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 157/158 places, 139/139 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 157 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 138
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 156 cols
[2023-03-23 08:29:47] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-23 08:29:47] [INFO ] Implicit Places using invariants in 122 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/158 places, 138/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 137
Applied a total of 2 rules in 23 ms. Remains 154 /155 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 154 cols
[2023-03-23 08:29:47] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-23 08:29:47] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-23 08:29:47] [INFO ] Invariant cache hit.
[2023-03-23 08:29:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 08:29:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 154/158 places, 137/139 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 668 ms. Remains : 154/158 places, 137/139 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 246768 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246768 steps, saw 131684 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 08:29:50] [INFO ] Invariant cache hit.
[2023-03-23 08:29:50] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:29:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-23 08:29:50] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 08:29:51] [INFO ] After 139ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-23 08:29:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1030 ms
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2023-03-23 08:29:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 285 ms
[2023-03-23 08:29:52] [INFO ] After 1642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-23 08:29:52] [INFO ] After 1899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 63 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-23 08:29:52] [INFO ] Invariant cache hit.
[2023-03-23 08:29:52] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-23 08:29:52] [INFO ] Invariant cache hit.
[2023-03-23 08:29:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 08:29:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-23 08:29:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 08:29:52] [INFO ] Invariant cache hit.
[2023-03-23 08:29:52] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 154/154 places, 137/137 transitions.
Graph (complete) has 308 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 153 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 153 transition count 136
Applied a total of 7 rules in 12 ms. Remains 153 /154 variables (removed 1) and now considering 136/137 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 136 rows 153 cols
[2023-03-23 08:29:52] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-23 08:29:53] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:29:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-23 08:29:53] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 08:29:53] [INFO ] After 128ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 786 ms
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-23 08:29:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-23 08:29:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-23 08:29:55] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-23 08:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-23 08:29:55] [INFO ] After 1317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-23 08:29:55] [INFO ] After 2222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:29:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-23 08:29:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 137 transitions and 413 arcs took 3 ms.
[2023-03-23 08:29:55] [INFO ] Flatten gal took : 34 ms
Total runtime 23123 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 004B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 154 places, 137 transitions, 413 arcs.
Final Score: 2033.265
Took : 4 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679560200427

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 711:
syntax error

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="ShieldIIPt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-004B, examination is ReachabilityFireability"
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-167903718500239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-004B.tgz
mv ShieldIIPt-PT-004B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;