About the Execution of 2022-gold for DES-PT-30b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
295.016 | 84534.00 | 154198.00 | 197.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.r128-tall-167814504900283.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 gold2022
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 r128-tall-167814504900283
=====================================================================
--------------------
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 1678175954519
Running Version 202205111006
[2023-03-07 07:59:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-07 07:59:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:59:15] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-07 07:59:16] [INFO ] Transformed 399 places.
[2023-03-07 07:59:16] [INFO ] Transformed 350 transitions.
[2023-03-07 07:59:16] [INFO ] Found NUPN structural information;
[2023-03-07 07:59:16] [INFO ] Parsed PT model containing 399 places and 350 transitions in 324 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 575 ms. (steps per millisecond=17 ) 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 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 3 ms. (steps per millisecond=33 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) 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 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 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) 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 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 11 ms. (steps per millisecond=9 ) 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 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 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 6 ms. (steps per millisecond=16 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 113) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) 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 4 ms. (steps per millisecond=25 ) 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 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 6 ms. (steps per millisecond=16 ) 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 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 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 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 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 100 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) 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
Running SMT prover for 113 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-07 07:59:16] [INFO ] Computed 65 place invariants in 33 ms
[2023-03-07 07:59:18] [INFO ] After 1143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:113
[2023-03-07 07:59:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-07 07:59:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2023-03-07 07:59:30] [INFO ] After 3150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :113
[2023-03-07 07:59:30] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 7 ms to minimize.
[2023-03-07 07:59:30] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-07 07:59:30] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 454 ms
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-07 07:59:31] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-07 07:59:32] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2023-03-07 07:59:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 910 ms
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 512 ms
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2023-03-07 07:59:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2023-03-07 07:59:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-07 07:59:35] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-07 07:59:35] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2023-03-07 07:59:35] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 761 ms
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 0 ms to minimize.
[2023-03-07 07:59:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-07 07:59:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-07 07:59:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-07 07:59:38] [INFO ] After 10662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :113
Attempting to minimize the solution found.
Minimization took 3239 ms.
[2023-03-07 07:59:41] [INFO ] After 23307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :113
Fused 113 Parikh solutions to 112 different solutions.
Parikh walk visited 5 properties in 18723 ms.
Support contains 108 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.6 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 1 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 1 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 113 ms. Remains 241 /399 variables (removed 158) and now considering 183/350 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 241/399 places, 183/350 transitions.
Interrupted random walk after 814725 steps, including 38793 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 3
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 105) seen :0
Finished probabilistic random walk after 550693 steps, run visited all 105 properties in 4980 ms. (steps per millisecond=110 )
Probabilistic random walk after 550693 steps, saw 139263 distinct states, run finished after 4980 ms. (steps per millisecond=110 ) properties seen :105
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 83323 ms.
BK_STOP 1678176039053
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="gold2022"
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 gold2022"
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 r128-tall-167814504900283"
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 '
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 ;