Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r215-smll-167840357800173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HealthRecord-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-167840357800173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678618173857

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:49:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 10:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:49:37] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 10:49:37] [INFO ] Transformed 154 places.
[2023-03-12 10:49:37] [INFO ] Transformed 319 transitions.
[2023-03-12 10:49:37] [INFO ] Found NUPN structural information;
[2023-03-12 10:49:37] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 312 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 22 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 722 resets, run finished after 913 ms. (steps per millisecond=10 ) properties (out of 120) seen :69
Incomplete Best-First random walk after 1001 steps, including 8 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 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) 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 51) 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 51) 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 51) 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 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) 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 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) 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 50) 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 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 8 ms. (steps per millisecond=125 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) 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 50) seen :1
Incomplete Best-First random walk after 1000 steps, including 8 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 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 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 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-12 10:49:39] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2023-03-12 10:49:39] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-12 10:49:39] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-03-12 10:49:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 10:49:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 10:49:41] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-03-12 10:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 10:49:41] [INFO ] After 523ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2023-03-12 10:49:42] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 9 ms to minimize.
[2023-03-12 10:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-12 10:49:42] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2023-03-12 10:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-12 10:49:42] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2023-03-12 10:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-12 10:49:42] [INFO ] After 1725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 510 ms.
[2023-03-12 10:49:43] [INFO ] After 3477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Fused 49 Parikh solutions to 33 different solutions.
Parikh walk visited 1 properties in 295 ms.
Support contains 48 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.2 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 138 transition count 263
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 24 place count 134 transition count 259
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 24 place count 134 transition count 255
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 35 place count 127 transition count 255
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 73 place count 89 transition count 179
Iterating global reduction 2 with 38 rules applied. Total rules applied 111 place count 89 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 84 transition count 169
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 84 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 84 transition count 163
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 139 place count 78 transition count 191
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 78 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 78 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 77 transition count 182
Applied a total of 149 rules in 71 ms. Remains 77 /147 variables (removed 70) and now considering 182/287 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 77/147 places, 182/287 transitions.
Interrupted random walk after 961437 steps, including 288572 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 24
Incomplete Best-First random walk after 100001 steps, including 3634 resets, run finished after 355 ms. (steps per millisecond=281 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3629 resets, run finished after 420 ms. (steps per millisecond=238 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3598 resets, run finished after 476 ms. (steps per millisecond=210 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 3666 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3587 resets, run finished after 433 ms. (steps per millisecond=230 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3633 resets, run finished after 397 ms. (steps per millisecond=251 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3624 resets, run finished after 400 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3631 resets, run finished after 370 ms. (steps per millisecond=270 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3609 resets, run finished after 402 ms. (steps per millisecond=248 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3572 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3609 resets, run finished after 402 ms. (steps per millisecond=248 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3646 resets, run finished after 396 ms. (steps per millisecond=252 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 3629 resets, run finished after 389 ms. (steps per millisecond=257 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 3661 resets, run finished after 413 ms. (steps per millisecond=242 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3554 resets, run finished after 402 ms. (steps per millisecond=248 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3638 resets, run finished after 371 ms. (steps per millisecond=269 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3612 resets, run finished after 373 ms. (steps per millisecond=268 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3621 resets, run finished after 317 ms. (steps per millisecond=315 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 3593 resets, run finished after 253 ms. (steps per millisecond=395 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3648 resets, run finished after 250 ms. (steps per millisecond=400 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3642 resets, run finished after 251 ms. (steps per millisecond=398 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3633 resets, run finished after 249 ms. (steps per millisecond=401 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3593 resets, run finished after 247 ms. (steps per millisecond=404 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 3641 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-12 10:50:22] [INFO ] Flow matrix only has 177 transitions (discarded 5 similar events)
// Phase 1: matrix 177 rows 77 cols
[2023-03-12 10:50:22] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 10:50:22] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 10:50:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:50:22] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 10:50:23] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 10:50:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 10:50:23] [INFO ] After 187ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 10:50:23] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2023-03-12 10:50:23] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2023-03-12 10:50:23] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2023-03-12 10:50:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2023-03-12 10:50:23] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2023-03-12 10:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-12 10:50:23] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-12 10:50:24] [INFO ] After 1408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 24 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 182/182 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 77 transition count 179
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 74 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 20 place count 61 transition count 152
Iterating global reduction 2 with 13 rules applied. Total rules applied 33 place count 61 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 61 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 60 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 57 transition count 160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 57 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 56 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 56 transition count 155
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 56 transition count 155
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 76 place count 56 transition count 155
Applied a total of 76 rules in 42 ms. Remains 56 /77 variables (removed 21) and now considering 155/182 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 56/77 places, 155/182 transitions.
Incomplete random walk after 1000000 steps, including 310664 resets, run finished after 26256 ms. (steps per millisecond=38 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 1000001 steps, including 35187 resets, run finished after 3074 ms. (steps per millisecond=325 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34939 resets, run finished after 3118 ms. (steps per millisecond=320 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35135 resets, run finished after 3297 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34860 resets, run finished after 3232 ms. (steps per millisecond=309 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35222 resets, run finished after 3223 ms. (steps per millisecond=310 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 34940 resets, run finished after 3309 ms. (steps per millisecond=302 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35023 resets, run finished after 3040 ms. (steps per millisecond=328 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 34996 resets, run finished after 3235 ms. (steps per millisecond=309 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34930 resets, run finished after 3222 ms. (steps per millisecond=310 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000000 steps, including 34965 resets, run finished after 3107 ms. (steps per millisecond=321 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1000001 steps, including 35051 resets, run finished after 2974 ms. (steps per millisecond=336 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 10:51:25] [INFO ] Flow matrix only has 148 transitions (discarded 7 similar events)
// Phase 1: matrix 148 rows 56 cols
[2023-03-12 10:51:25] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 10:51:25] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 10:51:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:51:25] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 10:51:25] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 10:51:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 10:51:25] [INFO ] After 92ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 10:51:25] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-12 10:51:25] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 237 ms.
Support contains 9 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 155/155 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 47 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 47 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 46 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 46 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 45 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 45 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 44 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 44 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 44 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 43 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 40 transition count 129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 40 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 40 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 39 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 39 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 38 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 38 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 37 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 37 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 37 transition count 110
Applied a total of 50 rules in 55 ms. Remains 37 /56 variables (removed 19) and now considering 110/155 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 37/56 places, 110/155 transitions.
Incomplete random walk after 1000000 steps, including 316301 resets, run finished after 20322 ms. (steps per millisecond=49 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 1000001 steps, including 37414 resets, run finished after 2431 ms. (steps per millisecond=411 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37454 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37290 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37188 resets, run finished after 2293 ms. (steps per millisecond=436 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 37219 resets, run finished after 2297 ms. (steps per millisecond=435 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:51:58] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
// Phase 1: matrix 105 rows 37 cols
[2023-03-12 10:51:58] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 10:51:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:51:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:51:58] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-12 10:51:58] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 10:51:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-12 10:51:58] [INFO ] After 29ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 10:51:58] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 10:51:58] [INFO ] After 190ms 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 97 ms.
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 35 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 34 transition count 107
Applied a total of 7 rules in 17 ms. Remains 34 /37 variables (removed 3) and now considering 107/110 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 34/37 places, 107/110 transitions.
Incomplete random walk after 1000000 steps, including 316231 resets, run finished after 12242 ms. (steps per millisecond=81 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 37405 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37183 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37379 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 10:52:15] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
// Phase 1: matrix 102 rows 34 cols
[2023-03-12 10:52:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 10:52:15] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:52:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 10:52:15] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 10:52:15] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:52:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 10:52:15] [INFO ] After 27ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:52:15] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 10:52:15] [INFO ] After 181ms 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 53 ms.
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 107/107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 106
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 32 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 31 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 31 transition count 101
Applied a total of 6 rules in 9 ms. Remains 31 /34 variables (removed 3) and now considering 101/107 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 31/34 places, 101/107 transitions.
Incomplete random walk after 1000000 steps, including 316037 resets, run finished after 11495 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37159 resets, run finished after 1536 ms. (steps per millisecond=651 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37431 resets, run finished after 1504 ms. (steps per millisecond=664 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37312 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2264 steps, run visited all 3 properties in 41 ms. (steps per millisecond=55 )
Probabilistic random walk after 2264 steps, saw 768 distinct states, run finished after 41 ms. (steps per millisecond=55 ) properties seen :3
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 174122 ms.
ITS solved all properties within timeout

BK_STOP 1678618352634

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r215-smll-167840357800173"
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 ;