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

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

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-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:55:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:55:32] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-12 16:55:32] [INFO ] Transformed 159 places.
[2023-03-12 16:55:32] [INFO ] Transformed 334 transitions.
[2023-03-12 16:55:32] [INFO ] Found NUPN structural information;
[2023-03-12 16:55:32] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 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 666 resets, run finished after 1232 ms. (steps per millisecond=8 ) 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 102 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 16:55:35] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-12 16:55:35] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-12 16:55:36] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 16:55:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-12 16:55:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-12 16:55:36] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 16:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:55:37] [INFO ] After 589ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 16:55:37] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 11 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 501 ms
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-12 16:55:38] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-12 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1080 ms
[2023-03-12 16:55:39] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2023-03-12 16:55:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 605 ms
[2023-03-12 16:55:40] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2023-03-12 16:55:41] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-03-12 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-03-12 16:55:41] [INFO ] After 4098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 386 ms.
[2023-03-12 16:55:41] [INFO ] After 5406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 98 ms.
Support contains 105 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 21 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 10 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 153 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 22 place count 133 transition count 252
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 133 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 132 transition count 252
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 132 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 45 place count 132 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 131 transition count 250
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 131 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 49 place count 131 transition count 249
Applied a total of 49 rules in 92 ms. Remains 131 /159 variables (removed 28) and now considering 249/307 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 131/159 places, 249/307 transitions.
Incomplete random walk after 10000 steps, including 686 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 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 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 596337 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 596337 steps, saw 85038 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) 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 9 properties.
// Phase 1: matrix 249 rows 131 cols
[2023-03-12 16:55:46] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-12 16:55:46] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-12 16:55:46] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-12 16:55:46] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 16:55:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 16:55:46] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-12 16:55:46] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 16:55:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:55:46] [INFO ] After 219ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2023-03-12 16:55:47] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 815 ms
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 609 ms
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:55:48] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-12 16:55:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-12 16:55:49] [INFO ] After 2351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-12 16:55:49] [INFO ] After 3107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 75 ms.
Support contains 81 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 249/249 transitions.
Graph (trivial) has 32 edges and 131 vertex of which 2 / 131 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 542 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 115 transition count 220
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 115 transition count 220
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 115 transition count 218
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 115 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 115 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 50 place count 114 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 114 transition count 216
Applied a total of 51 rules in 51 ms. Remains 114 /131 variables (removed 17) and now considering 216/249 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 114/131 places, 216/249 transitions.
Incomplete random walk after 10000 steps, including 532 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 695219 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695219 steps, saw 99592 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 216 rows 114 cols
[2023-03-12 16:55:53] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:55:53] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 16:55:53] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 16:55:53] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:55:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 16:55:53] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:55:53] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:55:54] [INFO ] After 228ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-12 16:55:54] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-12 16:55:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 616 ms
[2023-03-12 16:55:55] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2023-03-12 16:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-12 16:55:55] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-12 16:55:55] [INFO ] After 1986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 30 ms.
Support contains 64 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 216/216 transitions.
Graph (trivial) has 18 edges and 114 vertex of which 2 / 114 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 508 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 103 transition count 196
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 103 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 22 place count 102 transition count 195
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 102 transition count 195
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 100 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 100 transition count 191
Applied a total of 31 rules in 43 ms. Remains 100 /114 variables (removed 14) and now considering 191/216 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 100/114 places, 191/216 transitions.
Incomplete random walk after 10000 steps, including 636 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 687883 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687883 steps, saw 98790 distinct states, run finished after 3002 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 191 rows 100 cols
[2023-03-12 16:55:59] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:55:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 16:55:59] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 16:55:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:55:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 16:55:59] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:55:59] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:55:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:55:59] [INFO ] After 114ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:55:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-12 16:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-12 16:55:59] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 16:55:59] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 17 ms.
Support contains 64 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-12 16:55:59] [INFO ] Invariant cache hit.
[2023-03-12 16:56:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 16:56:00] [INFO ] Invariant cache hit.
[2023-03-12 16:56:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:56:00] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-12 16:56:00] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-12 16:56:00] [INFO ] Invariant cache hit.
[2023-03-12 16:56:00] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 100/100 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-12 16:56:00] [INFO ] Invariant cache hit.
[2023-03-12 16:56:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 16:56:00] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 16:56:00] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:56:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 16:56:00] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 16:56:00] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:56:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-12 16:56:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2023-03-12 16:56:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-12 16:56:00] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 11 ms to minimize.
[2023-03-12 16:56:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2023-03-12 16:56:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-12 16:56:01] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-12 16:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-12 16:56:01] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 16:56:01] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:56:01] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 16:56:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 191 transitions and 773 arcs took 2 ms.
[2023-03-12 16:56:01] [INFO ] Flatten gal took : 74 ms
Total runtime 28918 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/676/inv_0_ --invariant=/tmp/676/inv_1_ --invariant=/tmp/676/inv_2_ --invariant=/tmp/676/inv_3_ --invariant=/tmp/676/inv_4_ --inv-par
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640169476

--------------------
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-11-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_0_
rfs formula name HealthRecord-PT-11-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_1_
rfs formula name HealthRecord-PT-11-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_2_
rfs formula name HealthRecord-PT-11-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_3_
rfs formula name HealthRecord-PT-11-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/676/inv_4_
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, 191 transitions and 773 arcs
pnml2lts-sym: Petri net HealthRecord_PT_11 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: 191->151 groups
pnml2lts-sym: Regrouping took 0.040 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 100; there are 151 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/676/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/676/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/676/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/676/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/676/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 6.630 real 26.460 user 0.010 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-11"
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-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 r201-smll-167840347600318"
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 ;