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

About the Execution of LTSMin+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
301.300 29541.00 86556.00 600.60 TTTTFFFTTFTFTFFF 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.r201-smll-167840347500278.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347500278
=====================================================================

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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678639146749

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:39:10] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-12 16:39:10] [INFO ] Transformed 154 places.
[2023-03-12 16:39:10] [INFO ] Transformed 319 transitions.
[2023-03-12 16:39:10] [INFO ] Found NUPN structural information;
[2023-03-12 16:39:10] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 512 resets, run finished after 1360 ms. (steps per millisecond=7 ) properties (out of 15) seen :2
FORMULA HealthRecord-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 16:39:13] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2023-03-12 16:39:13] [INFO ] Computed 18 place invariants in 18 ms
[2023-03-12 16:39:14] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 16:39:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-12 16:39:14] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 16:39:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 16:39:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-12 16:39:14] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-03-12 16:39:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:39:15] [INFO ] After 318ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2023-03-12 16:39:15] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 11 ms to minimize.
[2023-03-12 16:39:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-12 16:39:15] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-03-12 16:39:15] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2023-03-12 16:39:15] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 682 ms
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 93 ms
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-12 16:39:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 516 ms
[2023-03-12 16:39:16] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2023-03-12 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-12 16:39:17] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-12 16:39:17] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2023-03-12 16:39:17] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2023-03-12 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-03-12 16:39:17] [INFO ] After 2603ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-12 16:39:17] [INFO ] After 3704ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
FORMULA HealthRecord-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 88 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 32 edges and 154 vertex of which 2 / 154 are part of one of the 1 SCC in 21 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 648 edges and 153 vertex of which 147 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 32 place count 117 transition count 219
Iterating global reduction 0 with 30 rules applied. Total rules applied 62 place count 117 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 64 place count 116 transition count 222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 116 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 65 place count 116 transition count 220
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 67 place count 115 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 115 transition count 220
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 115 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 70 place count 114 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 71 place count 114 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 114 transition count 218
Applied a total of 72 rules in 238 ms. Remains 114 /154 variables (removed 40) and now considering 218/294 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 114/154 places, 218/294 transitions.
Incomplete random walk after 10000 steps, including 541 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 8) seen :1
FORMULA HealthRecord-PT-06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 218 rows 114 cols
[2023-03-12 16:39:18] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-12 16:39:19] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 16:39:19] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-12 16:39:19] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:39:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 16:39:19] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 16:39:19] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:39:19] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2023-03-12 16:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-12 16:39:19] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2023-03-12 16:39:19] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2023-03-12 16:39:19] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2023-03-12 16:39:19] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 847 ms
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2023-03-12 16:39:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-03-12 16:39:20] [INFO ] After 1641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-12 16:39:20] [INFO ] After 1908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA HealthRecord-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 17 ms.
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 218/218 transitions.
Graph (trivial) has 147 edges and 114 vertex of which 10 / 114 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 457 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 105 transition count 203
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 100 transition count 196
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 23 place count 97 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 97 transition count 194
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 25 place count 96 transition count 194
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 68 place count 53 transition count 106
Iterating global reduction 3 with 43 rules applied. Total rules applied 111 place count 53 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 53 transition count 103
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 47 transition count 89
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 47 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 46 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 46 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 45 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 45 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 136 place count 45 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 139 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 43 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 148 place count 39 transition count 109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 149 place count 38 transition count 104
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 38 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 154 place count 38 transition count 100
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 155 place count 37 transition count 96
Iterating global reduction 8 with 1 rules applied. Total rules applied 156 place count 37 transition count 96
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 157 place count 36 transition count 93
Iterating global reduction 8 with 1 rules applied. Total rules applied 158 place count 36 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 162 place count 36 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 163 place count 36 transition count 88
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 167 place count 36 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 171 place count 32 transition count 84
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 174 place count 32 transition count 81
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 185 place count 32 transition count 81
Applied a total of 185 rules in 121 ms. Remains 32 /114 variables (removed 82) and now considering 81/218 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 32/114 places, 81/218 transitions.
Incomplete random walk after 10000 steps, including 1221 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 232 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished probabilistic random walk after 846 steps, run visited all 2 properties in 20 ms. (steps per millisecond=42 )
Probabilistic random walk after 846 steps, saw 293 distinct states, run finished after 21 ms. (steps per millisecond=40 ) properties seen :2
FORMULA HealthRecord-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10852 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/546/inv_0_ --invariant=/tmp/546/inv_1_ --invariant=/tmp/546/inv_2_ --invariant=/tmp/546/inv_3_ --invariant=/tmp/546/inv_4_ --invariant=/tmp/546/inv_5_ --invariant=/tmp/546/inv_6_ --invariant=/tmp/546/inv_7_ --invariant=/tmp/546/inv_8_ --invariant=/tmp/546/inv_9_ --invariant=/tmp/546/inv_10_ --invariant=/tmp/546/inv_11_ --invariant=/tmp/546/inv_12_ --invariant=/tmp/546/inv_13_ --invariant=/tmp/546/inv_14_ --invariant=/tmp/546/inv_15_ --inv-par
FORMULA HealthRecord-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639176290

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_0_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_1_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_2_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_3_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_4_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_5_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_6_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_7_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_8_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_9_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_10_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_11_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_12_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_13_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/546/inv_14_
rfs formula name HealthRecord-PT-06-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/546/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 154 places, 319 transitions and 835 arcs
pnml2lts-sym: Petri net HealthRecord-PT-06 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 319->291 groups
pnml2lts-sym: Regrouping took 0.100 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 154; there are 291 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/546/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 4010557 group checks and 0 next state calls
pnml2lts-sym: reachability took 13.200 real 52.500 user 0.210 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 505148172 states, 56170 nodes
pnml2lts-sym: group_next: 1497 nodes total
pnml2lts-sym: group_explored: 770 nodes, 3838 short vectors total
pnml2lts-sym: max token count: 1

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="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347500278"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;