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

About the Execution of Smart+red for HealthRecord-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
472.855 51532.00 71717.00 648.40 FTFTTFTFFFFTFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r203-smll-167840349400327.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-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349400327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 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.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 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 71K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678582998645

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 01:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 01:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 01:03:21] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-12 01:03:21] [INFO ] Transformed 160 places.
[2023-03-12 01:03:21] [INFO ] Transformed 340 transitions.
[2023-03-12 01:03:21] [INFO ] Found NUPN structural information;
[2023-03-12 01:03:22] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA HealthRecord-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :1
FORMULA HealthRecord-PT-12-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :2
FORMULA HealthRecord-PT-12-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 01:03:23] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2023-03-12 01:03:23] [INFO ] Computed 18 place invariants in 24 ms
[2023-03-12 01:03:24] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 01:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2023-03-12 01:03:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-12 01:03:25] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-12 01:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 01:03:25] [INFO ] After 248ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-03-12 01:03:25] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 10 ms to minimize.
[2023-03-12 01:03:26] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2023-03-12 01:03:26] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2023-03-12 01:03:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2023-03-12 01:03:26] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2023-03-12 01:03:26] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-12 01:03:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-12 01:03:26] [INFO ] After 1227ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-12 01:03:26] [INFO ] After 2339ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA HealthRecord-PT-12-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 54 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 99 edges and 160 vertex of which 6 / 160 are part of one of the 3 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 680 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 148 transition count 292
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 147 transition count 289
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 145 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 145 transition count 286
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 144 transition count 286
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 62 place count 95 transition count 188
Iterating global reduction 3 with 49 rules applied. Total rules applied 111 place count 95 transition count 188
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 91 transition count 180
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 91 transition count 180
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 3 with 2 rules applied. Total rules applied 121 place count 90 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 89 transition count 180
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 89 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 89 transition count 179
Applied a total of 125 rules in 104 ms. Remains 89 /160 variables (removed 71) and now considering 179/312 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 89/160 places, 179/312 transitions.
Incomplete random walk after 10000 steps, including 1023 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 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 156 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 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 138 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
FORMULA HealthRecord-PT-12-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 179 rows 89 cols
[2023-03-12 01:03:27] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-12 01:03:27] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 01:03:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 01:03:28] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 01:03:28] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 01:03:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 01:03:28] [INFO ] After 123ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2023-03-12 01:03:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-12 01:03:29] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2023-03-12 01:03:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-12 01:03:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-12 01:03:29] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-12 01:03:29] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA HealthRecord-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 35 ms.
Support contains 48 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 179/179 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 171
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 10 place count 84 transition count 170
Applied a total of 10 rules in 17 ms. Remains 84 /89 variables (removed 5) and now considering 170/179 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 84/89 places, 170/179 transitions.
Incomplete random walk after 10000 steps, including 1026 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 968611 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{0=1, 3=1}
Probabilistic random walk after 968611 steps, saw 130488 distinct states, run finished after 3002 ms. (steps per millisecond=322 ) properties seen :2
FORMULA HealthRecord-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 170 rows 84 cols
[2023-03-12 01:03:32] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 01:03:32] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 01:03:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 01:03:32] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 01:03:32] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 01:03:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 01:03:33] [INFO ] After 66ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 01:03:33] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2023-03-12 01:03:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-12 01:03:33] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-12 01:03:33] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 28 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 170/170 transitions.
Graph (complete) has 344 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 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 2 place count 83 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 82 transition count 169
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 70 transition count 145
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 70 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 70 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 69 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 69 transition count 138
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 3 with 2 rules applied. Total rules applied 36 place count 68 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 67 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 67 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 66 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 66 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 65 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 65 transition count 136
Applied a total of 43 rules in 34 ms. Remains 65 /84 variables (removed 19) and now considering 136/170 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 65/84 places, 136/170 transitions.
Incomplete random walk after 10000 steps, including 1158 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 73620 steps, run visited all 3 properties in 223 ms. (steps per millisecond=330 )
Probabilistic random walk after 73620 steps, saw 12337 distinct states, run finished after 224 ms. (steps per millisecond=328 ) properties seen :3
FORMULA HealthRecord-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12126 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HealthRecord (PT), instance 12
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 160 places, 340 transitions, 895 arcs.
Final Score: 2733.28
Took : 16 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA HealthRecord-PT-12-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678583050177

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-12"
export BK_EXAMINATION="ReachabilityFireability"
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-12, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r203-smll-167840349400327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;