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.r121-smll-165264480700073.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 HealthRecord-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-165264480700073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.6K Apr 30 11:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 11:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 67K May 10 09:34 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 1652722309733

Running Version 202205111006
[2022-05-16 17:31:52] [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-16 17:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:31:52] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-16 17:31:52] [INFO ] Transformed 154 places.
[2022-05-16 17:31:52] [INFO ] Transformed 319 transitions.
[2022-05-16 17:31:52] [INFO ] Found NUPN structural information;
[2022-05-16 17:31:52] [INFO ] Parsed PT model containing 154 places and 319 transitions in 467 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 10 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 37 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 715 resets, run finished after 1189 ms. (steps per millisecond=8 ) properties (out of 120) seen :68
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2022-05-16 17:31:54] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2022-05-16 17:31:54] [INFO ] Computed 18 place invariants in 17 ms
[2022-05-16 17:31:55] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2022-05-16 17:31:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 17:31:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-16 17:31:57] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2022-05-16 17:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:31:57] [INFO ] After 879ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2022-05-16 17:31:58] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 11 ms to minimize.
[2022-05-16 17:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-16 17:31:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2022-05-16 17:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-16 17:31:59] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2022-05-16 17:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 17:31:59] [INFO ] After 2778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 846 ms.
[2022-05-16 17:32:00] [INFO ] After 5319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Fused 49 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 443 ms.
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 147/147 places, 287/287 transitions.
Graph (complete) has 636 edges and 147 vertex of which 138 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 138 transition count 262
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 28 place count 133 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 132 transition count 256
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 29 place count 132 transition count 252
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 40 place count 125 transition count 252
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 75 place count 90 transition count 182
Iterating global reduction 3 with 35 rules applied. Total rules applied 110 place count 90 transition count 182
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 85 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 85 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 85 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 136 place count 79 transition count 195
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 144 place count 79 transition count 187
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 79 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 78 transition count 186
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 159 place count 78 transition count 186
Applied a total of 159 rules in 88 ms. Remains 78 /147 variables (removed 69) and now considering 186/287 (removed 101) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/147 places, 186/287 transitions.
Interrupted random walk after 765050 steps, including 235833 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 33
Incomplete Best-First random walk after 100000 steps, including 3506 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3466 resets, run finished after 430 ms. (steps per millisecond=232 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3460 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3497 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3503 resets, run finished after 464 ms. (steps per millisecond=215 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 3459 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3461 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3513 resets, run finished after 571 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3475 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3469 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3564 resets, run finished after 430 ms. (steps per millisecond=232 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3437 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3501 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3517 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3489 resets, run finished after 487 ms. (steps per millisecond=205 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 3478 resets, run finished after 451 ms. (steps per millisecond=221 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2022-05-16 17:32:38] [INFO ] Flow matrix only has 182 transitions (discarded 4 similar events)
// Phase 1: matrix 182 rows 78 cols
[2022-05-16 17:32:38] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 17:32:39] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 17:32:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 17:32:39] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 17:32:39] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-16 17:32:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 17:32:39] [INFO ] After 189ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-16 17:32:39] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2022-05-16 17:32:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-16 17:32:39] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2022-05-16 17:32:39] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2022-05-16 17:32:40] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-05-16 17:32:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2022-05-16 17:32:40] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-05-16 17:32:40] [INFO ] After 1465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 16 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 56 transition count 142
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 56 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 56 transition count 139
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 1 with 4 rules applied. Total rules applied 51 place count 54 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 51 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 51 transition count 153
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 77 place count 51 transition count 153
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 51 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 50 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 50 transition count 149
Applied a total of 84 rules in 36 ms. Remains 50 /78 variables (removed 28) and now considering 149/186 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/78 places, 149/186 transitions.
Interrupted random walk after 917880 steps, including 284734 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 5
Incomplete Best-First random walk after 1000001 steps, including 35088 resets, run finished after 3812 ms. (steps per millisecond=262 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35031 resets, run finished after 3831 ms. (steps per millisecond=261 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 1000001 steps, including 35018 resets, run finished after 3223 ms. (steps per millisecond=310 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35079 resets, run finished after 3189 ms. (steps per millisecond=313 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 35088 resets, run finished after 3005 ms. (steps per millisecond=332 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35182 resets, run finished after 2845 ms. (steps per millisecond=351 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35146 resets, run finished after 3113 ms. (steps per millisecond=321 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-16 17:33:33] [INFO ] Flow matrix only has 142 transitions (discarded 7 similar events)
// Phase 1: matrix 142 rows 50 cols
[2022-05-16 17:33:33] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 17:33:33] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 17:33:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 17:33:33] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 17:33:33] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 17:33:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 17:33:33] [INFO ] After 39ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 17:33:34] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2022-05-16 17:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-05-16 17:33:34] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-16 17:33:34] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 44 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 44 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 42 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 42 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 41 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 41 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 40 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 40 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 40 transition count 119
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 1 with 4 rules applied. Total rules applied 29 place count 38 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 36 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 36 transition count 121
Applied a total of 34 rules in 46 ms. Remains 36 /50 variables (removed 14) and now considering 121/149 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/50 places, 121/149 transitions.
Incomplete random walk after 1000000 steps, including 312533 resets, run finished after 15355 ms. (steps per millisecond=65 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 36139 resets, run finished after 2166 ms. (steps per millisecond=461 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 36081 resets, run finished after 2200 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 36220 resets, run finished after 2310 ms. (steps per millisecond=432 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-16 17:33:56] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
// Phase 1: matrix 115 rows 36 cols
[2022-05-16 17:33:56] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-16 17:33:56] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 17:33:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 17:33:56] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 17:33:56] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 17:33:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-16 17:33:56] [INFO ] After 25ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 17:33:56] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-16 17:33:56] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 121/121 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 34 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 33 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 33 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 32 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 32 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 31 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 31 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 31 transition count 101
Applied a total of 15 rules in 39 ms. Remains 31 /36 variables (removed 5) and now considering 101/121 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/36 places, 101/121 transitions.
Incomplete random walk after 1000000 steps, including 316195 resets, run finished after 15968 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37397 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37480 resets, run finished after 2228 ms. (steps per millisecond=448 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 37476 resets, run finished after 2312 ms. (steps per millisecond=432 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2264 steps, run visited all 3 properties in 28 ms. (steps per millisecond=80 )
Probabilistic random walk after 2264 steps, saw 768 distinct states, run finished after 28 ms. (steps per millisecond=80 ) properties seen :3
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 147478 ms.

BK_STOP 1652722459625

--------------------
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="HealthRecord-PT-06"
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 HealthRecord-PT-06, 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 r121-smll-165264480700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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