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.r203-smll-167840349400318.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349400318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 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 70K 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-11-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678582433975

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 00:53:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 00:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:53:57] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 00:53:57] [INFO ] Transformed 159 places.
[2023-03-12 00:53:57] [INFO ] Transformed 334 transitions.
[2023-03-12 00:53:57] [INFO ] Found NUPN structural information;
[2023-03-12 00:53:57] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 671 resets, run finished after 850 ms. (steps per millisecond=11 ) properties (out of 13) seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 1094098 steps, run timeout after 6001 ms. (steps per millisecond=182 ) properties seen :{0=1, 6=1}
Probabilistic random walk after 1094098 steps, saw 146666 distinct states, run finished after 6003 ms. (steps per millisecond=182 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-03-12 00:54:06] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-12 00:54:06] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-12 00:54:06] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 00:54:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-12 00:54:07] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-12 00:54:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 00:54:07] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-12 00:54:07] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 00:54:07] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-12 00:54:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-12 00:54:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-12 00:54:07] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 00:54:08] [INFO ] After 302ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 00:54:08] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2023-03-12 00:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-12 00:54:08] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-12 00:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-12 00:54:08] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2023-03-12 00:54:08] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2023-03-12 00:54:08] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-12 00:54:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2023-03-12 00:54:09] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2023-03-12 00:54:09] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2023-03-12 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-12 00:54:09] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2023-03-12 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-12 00:54:09] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2023-03-12 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-12 00:54:09] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2023-03-12 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-12 00:54:09] [INFO ] After 2017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 343 ms.
[2023-03-12 00:54:10] [INFO ] After 3070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 60 ms.
Support contains 106 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 25 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 675 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 23 place count 135 transition count 250
Iterating global reduction 0 with 21 rules applied. Total rules applied 44 place count 135 transition count 250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 46 place count 134 transition count 250
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 134 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 47 place count 134 transition count 248
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 49 place count 133 transition count 248
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 133 transition count 248
Applied a total of 50 rules in 100 ms. Remains 133 /159 variables (removed 26) and now considering 248/307 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 133/159 places, 248/307 transitions.
Incomplete random walk after 10000 steps, including 732 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 619899 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619899 steps, saw 89252 distinct states, run finished after 3004 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 248 rows 133 cols
[2023-03-12 00:54:14] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-12 00:54:14] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-12 00:54:14] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 48 ms returned sat
[2023-03-12 00:54:14] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 00:54:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-12 00:54:14] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-12 00:54:15] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 00:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 00:54:15] [INFO ] After 343ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 00:54:15] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2023-03-12 00:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 698 ms
[2023-03-12 00:54:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2023-03-12 00:54:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-12 00:54:16] [INFO ] After 1600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-12 00:54:17] [INFO ] After 2484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 46 ms.
Support contains 39 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 248/248 transitions.
Graph (trivial) has 98 edges and 133 vertex of which 6 / 133 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 573 edges and 130 vertex of which 124 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 241
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 123 transition count 240
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 38 place count 90 transition count 175
Iterating global reduction 2 with 33 rules applied. Total rules applied 71 place count 90 transition count 175
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 87 transition count 169
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 87 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 87 transition count 165
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 84 transition count 162
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 81 transition count 187
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 100 place count 81 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 100 place count 81 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 79 transition count 178
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 124 place count 79 transition count 178
Applied a total of 124 rules in 48 ms. Remains 79 /133 variables (removed 54) and now considering 178/248 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 79/133 places, 178/248 transitions.
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 189 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 193 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 191 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1620629 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 1620629 steps, saw 219830 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :4
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-12 00:54:20] [INFO ] Flow matrix only has 174 transitions (discarded 4 similar events)
// Phase 1: matrix 174 rows 79 cols
[2023-03-12 00:54:20] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-12 00:54:20] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:54:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 00:54:20] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:54:20] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 00:54:20] [INFO ] After 27ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 00:54:20] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 00:54:21] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 178/178 transitions.
Graph (trivial) has 44 edges and 79 vertex of which 2 / 79 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.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 62 transition count 145
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 62 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 36 place count 59 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 59 transition count 137
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 0 with 4 rules applied. Total rules applied 43 place count 57 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 44 place count 56 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 56 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 46 place count 55 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 55 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 48 place count 54 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 54 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 52 place count 54 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 52 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 52 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 51 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 50 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 50 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 50 transition count 114
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 50 transition count 111
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 50 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 47 transition count 108
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 47 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 47 transition count 106
Applied a total of 77 rules in 58 ms. Remains 47 /79 variables (removed 32) and now considering 106/178 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 47/79 places, 106/178 transitions.
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 201 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 268152 steps, run visited all 1 properties in 310 ms. (steps per millisecond=865 )
Probabilistic random walk after 268152 steps, saw 45247 distinct states, run finished after 311 ms. (steps per millisecond=862 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 24110 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HealthRecord (PT), instance 11
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 159 places, 334 transitions, 879 arcs.
Final Score: 3241.672
Took : 16 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P147)) <= ( 1 ) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-01 (reachable & potential((! ( ( (tk(P112)) <= (tk(P56)) ) | (! ( ( ( ( ( ( (tk(P2)) <= (tk(P4)) ) | ( (tk(P107)) <= (tk(P118)) ) ) | ( (tk(P130)) <= (tk(P102)) ) ) | ( (! ( (tk(P8)) <= (tk(P156)) )) | ( ( (tk(P118)) <= (tk(P1)) ) | ( (tk(P75)) <= (tk(P69)) ) ) ) ) & ( ( 1 ) <= (tk(P72)) ) ) | ( (tk(P13)) <= (tk(P148)) ) )) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-02 (reachable & potential((! ( (tk(P90)) <= (tk(P15)) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-03 (reachable &!potential( (! ( ( 1 ) <= (tk(P153)) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-04 (reachable & potential(( ( ( ( (tk(P11)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P159)) ) ) & (! ( ( (tk(P60)) <= ( 0 ) ) | ( ( ( ( ( ( (tk(P64)) <= ( 0 ) ) | ( (tk(P87)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P3)) )) ) | (! ( ( (tk(P2)) <= (tk(P95)) ) | ( ( 1 ) <= (tk(P130)) ) )) ) & ( (tk(P15)) <= (tk(P36)) ) ) & ( ( (! ( (tk(P34)) <= ( 0 ) )) | ( (tk(P7)) <= (tk(P59)) ) ) | (! ( ( 1 ) <= (tk(P85)) )) ) ) )) ) | (! ( (! ( (! ( ( ( ( 1 ) <= (tk(P97)) ) | ( ( 1 ) <= (tk(P5)) ) ) | ( ( ( 1 ) <= (tk(P147)) ) & ( (tk(P5)) <= ( 0 ) ) ) )) & ( ( ( ( ( 1 ) <= (tk(P117)) ) & ( (tk(P98)) <= ( 1 ) ) ) & ( ( ( (tk(P126)) <= (tk(P86)) ) | ( ( 1 ) <= (tk(P86)) ) ) | (! ( (tk(P53)) <= ( 1 ) )) ) ) & ( (! ( ( (tk(P67)) <= ( 0 ) ) | ( (tk(P103)) <= (tk(P60)) ) )) | (! ( ( (tk(P65)) <= ( 0 ) ) & ( (tk(P93)) <= ( 0 ) ) )) ) ) )) | (! ( ( (tk(P63)) <= (tk(P29)) ) | ( ( (! ( ( 1 ) <= (tk(P111)) )) & ( ( 1 ) <= (tk(P158)) ) ) & ( ( ( ( (tk(P149)) <= (tk(P5)) ) | ( (tk(P5)) <= (tk(P35)) ) ) & ( ( (tk(P140)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P41)) ) ) ) | ( ( ( (tk(P43)) <= (tk(P121)) ) | ( (tk(P48)) <= ( 1 ) ) ) & ( (tk(P99)) <= (tk(P125)) ) ) ) ) )) )) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-05 (reachable & potential((! ( ( ( (tk(P52)) <= ( 1 ) ) | ( (! ( (tk(P22)) <= (tk(P136)) )) & ( ( (tk(P88)) <= (tk(P107)) ) & (! ( ( ( ( (tk(P92)) <= (tk(P139)) ) & ( (tk(P152)) <= (tk(P85)) ) ) & ( ( (tk(P33)) <= ( 1 ) ) & ( (tk(P130)) <= (tk(P109)) ) ) ) & ( ( 1 ) <= (tk(P158)) ) )) ) ) ) & ( (tk(P10)) <= (tk(P113)) ) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P131)) <= ( 1 ) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-07 (reachable & potential((! ( ( ( (tk(P30)) <= (tk(P145)) ) | (! ( (tk(P157)) <= (tk(P78)) )) ) | ( ( (! ( (tk(P139)) <= (tk(P14)) )) | ( (tk(P134)) <= ( 1 ) ) ) & ( ( ( (! ( (! ( ( 1 ) <= (tk(P101)) )) & ( ( ( 1 ) <= (tk(P45)) ) | ( (tk(P7)) <= ( 1 ) ) ) )) & ( ( ( ( ( 1 ) <= (tk(P100)) ) & ( (tk(P98)) <= (tk(P29)) ) ) & ( ( 1 ) <= (tk(P123)) ) ) & (! ( ( (tk(P57)) <= ( 0 ) ) | ( (tk(P73)) <= ( 0 ) ) )) ) ) & ( ( ( 1 ) <= (tk(P114)) ) | ( ( ( (tk(P100)) <= (tk(P126)) ) | ( (tk(P101)) <= (tk(P102)) ) ) | ( (tk(P29)) <= ( 0 ) ) ) ) ) | ( (! ( (! ( ( 1 ) <= (tk(P78)) )) | (! ( ( 1 ) <= (tk(P98)) )) )) & ( ( (tk(P135)) <= ( 1 ) ) | ( (! ( ( (tk(P133)) <= ( 1 ) ) | ( (tk(P116)) <= ( 0 ) ) )) & (! ( ( (tk(P74)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P133)) ) )) ) ) ) ) ) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P124)) <= (tk(P96)) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( ( ( 1 ) <= (tk(P158)) ) & ( ( 1 ) <= (tk(P34)) ) ) | ( ( (! ( ( (tk(P7)) <= (tk(P88)) ) & ( (tk(P20)) <= ( 0 ) ) )) | (! ( ( ( 1 ) <= (tk(P15)) ) & ( (tk(P67)) <= (tk(P11)) ) )) ) & ( ( 1 ) <= (tk(P10)) ) ) ) & ( (tk(P119)) <= (tk(P156)) ) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P93)) <= ( 1 ) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-11 (reachable & potential(( ( (! ( ( ( ( 1 ) <= (tk(P64)) ) | (! ( (tk(P138)) <= (tk(P73)) )) ) & ( (! ( ( ( (tk(P55)) <= (tk(P77)) ) & ( (tk(P70)) <= ( 1 ) ) ) | ( ( (tk(P37)) <= ( 1 ) ) & ( (tk(P141)) <= ( 0 ) ) ) )) & ( ( ( ( (tk(P135)) <= ( 1 ) ) | ( (tk(P136)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P137)) ) & ( (tk(P117)) <= ( 1 ) ) ) ) & (! ( (tk(P149)) <= (tk(P58)) )) ) ) )) | (! ( (! ( (tk(P147)) <= (tk(P39)) )) & ( (tk(P104)) <= (tk(P72)) ) )) ) & ( (! ( ( ( ( (tk(P36)) <= ( 1 ) ) & ( ( (tk(P107)) <= ( 1 ) ) & ( (tk(P125)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P102)) ) & ( (tk(P14)) <= ( 1 ) ) ) & ( ( (tk(P4)) <= (tk(P92)) ) & ( ( 1 ) <= (tk(P42)) ) ) ) ) | ( ( ( (tk(P98)) <= (tk(P101)) ) | ( ( (tk(P121)) <= ( 0 ) ) | ( (tk(P145)) <= ( 1 ) ) ) ) & ( ( (tk(P43)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P105)) ) & ( (tk(P140)) <= ( 0 ) ) ) ) ) )) & ( ( (tk(P96)) <= (tk(P46)) ) | (! ( ( ( ( (tk(P121)) <= ( 0 ) ) | ( (tk(P141)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P37)) ) ) | (! ( ( (tk(P65)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P102)) ) )) )) ) ) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-12 (reachable & potential(( ( (tk(P40)) <= ( 0 ) ) & (! ( ( ( ( ( (tk(P78)) <= (tk(P10)) ) & ( (! ( ( ( 1 ) <= (tk(P33)) ) | ( (tk(P153)) <= (tk(P70)) ) )) | ( (tk(P21)) <= (tk(P33)) ) ) ) | ( ( (tk(P35)) <= (tk(P49)) ) & ( (tk(P124)) <= ( 1 ) ) ) ) | ( ( ( ( (! ( (tk(P43)) <= ( 1 ) )) & ( ( (tk(P67)) <= (tk(P42)) ) & ( ( 1 ) <= (tk(P118)) ) ) ) & ( ( ( ( 1 ) <= (tk(P142)) ) & ( (tk(P61)) <= (tk(P108)) ) ) | ( (tk(P148)) <= (tk(P138)) ) ) ) & ( ( ( 1 ) <= (tk(P49)) ) | ( (! ( (tk(P72)) <= ( 0 ) )) | ( ( (tk(P107)) <= ( 0 ) ) | ( (tk(P57)) <= (tk(P107)) ) ) ) ) ) & ( (! ( (tk(P100)) <= ( 0 ) )) & ( (tk(P96)) <= ( 0 ) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P8)) )) & ( ( ( 1 ) <= (tk(P6)) ) & ( ( ( ( 1 ) <= (tk(P58)) ) & ( (! ( (tk(P67)) <= ( 1 ) )) & ( (tk(P92)) <= ( 0 ) ) ) ) | (! ( (tk(P95)) <= (tk(P97)) )) ) ) ) )) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-13 (reachable & potential((! ( (! ( (tk(P57)) <= ( 0 ) )) | ( (! ( (! ( ( ( ( ( 1 ) <= (tk(P116)) ) | ( ( 1 ) <= (tk(P90)) ) ) & (! ( (tk(P52)) <= (tk(P47)) )) ) & ( ( (tk(P21)) <= ( 0 ) ) | ( (tk(P95)) <= ( 0 ) ) ) )) & (! ( ( ( ( (tk(P121)) <= (tk(P45)) ) | ( (tk(P70)) <= (tk(P100)) ) ) | (! ( (tk(P6)) <= ( 1 ) )) ) & (! ( ( ( 1 ) <= (tk(P150)) ) & ( (tk(P53)) <= ( 1 ) ) )) )) )) | ( (tk(P52)) <= (tk(P134)) ) ) ))))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-14 (reachable & potential(( ( ( ( ( ( (! ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P106)) ) ) & ( ( 1 ) <= (tk(P9)) ) )) | ( ( ( ( (tk(P99)) <= (tk(P148)) ) | ( (tk(P103)) <= (tk(P6)) ) ) & ( ( 1 ) <= (tk(P68)) ) ) & ( ( ( ( 1 ) <= (tk(P139)) ) | ( ( 1 ) <= (tk(P89)) ) ) | (! ( ( 1 ) <= (tk(P156)) )) ) ) ) & ( ( ( (tk(P131)) <= (tk(P147)) ) & ( ( ( ( 1 ) <= (tk(P107)) ) | ( (tk(P121)) <= (tk(P102)) ) ) | ( (tk(P124)) <= (tk(P48)) ) ) ) | ( ( (tk(P10)) <= (tk(P43)) ) | (! ( (tk(P48)) <= (tk(P40)) )) ) ) ) & ( (tk(P61)) <= ( 1 ) ) ) | ( (! ( ( 1 ) <= (tk(P97)) )) | ( (! ( (tk(P145)) <= (tk(P39)) )) & (! ( ( ( (tk(P37)) <= (tk(P132)) ) | ( ( (tk(P47)) <= (tk(P32)) ) | ( ( 1 ) <= (tk(P9)) ) ) ) | ( ( (tk(P5)) <= (tk(P140)) ) & (! ( ( 1 ) <= (tk(P85)) )) ) )) ) ) ) & ( ( ( (tk(P69)) <= (tk(P113)) ) & (! ( ( (tk(P95)) <= (tk(P61)) ) & (! ( (tk(P132)) <= (tk(P33)) )) )) ) | ( (! ( (! ( (tk(P119)) <= (tk(P10)) )) & ( ( (tk(P25)) <= (tk(P40)) ) | ( (tk(P87)) <= (tk(P18)) ) ) )) & ( ( 1 ) <= (tk(P21)) ) ) ) ) & ( ( ( (tk(P115)) <= ( 1 ) ) & (! ( (! ( (tk(P53)) <= ( 1 ) )) | ( ( (tk(P109)) <= ( 1 ) ) & ( (tk(P11)) <= ( 0 ) ) ) )) ) & ( (tk(P106)) <= ( 0 ) ) ) )))
PROPERTY: HealthRecord-PT-11-ReachabilityCardinality-15 (reachable & potential(( (! ( ( ( (tk(P31)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P104)) ) ) | ( (tk(P98)) <= (tk(P16)) ) )) & ( ( ( (! ( ( ( 1 ) <= (tk(P115)) ) & ( ( 1 ) <= (tk(P90)) ) )) & ( ( (! ( ( 1 ) <= (tk(P1)) )) | ( ( ( 1 ) <= (tk(P89)) ) & (! ( ( (tk(P83)) <= (tk(P121)) ) & ( ( 1 ) <= (tk(P85)) ) )) ) ) | ( (tk(P74)) <= ( 0 ) ) ) ) & ( (tk(P67)) <= ( 0 ) ) ) & ( ( (tk(P63)) <= ( 0 ) ) & ( ( (tk(P23)) <= ( 0 ) ) | ( ( (tk(P113)) <= ( 0 ) ) & (! ( (tk(P116)) <= ( 1 ) )) ) ) ) ) )))
FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678582560565

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is HealthRecord-PT-11, 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 r203-smll-167840349400318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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