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.r120-tall-167814498400263.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 marciexred
Input is DES-PT-10b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-tall-167814498400263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 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 79K 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 1678393340991

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=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 20:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:22:22] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 20:22:22] [INFO ] Transformed 320 places.
[2023-03-09 20:22:22] [INFO ] Transformed 271 transitions.
[2023-03-09 20:22:22] [INFO ] Found NUPN structural information;
[2023-03-09 20:22:22] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 123 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 233) seen :198
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 20:22:23] [INFO ] Computed 65 place invariants in 29 ms
[2023-03-09 20:22:23] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-09 20:22:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 20:22:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-09 20:22:25] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 5 ms to minimize.
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2023-03-09 20:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 20:22:25] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 714 ms
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:22:26] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2023-03-09 20:22:27] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-09 20:22:28] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:22:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 456 ms
[2023-03-09 20:22:28] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-09 20:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 20:22:28] [INFO ] After 3765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 773 ms.
[2023-03-09 20:22:28] [INFO ] After 5230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 7 properties in 7497 ms.
Support contains 28 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 314 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 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 314 transition count 244
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 293 transition count 244
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 293 transition count 235
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 284 transition count 235
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 265 transition count 216
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 265 transition count 216
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 265 transition count 215
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 264 transition count 215
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 249 transition count 200
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 249 transition count 200
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 249 transition count 185
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 247 transition count 184
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 247 transition count 181
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 244 transition count 181
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 167 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 165 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 165 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 164 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 163 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 162 transition count 104
Applied a total of 319 rules in 102 ms. Remains 162 /320 variables (removed 158) and now considering 104/271 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 162/320 places, 104/271 transitions.
Incomplete random walk after 1000000 steps, including 47509 resets, run finished after 19057 ms. (steps per millisecond=52 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 100000 steps, including 895 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 889 resets, run finished after 501 ms. (steps per millisecond=199 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 907 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 939 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 916 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 896 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 946 resets, run finished after 595 ms. (steps per millisecond=168 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 928 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 911 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 905 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 927 resets, run finished after 416 ms. (steps per millisecond=240 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 887 resets, run finished after 406 ms. (steps per millisecond=246 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 891 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 429 ms. (steps per millisecond=233 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 949 resets, run finished after 410 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 879 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 917 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 938 resets, run finished after 485 ms. (steps per millisecond=206 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 410 ms. (steps per millisecond=243 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 926 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 910 resets, run finished after 398 ms. (steps per millisecond=251 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 905 resets, run finished after 401 ms. (steps per millisecond=249 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 870 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 926 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 104 rows 162 cols
[2023-03-09 20:23:06] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 20:23:06] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-09 20:23:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 6 ms returned sat
[2023-03-09 20:23:06] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:23:07] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 20:23:07] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-09 20:23:07] [INFO ] After 1081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 4 properties in 1840 ms.
Support contains 21 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 162/162 places, 104/104 transitions.
Incomplete random walk after 1000000 steps, including 47670 resets, run finished after 21455 ms. (steps per millisecond=46 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 884 resets, run finished after 506 ms. (steps per millisecond=197 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 929 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 883 resets, run finished after 507 ms. (steps per millisecond=197 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 926 resets, run finished after 504 ms. (steps per millisecond=198 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 919 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100000 steps, including 940 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 874 resets, run finished after 575 ms. (steps per millisecond=173 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100000 steps, including 867 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 883 resets, run finished after 824 ms. (steps per millisecond=121 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 891 resets, run finished after 438 ms. (steps per millisecond=228 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 664 ms. (steps per millisecond=150 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 915 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 932 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 875 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 950 resets, run finished after 721 ms. (steps per millisecond=138 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 913 resets, run finished after 479 ms. (steps per millisecond=208 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100000 steps, including 896 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 899 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 924 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 21) seen :0
Finished probabilistic random walk after 180623 steps, run visited all 21 properties in 1399 ms. (steps per millisecond=129 )
Probabilistic random walk after 180623 steps, saw 46776 distinct states, run finished after 1399 ms. (steps per millisecond=129 ) properties seen :21
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 81164 ms.
ITS solved all properties within timeout

BK_STOP 1678393424496

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-10b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DES-PT-10b, 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 r120-tall-167814498400263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;