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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K Apr 30 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 11:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 30 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 11:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 30 11:14 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 69K 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-10-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654187000827

Running Version 202205111006
[2022-06-02 16:23:22] [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:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:23:23] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-06-02 16:23:23] [INFO ] Transformed 158 places.
[2022-06-02 16:23:23] [INFO ] Transformed 333 transitions.
[2022-06-02 16:23:23] [INFO ] Found NUPN structural information;
[2022-06-02 16:23:23] [INFO ] Parsed PT model containing 158 places and 333 transitions in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Incomplete random walk after 10000 steps, including 642 resets, run finished after 789 ms. (steps per millisecond=12 ) properties (out of 16) seen :3
FORMULA HealthRecord-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-06-02 16:23:25] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2022-06-02 16:23:25] [INFO ] Computed 18 place invariants in 17 ms
[2022-06-02 16:23:26] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 16:23:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2022-06-02 16:23:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2022-06-02 16:23:27] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2022-06-02 16:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:23:27] [INFO ] After 410ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2022-06-02 16:23:27] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 13 ms to minimize.
[2022-06-02 16:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-06-02 16:23:27] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2022-06-02 16:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-06-02 16:23:28] [INFO ] After 1875ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 420 ms.
[2022-06-02 16:23:29] [INFO ] After 3281ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
FORMULA HealthRecord-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
FORMULA HealthRecord-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1215 ms.
Support contains 108 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (complete) has 674 edges and 158 vertex of which 154 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 154 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 26 place count 138 transition count 261
Iterating global reduction 1 with 16 rules applied. Total rules applied 42 place count 138 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 137 transition count 260
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 137 transition count 259
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 137 transition count 259
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 137 transition count 259
Applied a total of 48 rules in 79 ms. Remains 137 /158 variables (removed 21) and now considering 259/306 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/158 places, 259/306 transitions.
Incomplete random walk after 1000000 steps, including 63916 resets, run finished after 26726 ms. (steps per millisecond=37 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 706841 steps, including 6337 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen 0
Interrupted Best-First random walk after 876397 steps, including 7801 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 9201 resets, run finished after 4556 ms. (steps per millisecond=219 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9187 resets, run finished after 4198 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9149 resets, run finished after 4504 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 343722 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 326947 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 979705 steps, including 9932 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen 0
Running SMT prover for 8 properties.
// Phase 1: matrix 259 rows 137 cols
[2022-06-02 16:24:35] [INFO ] Computed 14 place invariants in 4 ms
[2022-06-02 16:24:35] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 16:24:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-02 16:24:35] [INFO ] [Nat]Absence check using 6 positive and 8 generalized place invariants in 12 ms returned sat
[2022-06-02 16:24:36] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-02 16:24:36] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-06-02 16:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-06-02 16:24:36] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2022-06-02 16:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2022-06-02 16:24:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 920 ms
[2022-06-02 16:24:38] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2022-06-02 16:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-06-02 16:24:38] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:24:38] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:24:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2022-06-02 16:24:38] [INFO ] After 2368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 439 ms.
[2022-06-02 16:24:38] [INFO ] After 2957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA HealthRecord-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 922 ms.
Support contains 64 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 259/259 transitions.
Graph (trivial) has 60 edges and 137 vertex of which 2 / 137 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 581 edges and 136 vertex of which 131 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 131 transition count 256
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 130 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 130 transition count 254
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 129 transition count 254
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 33 place count 103 transition count 202
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 103 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 102 transition count 209
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 102 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 101 transition count 208
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 101 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 100 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 100 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 99 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 99 transition count 204
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 99 transition count 204
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 99 transition count 203
Applied a total of 71 rules in 101 ms. Remains 99 /137 variables (removed 38) and now considering 203/259 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/137 places, 203/259 transitions.
Incomplete random walk after 1000000 steps, including 80145 resets, run finished after 13165 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 13460 resets, run finished after 4602 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 14929 resets, run finished after 2911 ms. (steps per millisecond=343 ) properties (out of 2) seen :0
Finished probabilistic random walk after 12538771 steps, run visited all 2 properties in 15239 ms. (steps per millisecond=822 )
Probabilistic random walk after 12538771 steps, saw 1362755 distinct states, run finished after 15240 ms. (steps per millisecond=822 ) properties seen :2
FORMULA HealthRecord-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 113017 ms.

BK_STOP 1654187115813

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

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