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

About the Execution of LTSMin+red for DES-PT-30b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.119 75135.00 136942.00 320.00 F 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.r119-tall-167814497500283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-30b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-tall-167814497500283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679414115863

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-30b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 15:55:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-21 15:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 15:55:17] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-21 15:55:17] [INFO ] Transformed 399 places.
[2023-03-21 15:55:17] [INFO ] Transformed 350 transitions.
[2023-03-21 15:55:17] [INFO ] Found NUPN structural information;
[2023-03-21 15:55:17] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 141 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 312) seen :199
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 113) seen :0
Running SMT prover for 113 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-21 15:55:18] [INFO ] Computed 65 place invariants in 38 ms
[2023-03-21 15:55:19] [INFO ] After 1301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:113
[2023-03-21 15:55:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-21 15:55:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2023-03-21 15:55:30] [INFO ] After 3307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :113
[2023-03-21 15:55:30] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 4 ms to minimize.
[2023-03-21 15:55:30] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-21 15:55:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-21 15:55:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-21 15:55:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:55:31] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-21 15:55:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-21 15:55:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 11 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-21 15:55:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2023-03-21 15:55:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-21 15:55:33] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-21 15:55:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-21 15:55:33] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-21 15:55:34] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-03-21 15:55:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-21 15:55:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 425 ms
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-21 15:55:35] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
[2023-03-21 15:55:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 778 ms
[2023-03-21 15:55:37] [INFO ] After 9912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :113
Attempting to minimize the solution found.
Minimization took 3398 ms.
[2023-03-21 15:55:40] [INFO ] After 21166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :113
Parikh walk visited 7 properties in 12941 ms.
Support contains 106 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 393 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 372 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 372 transition count 314
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 363 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 344 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 344 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 344 transition count 294
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 343 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 328 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 328 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 2 with 15 rules applied. Total rules applied 148 place count 328 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 326 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 326 transition count 260
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 323 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 246 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 244 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 244 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 243 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 242 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 241 transition count 183
Applied a total of 319 rules in 116 ms. Remains 241 /399 variables (removed 158) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 241/399 places, 183/350 transitions.
Incomplete random walk after 1000000 steps, including 47882 resets, run finished after 29841 ms. (steps per millisecond=33 ) properties (out of 106) seen :3
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 103) seen :0
Finished probabilistic random walk after 550693 steps, run visited all 103 properties in 3952 ms. (steps per millisecond=139 )
Probabilistic random walk after 550693 steps, saw 139263 distinct states, run finished after 3952 ms. (steps per millisecond=139 ) properties seen :103
Able to resolve query StableMarking after proving 313 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 72897 ms.
ITS solved all properties within timeout

BK_STOP 1679414190998

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="DES-PT-30b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DES-PT-30b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r119-tall-167814497500283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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