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-167840349400351.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-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349400351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K 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-15-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678586720170

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-15
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 02:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 02:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 02:05:23] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-12 02:05:23] [INFO ] Transformed 163 places.
[2023-03-12 02:05:24] [INFO ] Transformed 348 transitions.
[2023-03-12 02:05:24] [INFO ] Found NUPN structural information;
[2023-03-12 02:05:24] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Incomplete random walk after 10000 steps, including 920 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA HealthRecord-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 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 119 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :1
FORMULA HealthRecord-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 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 121 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :1
FORMULA HealthRecord-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-12 02:05:25] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2023-03-12 02:05:25] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-12 02:05:26] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 02:05:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-12 02:05:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 24 ms returned sat
[2023-03-12 02:05:27] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 02:05:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 02:05:28] [INFO ] After 683ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-12 02:05:28] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 11 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 628 ms
[2023-03-12 02:05:29] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2023-03-12 02:05:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 455 ms
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 2 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 192 ms
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-12 02:05:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-12 02:05:31] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2023-03-12 02:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-12 02:05:31] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2023-03-12 02:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-12 02:05:31] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2023-03-12 02:05:32] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-12 02:05:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2023-03-12 02:05:32] [INFO ] After 4207ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 598 ms.
[2023-03-12 02:05:32] [INFO ] After 5918ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
FORMULA HealthRecord-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA HealthRecord-PT-15-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 108 ms.
Support contains 75 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 81 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 697 edges and 161 vertex of which 151 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 301
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 3 rules applied. Total rules applied 6 place count 150 transition count 299
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 149 transition count 298
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 148 transition count 297
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 46 place count 112 transition count 225
Iterating global reduction 4 with 36 rules applied. Total rules applied 82 place count 112 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 110 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 110 transition count 227
Applied a total of 87 rules in 64 ms. Remains 110 /163 variables (removed 53) and now considering 227/319 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 110/163 places, 227/319 transitions.
Incomplete random walk after 10000 steps, including 1037 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 192 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 473634 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{7=1}
Probabilistic random walk after 473634 steps, saw 71249 distinct states, run finished after 3009 ms. (steps per millisecond=157 ) properties seen :1
FORMULA HealthRecord-PT-15-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
[2023-03-12 02:05:36] [INFO ] Flow matrix only has 225 transitions (discarded 2 similar events)
// Phase 1: matrix 225 rows 110 cols
[2023-03-12 02:05:36] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 02:05:36] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 02:05:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 02:05:37] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 02:05:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:05:37] [INFO ] After 292ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 02:05:37] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2023-03-12 02:05:37] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2023-03-12 02:05:37] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2023-03-12 02:05:38] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2023-03-12 02:05:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 418 ms
[2023-03-12 02:05:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-12 02:05:38] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-12 02:05:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-12 02:05:38] [INFO ] After 1224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-12 02:05:38] [INFO ] After 2075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA HealthRecord-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 72 ms.
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 227/227 transitions.
Graph (trivial) has 87 edges and 110 vertex of which 2 / 110 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 433 edges and 109 vertex of which 96 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 96 transition count 152
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 108 place count 59 transition count 115
Iterating global reduction 1 with 37 rules applied. Total rules applied 145 place count 59 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 145 place count 59 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 58 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 55 transition count 111
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 55 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 159 place count 52 transition count 108
Applied a total of 159 rules in 27 ms. Remains 52 /110 variables (removed 58) and now considering 108/227 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 52/110 places, 108/227 transitions.
Incomplete random walk after 10000 steps, including 965 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :1
FORMULA HealthRecord-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-12 02:05:39] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
// Phase 1: matrix 100 rows 52 cols
[2023-03-12 02:05:39] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 02:05:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 02:05:39] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 02:05:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 02:05:39] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 02:05:39] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 02:05:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 02:05:39] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 02:05:39] [INFO ] After 32ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 02:05:39] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-12 02:05:39] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 108/108 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 52 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 51 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 46 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 46 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 46 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 46 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 45 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 44 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 44 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 43 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 43 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 36 place count 43 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 42 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 42 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 40 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 39 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 39 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 38 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 38 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 37 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 37 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 37 transition count 68
Applied a total of 51 rules in 33 ms. Remains 37 /52 variables (removed 15) and now considering 68/108 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 37/52 places, 68/108 transitions.
Incomplete random walk after 10000 steps, including 782 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA HealthRecord-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-12 02:05:40] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
// Phase 1: matrix 58 rows 37 cols
[2023-03-12 02:05:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 02:05:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 02:05:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 02:05:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 02:05:40] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 02:05:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 02:05:40] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 02:05:40] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 02:05:40] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 68/68 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 37 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 36 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 31 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 31 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 31 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 30 transition count 55
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 26 transition count 50
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 26 transition count 50
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 25 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 25 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 25 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 23 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 22 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 22 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 21 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 21 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 20 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 20 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 20 transition count 31
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 20 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 20 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 19 transition count 29
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 2 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 58 place count 16 transition count 29
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 64 place count 16 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 64 place count 16 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 15 transition count 22
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 6 with 2 rules applied. Total rules applied 68 place count 14 transition count 21
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 72 place count 14 transition count 17
Graph (complete) has 25 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 73 place count 13 transition count 17
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 74 place count 13 transition count 16
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 8 with 2 rules applied. Total rules applied 76 place count 12 transition count 15
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 79 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 80 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 82 place count 11 transition count 10
Applied a total of 82 rules in 32 ms. Remains 11 /37 variables (removed 26) and now considering 10/68 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 11/37 places, 10/68 transitions.
Finished random walk after 195 steps, including 17 resets, run visited all 1 properties in 1 ms. (steps per millisecond=195 )
FORMULA HealthRecord-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16594 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HealthRecord (PT), instance 15
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: 163 places, 348 transitions, 919 arcs.
Final Score: 3055.882
Took : 16 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA HealthRecord-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-15-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678586811417

--------------------
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-15"
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-15, 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-167840349400351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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