Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r053-smll-165252139300288.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r053-smll-165252139300288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 7.6K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 79K May 10 09:33 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 1652607346427

Running Version 202205111006
[2022-05-15 09:35:48] [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]
[2022-05-15 09:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 09:35:49] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2022-05-15 09:35:49] [INFO ] Transformed 320 places.
[2022-05-15 09:35:49] [INFO ] Transformed 271 transitions.
[2022-05-15 09:35:49] [INFO ] Found NUPN structural information;
[2022-05-15 09:35:49] [INFO ] Parsed PT model containing 320 places and 271 transitions in 495 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 17 ms.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 1184 ms. (steps per millisecond=8 ) properties (out of 233) seen :203
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 271 rows 320 cols
[2022-05-15 09:35:51] [INFO ] Computed 65 place invariants in 36 ms
[2022-05-15 09:35:52] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-05-15 09:35:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-15 09:35:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-15 09:35:55] [INFO ] After 1574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2022-05-15 09:35:55] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 8 ms to minimize.
[2022-05-15 09:35:55] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 3 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 2 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 2 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2022-05-15 09:35:56] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-05-15 09:35:57] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2022-05-15 09:35:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2022-05-15 09:35:57] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 5 ms to minimize.
[2022-05-15 09:35:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2185 ms
[2022-05-15 09:35:57] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-05-15 09:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-15 09:35:58] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-15 09:35:58] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2022-05-15 09:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 1 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 0 ms to minimize.
[2022-05-15 09:35:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 401 ms
[2022-05-15 09:36:00] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2022-05-15 09:36:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2022-05-15 09:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2022-05-15 09:36:00] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 0 ms to minimize.
[2022-05-15 09:36:00] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2022-05-15 09:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2022-05-15 09:36:00] [INFO ] After 7252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 2057 ms.
[2022-05-15 09:36:02] [INFO ] After 10608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 1 properties in 14249 ms.
Support contains 29 out of 320 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.7 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 3 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 1 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 1 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 157 ms. Remains 162 /320 variables (removed 158) and now considering 104/271 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/320 places, 104/271 transitions.
Interrupted random walk after 804867 steps, including 38525 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 5
Incomplete Best-First random walk after 100001 steps, including 890 resets, run finished after 862 ms. (steps per millisecond=116 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 930 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 925 resets, run finished after 928 ms. (steps per millisecond=107 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 918 resets, run finished after 846 ms. (steps per millisecond=118 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 941 resets, run finished after 856 ms. (steps per millisecond=116 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 894 resets, run finished after 744 ms. (steps per millisecond=134 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 922 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 889 resets, run finished after 710 ms. (steps per millisecond=140 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 889 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 923 resets, run finished after 750 ms. (steps per millisecond=133 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 820 resets, run finished after 773 ms. (steps per millisecond=129 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 940 resets, run finished after 811 ms. (steps per millisecond=123 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 917 resets, run finished after 835 ms. (steps per millisecond=119 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 883 resets, run finished after 845 ms. (steps per millisecond=118 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 963 resets, run finished after 800 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 799 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 896 resets, run finished after 760 ms. (steps per millisecond=131 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 910 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 900 resets, run finished after 696 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 922 resets, run finished after 710 ms. (steps per millisecond=140 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 898 resets, run finished after 912 ms. (steps per millisecond=109 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 921 resets, run finished after 788 ms. (steps per millisecond=126 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 909 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 104 rows 162 cols
[2022-05-15 09:37:06] [INFO ] Computed 64 place invariants in 7 ms
[2022-05-15 09:37:06] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-15 09:37:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-15 09:37:06] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2022-05-15 09:37:06] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-15 09:37:07] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 242 ms.
[2022-05-15 09:37:07] [INFO ] After 1267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 2742 ms.
Support contains 24 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 104/104 transitions.
Interrupted random walk after 807206 steps, including 38514 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 1
Incomplete Best-First random walk after 100001 steps, including 907 resets, run finished after 837 ms. (steps per millisecond=119 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 768 ms. (steps per millisecond=130 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 898 resets, run finished after 793 ms. (steps per millisecond=126 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 880 resets, run finished after 828 ms. (steps per millisecond=120 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 876 resets, run finished after 849 ms. (steps per millisecond=117 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 958 resets, run finished after 853 ms. (steps per millisecond=117 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 901 resets, run finished after 806 ms. (steps per millisecond=124 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 895 resets, run finished after 838 ms. (steps per millisecond=119 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 877 resets, run finished after 849 ms. (steps per millisecond=117 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 938 resets, run finished after 886 ms. (steps per millisecond=112 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 894 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 946 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 921 resets, run finished after 743 ms. (steps per millisecond=134 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 930 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 946 resets, run finished after 750 ms. (steps per millisecond=133 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 919 resets, run finished after 787 ms. (steps per millisecond=127 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 884 resets, run finished after 776 ms. (steps per millisecond=128 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 932 resets, run finished after 799 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 926 resets, run finished after 830 ms. (steps per millisecond=120 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 927 resets, run finished after 819 ms. (steps per millisecond=122 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 941 resets, run finished after 854 ms. (steps per millisecond=117 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 914 resets, run finished after 882 ms. (steps per millisecond=113 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 820 ms. (steps per millisecond=121 ) properties (out of 23) seen :0
Finished probabilistic random walk after 180623 steps, run visited all 23 properties in 2287 ms. (steps per millisecond=78 )
Probabilistic random walk after 180623 steps, saw 46776 distinct states, run finished after 2288 ms. (steps per millisecond=78 ) properties seen :23
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 132177 ms.

BK_STOP 1652607481241

--------------------
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-10b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
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 r053-smll-165252139300288"
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 ;