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

About the Execution of Smart+red for HealthRecord-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
255.247 54442.00 112353.00 465.40 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.r217-smll-167840359000183.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 smartxred
Input is HealthRecord-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-smll-167840359000183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.8K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:04 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 68K 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 1678626003579

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 13:00:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 13:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:00:06] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-12 13:00:06] [INFO ] Transformed 156 places.
[2023-03-12 13:00:06] [INFO ] Transformed 326 transitions.
[2023-03-12 13:00:06] [INFO ] Found NUPN structural information;
[2023-03-12 13:00:06] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 201 ms.
Graph (trivial) has 266 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 6 ms
Free SCC test removed 6 places
Structural test allowed to assert that 33 places are NOT stable. Took 17 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 755 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 123) seen :73
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 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 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 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 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 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 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 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 :1
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 9 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 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 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 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 13 ms. (steps per millisecond=77 ) 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 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 10 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 6 ms. (steps per millisecond=166 ) 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 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 49) 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 49) 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 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 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 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 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 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 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 49) 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 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 7 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 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Running SMT prover for 48 properties.
[2023-03-12 13:00:07] [INFO ] Flow matrix only has 276 transitions (discarded 18 similar events)
// Phase 1: matrix 276 rows 150 cols
[2023-03-12 13:00:07] [INFO ] Computed 18 place invariants in 14 ms
[2023-03-12 13:00:08] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:48
[2023-03-12 13:00:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-12 13:00:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2023-03-12 13:00:09] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :48
[2023-03-12 13:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:00:10] [INFO ] After 577ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :48
[2023-03-12 13:00:11] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 9 ms to minimize.
[2023-03-12 13:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-12 13:00:11] [INFO ] After 1671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :48
Attempting to minimize the solution found.
Minimization took 558 ms.
[2023-03-12 13:00:11] [INFO ] After 3600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :48
Fused 48 Parikh solutions to 34 different solutions.
Parikh walk visited 1 properties in 409 ms.
Support contains 47 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 294/294 transitions.
Graph (complete) has 650 edges and 150 vertex of which 141 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 10 transitions
Reduce isomorphic transitions removed 10 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 14 rules applied. Total rules applied 15 place count 141 transition count 271
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 9 rules applied. Total rules applied 24 place count 137 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 136 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 136 transition count 263
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 131 transition count 263
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 74 place count 90 transition count 181
Iterating global reduction 3 with 41 rules applied. Total rules applied 115 place count 90 transition count 181
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 85 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 85 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 131 place count 85 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
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 143 place count 79 transition count 194
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 150 place count 79 transition count 187
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 164 place count 79 transition count 187
Applied a total of 164 rules in 70 ms. Remains 79 /150 variables (removed 71) and now considering 187/294 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 79/150 places, 187/294 transitions.
Incomplete random walk after 1000000 steps, including 164426 resets, run finished after 20388 ms. (steps per millisecond=49 ) properties (out of 47) seen :44
Incomplete Best-First random walk after 1000001 steps, including 22282 resets, run finished after 2068 ms. (steps per millisecond=483 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22299 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22404 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:00:38] [INFO ] Flow matrix only has 179 transitions (discarded 8 similar events)
// Phase 1: matrix 179 rows 79 cols
[2023-03-12 13:00:38] [INFO ] Computed 7 place invariants in 12 ms
[2023-03-12 13:00:38] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:00:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:00:38] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 13:00:39] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:00:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:00:39] [INFO ] After 31ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:00:39] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 13:00:39] [INFO ] After 293ms 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 3 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 187/187 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 0 with 1 rules applied. Total rules applied 1 place count 79 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 78 transition count 186
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 33 place count 47 transition count 124
Iterating global reduction 2 with 31 rules applied. Total rules applied 64 place count 47 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 47 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 69 place count 43 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 43 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 40 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 40 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 37 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 37 transition count 97
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 97 place count 37 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 101 place count 35 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 107 place count 32 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 32 transition count 95
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 112 place count 32 transition count 92
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 123 place count 32 transition count 92
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 32 transition count 92
Applied a total of 125 rules in 51 ms. Remains 32 /79 variables (removed 47) and now considering 92/187 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 32/79 places, 92/187 transitions.
Incomplete random walk after 1000000 steps, including 167980 resets, run finished after 12199 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 25630 resets, run finished after 1715 ms. (steps per millisecond=583 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 25551 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 25652 resets, run finished after 1994 ms. (steps per millisecond=501 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1900 steps, run visited all 3 properties in 41 ms. (steps per millisecond=46 )
Probabilistic random walk after 1900 steps, saw 688 distinct states, run finished after 41 ms. (steps per millisecond=46 ) properties seen :3
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 50731 ms.
ITS solved all properties within timeout

BK_STOP 1678626058021

--------------------
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-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is HealthRecord-PT-08, 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 r217-smll-167840359000183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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