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-167840347600358.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-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.4K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 18:06 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 125K 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-16-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678641337523

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-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:15:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:15:40] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-12 17:15:40] [INFO ] Transformed 453 places.
[2023-03-12 17:15:40] [INFO ] Transformed 594 transitions.
[2023-03-12 17:15:40] [INFO ] Found NUPN structural information;
[2023-03-12 17:15:40] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-16-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 58 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 15) seen :4
FORMULA HealthRecord-PT-16-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 594 rows 453 cols
[2023-03-12 17:15:41] [INFO ] Computed 14 place invariants in 35 ms
[2023-03-12 17:15:42] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 17:15:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2023-03-12 17:15:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-12 17:15:43] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-12 17:15:44] [INFO ] Deduced a trap composed of 100 places in 229 ms of which 9 ms to minimize.
[2023-03-12 17:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-12 17:15:44] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 1 ms to minimize.
[2023-03-12 17:15:44] [INFO ] Deduced a trap composed of 99 places in 190 ms of which 2 ms to minimize.
[2023-03-12 17:15:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-12 17:15:44] [INFO ] Deduced a trap composed of 105 places in 173 ms of which 2 ms to minimize.
[2023-03-12 17:15:45] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 1 ms to minimize.
[2023-03-12 17:15:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2023-03-12 17:15:45] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 1 ms to minimize.
[2023-03-12 17:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-12 17:15:45] [INFO ] After 2625ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-12 17:15:46] [INFO ] After 3501ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA HealthRecord-PT-16-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA HealthRecord-PT-16-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 115 ms.
Support contains 69 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 400 edges and 453 vertex of which 33 / 453 are part of one of the 13 SCC in 6 ms
Free SCC test removed 20 places
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Graph (complete) has 838 edges and 433 vertex of which 422 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 422 transition count 400
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 167 rules applied. Total rules applied 324 place count 267 transition count 388
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 29 rules applied. Total rules applied 353 place count 264 transition count 362
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 30 rules applied. Total rules applied 383 place count 238 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 237 transition count 358
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 384 place count 237 transition count 351
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 398 place count 230 transition count 351
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 440 place count 188 transition count 270
Iterating global reduction 5 with 42 rules applied. Total rules applied 482 place count 188 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 485 place count 188 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 486 place count 187 transition count 267
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 488 place count 185 transition count 263
Iterating global reduction 7 with 2 rules applied. Total rules applied 490 place count 185 transition count 263
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 524 place count 168 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 525 place count 168 transition count 245
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 543 place count 159 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 547 place count 159 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 549 place count 158 transition count 305
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 556 place count 158 transition count 298
Free-agglomeration rule applied 14 times.
Iterating global reduction 9 with 14 rules applied. Total rules applied 570 place count 158 transition count 284
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 584 place count 144 transition count 284
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 592 place count 144 transition count 276
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 595 place count 144 transition count 276
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 602 place count 144 transition count 276
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 604 place count 142 transition count 274
Iterating global reduction 10 with 2 rules applied. Total rules applied 606 place count 142 transition count 274
Applied a total of 606 rules in 248 ms. Remains 142 /453 variables (removed 311) and now considering 274/594 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 142/453 places, 274/594 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 660288 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 660288 steps, saw 126775 distinct states, run finished after 3003 ms. (steps per millisecond=219 ) properties seen :4
FORMULA HealthRecord-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-12 17:15:49] [INFO ] Flow matrix only has 271 transitions (discarded 3 similar events)
// Phase 1: matrix 271 rows 142 cols
[2023-03-12 17:15:49] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-12 17:15:50] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:15:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 17:15:50] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:15:50] [INFO ] After 66ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:50] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-12 17:15:50] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 17:15:50] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 42 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 274/274 transitions.
Graph (trivial) has 72 edges and 142 vertex of which 9 / 142 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 386 edges and 137 vertex of which 135 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 4 rules applied. Total rules applied 6 place count 135 transition count 260
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 131 transition count 260
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 131 transition count 255
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 126 transition count 255
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 124 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 124 transition count 251
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 116 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 116 transition count 240
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 57 place count 109 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 108 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 108 transition count 256
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 108 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 107 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 107 transition count 249
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 106 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 106 transition count 247
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 106 transition count 245
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 106 transition count 239
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 80 place count 100 transition count 239
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 100 transition count 237
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 100 transition count 237
Applied a total of 83 rules in 78 ms. Remains 100 /142 variables (removed 42) and now considering 237/274 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 100/142 places, 237/274 transitions.
Incomplete random walk after 10000 steps, including 439 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1744288 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1744288 steps, saw 277541 distinct states, run finished after 3004 ms. (steps per millisecond=580 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:15:53] [INFO ] Flow matrix only has 231 transitions (discarded 6 similar events)
// Phase 1: matrix 231 rows 100 cols
[2023-03-12 17:15:53] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 17:15:53] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:15:53] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 17:15:53] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-12 17:15:54] [INFO ] After 66ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:54] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:15:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:15:54] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2023-03-12 17:15:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2023-03-12 17:15:54] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 17:15:54] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 42 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 237/237 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 100/100 places, 237/237 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 237/237 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 237/237 (removed 0) transitions.
[2023-03-12 17:15:54] [INFO ] Flow matrix only has 231 transitions (discarded 6 similar events)
[2023-03-12 17:15:54] [INFO ] Invariant cache hit.
[2023-03-12 17:15:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 17:15:54] [INFO ] Flow matrix only has 231 transitions (discarded 6 similar events)
[2023-03-12 17:15:54] [INFO ] Invariant cache hit.
[2023-03-12 17:15:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-12 17:15:54] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-12 17:15:54] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 17:15:54] [INFO ] Flow matrix only has 231 transitions (discarded 6 similar events)
[2023-03-12 17:15:54] [INFO ] Invariant cache hit.
[2023-03-12 17:15:54] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 100/100 places, 237/237 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 100 transition count 231
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 36 place count 100 transition count 201
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 100 transition count 201
Applied a total of 37 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 201/237 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 201 rows 100 cols
[2023-03-12 17:15:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 17:15:54] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:15:54] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 17:15:55] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:55] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 3 ms to minimize.
[2023-03-12 17:15:55] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:15:55] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2023-03-12 17:15:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2023-03-12 17:15:55] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 17:15:55] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:15:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 17:15:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 237 transitions and 793 arcs took 2 ms.
[2023-03-12 17:15:55] [INFO ] Flatten gal took : 90 ms
Total runtime 15664 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 --invariant=/tmp/539/inv_0_ --inv-par
FORMULA HealthRecord-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678641357638

--------------------
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-16-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/539/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 100 places, 237 transitions and 793 arcs
pnml2lts-sym: Petri net HealthRecord_PT_16 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 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: 237->191 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 100; there are 191 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/539/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.390 real 1.560 user 0.000 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-16"
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-16, 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-167840347600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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