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

About the Execution of LTSMin+red for HealthRecord-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
360.800 25346.00 45537.00 556.30 FFTTFFTTTTFFTTFT 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-167840347600335.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 71K 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-13-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678640544813

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:02:28] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-12 17:02:28] [INFO ] Transformed 161 places.
[2023-03-12 17:02:28] [INFO ] Transformed 341 transitions.
[2023-03-12 17:02:28] [INFO ] Found NUPN structural information;
[2023-03-12 17:02:28] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Incomplete random walk after 10000 steps, including 776 resets, run finished after 1152 ms. (steps per millisecond=8 ) properties (out of 16) seen :1
FORMULA HealthRecord-PT-13-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 490446 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{2=1, 4=1, 6=1, 12=1}
Probabilistic random walk after 490446 steps, saw 68484 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :4
FORMULA HealthRecord-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
[2023-03-12 17:02:33] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2023-03-12 17:02:33] [INFO ] Computed 18 place invariants in 15 ms
[2023-03-12 17:02:33] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 17:02:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2023-03-12 17:02:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-12 17:02:34] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-12 17:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:34] [INFO ] After 341ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 5 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 771 ms
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:02:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 637 ms
[2023-03-12 17:02:36] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-12 17:02:36] [INFO ] After 2450ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-12 17:02:37] [INFO ] After 3559ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA HealthRecord-PT-13-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 68 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 83 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 685 edges and 159 vertex of which 151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output 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 3 place count 151 transition count 295
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 150 transition count 293
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 149 transition count 292
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 48 place count 109 transition count 212
Iterating global reduction 3 with 40 rules applied. Total rules applied 88 place count 109 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 107 transition count 208
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 107 transition count 208
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 3 with 4 rules applied. Total rules applied 96 place count 105 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 103 transition count 207
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 103 transition count 206
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 103 transition count 206
Applied a total of 102 rules in 86 ms. Remains 103 /161 variables (removed 58) and now considering 206/313 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 103/161 places, 206/313 transitions.
Incomplete random walk after 10000 steps, including 1126 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 201 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 196 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :1
FORMULA HealthRecord-PT-13-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 207 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 193 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 17:02:38] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
// Phase 1: matrix 205 rows 103 cols
[2023-03-12 17:02:38] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 17:02:38] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 17:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-12 17:02:38] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 17:02:38] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 17:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:38] [INFO ] After 147ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 17:02:38] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 272 ms
[2023-03-12 17:02:39] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2023-03-12 17:02:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-12 17:02:39] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-12 17:02:39] [INFO ] After 1185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA HealthRecord-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 26 ms.
Support contains 41 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 206/206 transitions.
Graph (trivial) has 46 edges and 103 vertex of which 2 / 103 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 432 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 101 transition count 203
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 100 transition count 202
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 24 place count 81 transition count 164
Iterating global reduction 2 with 19 rules applied. Total rules applied 43 place count 81 transition count 164
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 2 with 4 rules applied. Total rules applied 47 place count 79 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 78 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 78 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 77 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 77 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 76 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 76 transition count 157
Applied a total of 54 rules in 37 ms. Remains 76 /103 variables (removed 27) and now considering 157/206 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 76/103 places, 157/206 transitions.
Incomplete random walk after 10000 steps, including 1124 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 150 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1066671 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066671 steps, saw 130412 distinct states, run finished after 3002 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:02:42] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
// Phase 1: matrix 156 rows 76 cols
[2023-03-12 17:02:42] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-12 17:02:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:02:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 17:02:43] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:02:43] [INFO ] After 57ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 17:02:43] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 17:02:43] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA HealthRecord-PT-13-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
Support contains 39 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 157/157 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 153
Applied a total of 4 rules in 7 ms. Remains 74 /76 variables (removed 2) and now considering 153/157 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 74/76 places, 153/157 transitions.
Incomplete random walk after 10000 steps, including 1131 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2205344 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :{}
Probabilistic random walk after 2205344 steps, saw 268767 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:02:46] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
// Phase 1: matrix 152 rows 74 cols
[2023-03-12 17:02:46] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 17:02:46] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:02:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 17:02:46] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:02:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:02:46] [INFO ] After 72ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:02:46] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 17:02:46] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 153/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 74/74 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 153/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-12 17:02:46] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
[2023-03-12 17:02:46] [INFO ] Invariant cache hit.
[2023-03-12 17:02:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 17:02:46] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
[2023-03-12 17:02:46] [INFO ] Invariant cache hit.
[2023-03-12 17:02:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:02:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-12 17:02:47] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-12 17:02:47] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
[2023-03-12 17:02:47] [INFO ] Invariant cache hit.
[2023-03-12 17:02:47] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 74/74 places, 153/153 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 152
Applied a total of 1 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 152/153 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 74 cols
[2023-03-12 17:02:47] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 17:02:47] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:02:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 17:02:47] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:02:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-12 17:02:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-12 17:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-12 17:02:47] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-12 17:02:47] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:02:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 17:02:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 153 transitions and 536 arcs took 2 ms.
[2023-03-12 17:02:48] [INFO ] Flatten gal took : 91 ms
Total runtime 19980 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/588/inv_0_ --inv-par
FORMULA HealthRecord-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640570159

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name HealthRecord-PT-13-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_0_
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 74 places, 153 transitions and 536 arcs
pnml2lts-sym: Petri net HealthRecord_PT_13 analyzed
pnml2lts-sym: There are no 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: 153->126 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 74; there are 126 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:
pnml2lts-sym: Invariant violation (/tmp/588/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.530 real 2.090 user 0.020 sys
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-13"
export BK_EXAMINATION="ReachabilityFireability"
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-13, examination is ReachabilityFireability"
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-167840347600335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;