fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r395-oct2-167903718300079
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldIIPs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
571.899 46285.00 82914.00 87.90 FTTTT?TT?FTFTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 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.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 82K 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-005B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679552854829

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=ShieldIIPs-PT-005B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 06:27:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:27:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:27:38] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-23 06:27:38] [INFO ] Transformed 303 places.
[2023-03-23 06:27:38] [INFO ] Transformed 298 transitions.
[2023-03-23 06:27:38] [INFO ] Found NUPN structural information;
[2023-03-23 06:27:38] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 16) seen :12
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 298 rows 303 cols
[2023-03-23 06:27:39] [INFO ] Computed 46 place invariants in 9 ms
[2023-03-23 06:27:40] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:27:40] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2023-03-23 06:27:40] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-23 06:27:42] [INFO ] Deduced a trap composed of 16 places in 1178 ms of which 31 ms to minimize.
[2023-03-23 06:27:42] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-23 06:27:42] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-23 06:27:42] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 30 ms to minimize.
[2023-03-23 06:27:43] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 4 ms to minimize.
[2023-03-23 06:27:43] [INFO ] Deduced a trap composed of 21 places in 683 ms of which 1 ms to minimize.
[2023-03-23 06:27:43] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2023-03-23 06:27:44] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 1 ms to minimize.
[2023-03-23 06:27:44] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-23 06:27:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3391 ms
[2023-03-23 06:27:44] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2023-03-23 06:27:44] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-23 06:27:44] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2023-03-23 06:27:45] [INFO ] Deduced a trap composed of 19 places in 633 ms of which 0 ms to minimize.
[2023-03-23 06:27:45] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2023-03-23 06:27:46] [INFO ] Deduced a trap composed of 20 places in 477 ms of which 0 ms to minimize.
[2023-03-23 06:27:46] [INFO ] Deduced a trap composed of 25 places in 521 ms of which 1 ms to minimize.
[2023-03-23 06:27:46] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2023-03-23 06:27:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-23 06:27:47] [INFO ] Deduced a trap composed of 19 places in 434 ms of which 0 ms to minimize.
[2023-03-23 06:27:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3148 ms
[2023-03-23 06:27:48] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2023-03-23 06:27:48] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 15 ms to minimize.
[2023-03-23 06:27:48] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2023-03-23 06:27:49] [INFO ] Deduced a trap composed of 18 places in 811 ms of which 26 ms to minimize.
[2023-03-23 06:27:50] [INFO ] Deduced a trap composed of 31 places in 1407 ms of which 3 ms to minimize.
[2023-03-23 06:27:51] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-23 06:27:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-23 06:27:51] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2023-03-23 06:27:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3751 ms
[2023-03-23 06:27:51] [INFO ] After 11241ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-23 06:27:51] [INFO ] After 11871ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 132 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 298/298 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 303 transition count 293
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 298 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 296 transition count 291
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 14 place count 296 transition count 277
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 42 place count 282 transition count 277
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 55 place count 269 transition count 264
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 269 transition count 264
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 118 place count 244 transition count 239
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 127 place count 244 transition count 239
Applied a total of 127 rules in 103 ms. Remains 244 /303 variables (removed 59) and now considering 239/298 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 244/303 places, 239/298 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 610369 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{1=1}
Probabilistic random walk after 610369 steps, saw 111545 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :1
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 239 rows 244 cols
[2023-03-23 06:27:55] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-23 06:27:55] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:27:55] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2023-03-23 06:27:56] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:27:56] [INFO ] Deduced a trap composed of 17 places in 524 ms of which 1 ms to minimize.
[2023-03-23 06:27:57] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-23 06:27:57] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-23 06:27:57] [INFO ] Deduced a trap composed of 12 places in 601 ms of which 0 ms to minimize.
[2023-03-23 06:28:00] [INFO ] Deduced a trap composed of 18 places in 2853 ms of which 1 ms to minimize.
[2023-03-23 06:28:01] [INFO ] Deduced a trap composed of 8 places in 430 ms of which 1 ms to minimize.
[2023-03-23 06:28:01] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2023-03-23 06:28:01] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2023-03-23 06:28:02] [INFO ] Deduced a trap composed of 15 places in 730 ms of which 0 ms to minimize.
[2023-03-23 06:28:02] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 0 ms to minimize.
[2023-03-23 06:28:03] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 1 ms to minimize.
[2023-03-23 06:28:03] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 23 ms to minimize.
[2023-03-23 06:28:03] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2023-03-23 06:28:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7231 ms
[2023-03-23 06:28:03] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2023-03-23 06:28:03] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-23 06:28:04] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-23 06:28:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2023-03-23 06:28:04] [INFO ] After 8320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-23 06:28:04] [INFO ] After 8661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 108 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 239/239 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 242 transition count 237
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 242 transition count 233
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 238 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 234 transition count 229
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 234 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 234 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 233 transition count 228
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 223 transition count 218
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 223 transition count 218
Applied a total of 45 rules in 85 ms. Remains 223 /244 variables (removed 21) and now considering 218/239 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 223/244 places, 218/239 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 726138 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 726138 steps, saw 139260 distinct states, run finished after 3002 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 223 cols
[2023-03-23 06:28:07] [INFO ] Computed 46 place invariants in 12 ms
[2023-03-23 06:28:07] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:28:07] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-23 06:28:08] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:28:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-23 06:28:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-23 06:28:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-23 06:28:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-23 06:28:08] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-23 06:28:08] [INFO ] After 1110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 108 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 15 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 223/223 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 12 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-23 06:28:08] [INFO ] Invariant cache hit.
[2023-03-23 06:28:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-23 06:28:09] [INFO ] Invariant cache hit.
[2023-03-23 06:28:09] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-23 06:28:09] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-23 06:28:09] [INFO ] Invariant cache hit.
[2023-03-23 06:28:09] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 864 ms. Remains : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 06:28:09] [INFO ] Invariant cache hit.
[2023-03-23 06:28:09] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:28:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-23 06:28:10] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:28:10] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2023-03-23 06:28:10] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-23 06:28:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-23 06:28:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2023-03-23 06:28:10] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-23 06:28:11] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-23 06:28:11] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-23 06:28:11] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-23 06:28:11] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 11 ms to minimize.
[2023-03-23 06:28:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 656 ms
[2023-03-23 06:28:11] [INFO ] After 1419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-23 06:28:11] [INFO ] After 1704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 06:28:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 40 ms.
[2023-03-23 06:28:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 218 transitions and 758 arcs took 3 ms.
[2023-03-23 06:28:12] [INFO ] Flatten gal took : 72 ms
Total runtime 33623 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 005B
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: 223 places, 218 transitions, 758 arcs.
Final Score: 4316.869
Took : 8 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679552901114

--------------------
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 1206:
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="ShieldIIPs-PT-005B"
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 ShieldIIPs-PT-005B, 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-167903718300079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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