fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r216-smll-167840358300173
Last Updated
May 14, 2023

About the Execution of Marcie+red for HealthRecord-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
262.092 93563.00 191209.00 548.30 F normal

Execution Chart

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

Trace from the execution

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

--------------------
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 1678625090001

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 12:44:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 12:44:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:44:53] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-12 12:44:53] [INFO ] Transformed 154 places.
[2023-03-12 12:44:53] [INFO ] Transformed 319 transitions.
[2023-03-12 12:44:53] [INFO ] Found NUPN structural information;
[2023-03-12 12:44:53] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 243 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 6 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 18 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 693 ms. (steps per millisecond=14 ) properties (out of 120) seen :73
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Running SMT prover for 44 properties.
[2023-03-12 12:44:54] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2023-03-12 12:44:54] [INFO ] Computed 18 place invariants in 14 ms
[2023-03-12 12:44:55] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-03-12 12:44:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 12:44:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-12 12:44:56] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-03-12 12:44:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 12:44:57] [INFO ] After 505ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :44
[2023-03-12 12:44:57] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 11 ms to minimize.
[2023-03-12 12:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-12 12:44:58] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-03-12 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-12 12:44:58] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2023-03-12 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-12 12:44:58] [INFO ] After 1728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-12 12:44:59] [INFO ] After 3615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Fused 44 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 241 ms.
Support contains 44 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 138 transition count 261
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 32 place count 132 transition count 253
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 130 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 130 transition count 248
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 3 with 11 rules applied. Total rules applied 46 place count 123 transition count 248
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 85 place count 84 transition count 170
Iterating global reduction 3 with 39 rules applied. Total rules applied 124 place count 84 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 79 transition count 160
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 79 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 141 place count 79 transition count 153
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 4 with 12 rules applied. Total rules applied 153 place count 73 transition count 181
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 73 transition count 177
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 171 place count 73 transition count 177
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 184 place count 73 transition count 177
Applied a total of 184 rules in 80 ms. Remains 73 /147 variables (removed 74) and now considering 177/287 (removed 110) transitions.
[2023-03-12 12:44:59] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
// Phase 1: matrix 171 rows 73 cols
[2023-03-12 12:44:59] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 12:44:59] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 73/147 places, 177/287 transitions.
Incomplete random walk after 1000000 steps, including 309935 resets, run finished after 29783 ms. (steps per millisecond=33 ) properties (out of 44) seen :26
Incomplete Best-First random walk after 100001 steps, including 3466 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 100001 steps, including 3500 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 3551 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 100001 steps, including 3509 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3532 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3464 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3485 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3506 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3505 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3534 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100001 steps, including 3532 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 100000 steps, including 3458 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 12:45:33] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
[2023-03-12 12:45:33] [INFO ] Invariant cache hit.
[2023-03-12 12:45:33] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 12:45:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 12:45:33] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-12 12:45:33] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 12:45:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 12:45:33] [INFO ] After 79ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 12:45:33] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-12 12:45:33] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 551 ms.
Support contains 10 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 177/177 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 49 transition count 129
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 49 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 49 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 48 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 48 transition count 126
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 53 place count 47 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 57 place count 45 transition count 132
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 45 transition count 131
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 45 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 44 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 44 transition count 127
Applied a total of 64 rules in 31 ms. Remains 44 /73 variables (removed 29) and now considering 127/177 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 44/73 places, 127/177 transitions.
Incomplete random walk after 1000000 steps, including 310122 resets, run finished after 20369 ms. (steps per millisecond=49 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 1000001 steps, including 34971 resets, run finished after 2134 ms. (steps per millisecond=468 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 34874 resets, run finished after 2104 ms. (steps per millisecond=475 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35022 resets, run finished after 2139 ms. (steps per millisecond=467 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35130 resets, run finished after 2008 ms. (steps per millisecond=498 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 35025 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:46:04] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
// Phase 1: matrix 121 rows 44 cols
[2023-03-12 12:46:04] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 12:46:04] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:46:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 12:46:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-12 12:46:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:46:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 12:46:04] [INFO ] After 23ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:46:04] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 12:46:04] [INFO ] After 192ms 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 50 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 36 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 36 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 34 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 34 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 27 place count 34 transition count 94
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 29 place count 33 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
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 31 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 31 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 31 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 31 transition count 99
Applied a total of 39 rules in 51 ms. Remains 31 /44 variables (removed 13) and now considering 99/127 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 31/44 places, 99/127 transitions.
Incomplete random walk after 1000000 steps, including 315489 resets, run finished after 12910 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37272 resets, run finished after 1885 ms. (steps per millisecond=530 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37232 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 37395 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2161 steps, run visited all 3 properties in 21 ms. (steps per millisecond=102 )
Probabilistic random walk after 2161 steps, saw 718 distinct states, run finished after 22 ms. (steps per millisecond=98 ) 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 88824 ms.
ITS solved all properties within timeout

BK_STOP 1678625183564

--------------------
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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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