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

About the Execution of LTSMin+red for ShieldIIPs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10041.880 3600000.00 14227074.00 53.40 TFTTTTT??TTFTFT? 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.r393-oct2-167903716700135.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 ltsminxred
Input is ShieldIIPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679427974588

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:46:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:46:17] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-21 19:46:17] [INFO ] Transformed 1003 places.
[2023-03-21 19:46:17] [INFO ] Transformed 963 transitions.
[2023-03-21 19:46:17] [INFO ] Found NUPN structural information;
[2023-03-21 19:46:17] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 180 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 4 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-21 19:46:18] [INFO ] Computed 361 place invariants in 26 ms
[2023-03-21 19:46:19] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 19:46:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 147 ms returned sat
[2023-03-21 19:46:23] [INFO ] After 3838ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-21 19:46:23] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
[2023-03-21 19:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-21 19:46:24] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 7 ms to minimize.
[2023-03-21 19:46:24] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-21 19:46:25] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 27 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-21 19:46:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1625 ms
[2023-03-21 19:46:26] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-21 19:46:27] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-21 19:46:28] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-21 19:46:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:46:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 751 ms
[2023-03-21 19:46:29] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-21 19:46:29] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:46:29] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-21 19:46:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 701 ms
[2023-03-21 19:46:29] [INFO ] After 9788ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2498 ms.
[2023-03-21 19:46:32] [INFO ] After 12947ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 603 ms.
Support contains 194 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 191 times.
Drop transitions removed 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 193 place count 1002 transition count 962
Applied a total of 193 rules in 158 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :2
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-21 19:46:33] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-21 19:46:34] [INFO ] [Real]Absence check using 357 positive place invariants in 76 ms returned sat
[2023-03-21 19:46:34] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 19:46:34] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:46:34] [INFO ] [Nat]Absence check using 357 positive place invariants in 65 ms returned sat
[2023-03-21 19:46:34] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-21 19:46:36] [INFO ] After 1996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 1 ms to minimize.
[2023-03-21 19:46:37] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 1 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-21 19:46:38] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2023-03-21 19:46:39] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 26 ms to minimize.
[2023-03-21 19:46:39] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2023-03-21 19:46:39] [INFO ] Deduced a trap composed of 10 places in 606 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 19:46:40] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 0 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 11 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 40 ms to minimize.
[2023-03-21 19:46:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4817 ms
[2023-03-21 19:46:42] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-21 19:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-21 19:46:43] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-21 19:46:43] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-21 19:46:43] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-21 19:46:43] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-21 19:46:44] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-21 19:46:44] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 7 ms to minimize.
[2023-03-21 19:46:44] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2023-03-21 19:46:45] [INFO ] Deduced a trap composed of 19 places in 1188 ms of which 4 ms to minimize.
[2023-03-21 19:46:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-21 19:46:46] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-21 19:46:46] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-21 19:46:46] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:46:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-21 19:46:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:46:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4043 ms
[2023-03-21 19:46:47] [INFO ] After 12708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1851 ms.
[2023-03-21 19:46:49] [INFO ] After 14968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 275 ms.
Support contains 165 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 1002 transition count 962
Applied a total of 13 rules in 65 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 122190 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122190 steps, saw 108255 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-21 19:46:53] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-21 19:46:53] [INFO ] [Real]Absence check using 354 positive place invariants in 61 ms returned sat
[2023-03-21 19:46:53] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-21 19:46:53] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:46:53] [INFO ] [Nat]Absence check using 354 positive place invariants in 65 ms returned sat
[2023-03-21 19:46:53] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-21 19:46:56] [INFO ] After 2280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:46:57] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 12 ms to minimize.
[2023-03-21 19:46:57] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2023-03-21 19:46:57] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-21 19:46:58] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 0 ms to minimize.
[2023-03-21 19:46:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 3 ms to minimize.
[2023-03-21 19:46:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-21 19:46:58] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-21 19:46:58] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-21 19:46:59] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 0 ms to minimize.
[2023-03-21 19:46:59] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 1 ms to minimize.
[2023-03-21 19:46:59] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 15 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-21 19:47:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4109 ms
[2023-03-21 19:47:01] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 6 ms to minimize.
[2023-03-21 19:47:01] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-21 19:47:01] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 27 ms to minimize.
[2023-03-21 19:47:02] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:47:02] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2023-03-21 19:47:02] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-21 19:47:02] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-21 19:47:02] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:47:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1709 ms
[2023-03-21 19:47:03] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-21 19:47:03] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-21 19:47:04] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-21 19:47:04] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:47:04] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-21 19:47:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 815 ms
[2023-03-21 19:47:04] [INFO ] After 10669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2015 ms.
[2023-03-21 19:47:06] [INFO ] After 13165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 270 ms.
Support contains 165 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 47 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1002/1002 places, 962/962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 39 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-21 19:47:06] [INFO ] Invariant cache hit.
[2023-03-21 19:47:07] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-21 19:47:07] [INFO ] Invariant cache hit.
[2023-03-21 19:47:09] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2023-03-21 19:47:09] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-21 19:47:09] [INFO ] Invariant cache hit.
[2023-03-21 19:47:10] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3522 ms. Remains : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 32 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-21 19:47:10] [INFO ] Invariant cache hit.
[2023-03-21 19:47:10] [INFO ] [Real]Absence check using 354 positive place invariants in 66 ms returned sat
[2023-03-21 19:47:10] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-21 19:47:10] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:47:11] [INFO ] [Nat]Absence check using 354 positive place invariants in 73 ms returned sat
[2023-03-21 19:47:11] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-21 19:47:12] [INFO ] After 1784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1534 ms
[2023-03-21 19:47:15] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1737 ms
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1445 ms
[2023-03-21 19:47:19] [INFO ] After 8484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1271 ms.
[2023-03-21 19:47:21] [INFO ] After 10135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:47:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-21 19:47:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1002 places, 962 transitions and 4767 arcs took 8 ms.
[2023-03-21 19:47:21] [INFO ] Flatten gal took : 161 ms
Total runtime 64447 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/834/inv_0_ --invariant=/tmp/834/inv_1_ --invariant=/tmp/834/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6100236 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095364 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-040A, 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 r393-oct2-167903716700135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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