Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477300143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.6K Apr 30 11:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 30 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 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-09-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654186947893

Running Version 202205111006
[2022-06-02 16:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:22:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:22:30] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-06-02 16:22:30] [INFO ] Transformed 157 places.
[2022-06-02 16:22:30] [INFO ] Transformed 327 transitions.
[2022-06-02 16:22:30] [INFO ] Found NUPN structural information;
[2022-06-02 16:22:30] [INFO ] Parsed PT model containing 157 places and 327 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Incomplete random walk after 10000 steps, including 576 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA HealthRecord-PT-09-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 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 81 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-06-02 16:22:32] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2022-06-02 16:22:32] [INFO ] Computed 18 place invariants in 19 ms
[2022-06-02 16:22:33] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 16:22:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 63 ms returned sat
[2022-06-02 16:22:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 44 ms returned sat
[2022-06-02 16:22:34] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-06-02 16:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:22:34] [INFO ] After 558ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 10 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 604 ms
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-06-02 16:22:35] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2022-06-02 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 455 ms
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2022-06-02 16:22:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2022-06-02 16:22:37] [INFO ] After 2739ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 367 ms.
[2022-06-02 16:22:37] [INFO ] After 4293ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA HealthRecord-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
FORMULA HealthRecord-PT-09-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1860 ms.
Support contains 63 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 87 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 659 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 147 transition count 279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 144 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 144 transition count 274
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 141 transition count 274
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 57 place count 100 transition count 192
Iterating global reduction 2 with 41 rules applied. Total rules applied 98 place count 100 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 98 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 98 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 98 transition count 186
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 3 with 4 rules applied. Total rules applied 108 place count 96 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 96 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 96 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 95 transition count 182
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 124 place count 95 transition count 182
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 95 transition count 182
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 95 transition count 181
Applied a total of 126 rules in 99 ms. Remains 95 /157 variables (removed 62) and now considering 181/301 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/157 places, 181/301 transitions.
Interrupted random walk after 983283 steps, including 70951 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 1
FORMULA HealthRecord-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 653338 steps, including 9404 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 0
Interrupted Best-First random walk after 715381 steps, including 10305 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Interrupted Best-First random walk after 695609 steps, including 10070 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 724412 steps, including 10476 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted Best-First random walk after 738155 steps, including 10634 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 560437 steps, including 8053 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 784760 steps, including 10614 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen 0
Interrupted Best-First random walk after 789705 steps, including 11455 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Interrupted Best-First random walk after 768882 steps, including 11121 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Running SMT prover for 9 properties.
// Phase 1: matrix 181 rows 95 cols
[2022-06-02 16:23:54] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-02 16:23:54] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 16:23:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-02 16:23:54] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 7 ms returned sat
[2022-06-02 16:23:54] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-02 16:23:54] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2022-06-02 16:23:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-02 16:23:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-06-02 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-06-02 16:23:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-06-02 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-02 16:23:55] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-06-02 16:23:55] [INFO ] After 902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA HealthRecord-PT-09-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 849 ms.
Support contains 18 out of 95 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 95/95 places, 181/181 transitions.
Graph (trivial) has 57 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 441 edges and 93 vertex of which 90 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 175
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 88 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 88 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 86 transition count 172
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 37 place count 60 transition count 121
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 60 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 58 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 58 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 56 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 56 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 54 transition count 128
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 97 place count 54 transition count 128
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 54 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 51 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 49 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 49 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 49 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 47 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 47 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 47 transition count 105
Applied a total of 124 rules in 58 ms. Remains 47 /95 variables (removed 48) and now considering 105/181 (removed 76) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/95 places, 105/181 transitions.
Incomplete random walk after 1000000 steps, including 159718 resets, run finished after 12176 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 39554 resets, run finished after 3321 ms. (steps per millisecond=301 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 39274 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 2) seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2022-06-02 16:24:12] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
// Phase 1: matrix 102 rows 47 cols
[2022-06-02 16:24:12] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-02 16:24:12] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:24:12] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2022-06-02 16:24:12] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:24:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-02 16:24:12] [INFO ] After 22ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:24:12] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-06-02 16:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-06-02 16:24:12] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-02 16:24:12] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 15 out of 47 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 47/47 places, 105/105 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 102
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 46 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 45 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 45 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 44 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 44 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 44 transition count 94
Applied a total of 12 rules in 15 ms. Remains 44 /47 variables (removed 3) and now considering 94/105 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 44/47 places, 94/105 transitions.
Incomplete random walk after 1000000 steps, including 159558 resets, run finished after 1712 ms. (steps per millisecond=584 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 39841 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5126 steps, run visited all 1 properties in 21 ms. (steps per millisecond=244 )
Probabilistic random walk after 5126 steps, saw 1387 distinct states, run finished after 21 ms. (steps per millisecond=244 ) properties seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 105790 ms.

BK_STOP 1654187055858

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-09"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-09, 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 r114-smll-165264477300143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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