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-165264477300147.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-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 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-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652694427189

Running Version 202205111006
[2022-05-16 09:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-16 09:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:47:09] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-16 09:47:09] [INFO ] Transformed 158 places.
[2022-05-16 09:47:09] [INFO ] Transformed 333 transitions.
[2022-05-16 09:47:09] [INFO ] Found NUPN structural information;
[2022-05-16 09:47:09] [INFO ] Parsed PT model containing 158 places and 333 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 76 transition count 149
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 76 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 169 place count 71 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 174 place count 71 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 177 place count 71 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 178 place count 70 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 179 place count 70 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 69 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 69 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 184 place count 69 transition count 128
Applied a total of 184 rules in 44 ms. Remains 69 /158 variables (removed 89) and now considering 128/306 (removed 178) transitions.
[2022-05-16 09:47:09] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 69 cols
[2022-05-16 09:47:09] [INFO ] Computed 11 place invariants in 18 ms
[2022-05-16 09:47:10] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-05-16 09:47:10] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 69 cols
[2022-05-16 09:47:10] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-16 09:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:10] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2022-05-16 09:47:10] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 69 cols
[2022-05-16 09:47:10] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 09:47:10] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/158 places, 128/306 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/158 places, 128/306 transitions.
Support contains 19 out of 69 places after structural reductions.
[2022-05-16 09:47:10] [INFO ] Flatten gal took : 59 ms
[2022-05-16 09:47:10] [INFO ] Flatten gal took : 25 ms
[2022-05-16 09:47:10] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 616 resets, run finished after 698 ms. (steps per millisecond=14 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-16 09:47:11] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 69 cols
[2022-05-16 09:47:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 09:47:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 09:47:12] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:47:12] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:47:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 09:47:12] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:47:12] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-16 09:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:12] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-05-16 09:47:12] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 6 ms to minimize.
[2022-05-16 09:47:12] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2022-05-16 09:47:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2022-05-16 09:47:12] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-16 09:47:12] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 128/128 transitions.
Graph (trivial) has 66 edges and 69 vertex of which 10 / 69 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 267 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 2 place count 63 transition count 110
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 0 with 5 rules applied. Total rules applied 7 place count 60 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 16 place count 51 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 25 place count 51 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 29 place count 51 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 49 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 49 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 49 transition count 82
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 2 with 4 rules applied. Total rules applied 40 place count 47 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 42 transition count 118
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 42 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 42 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 41 transition count 116
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 41 transition count 116
Applied a total of 67 rules in 60 ms. Remains 41 /69 variables (removed 28) and now considering 116/128 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/69 places, 116/128 transitions.
Incomplete random walk after 10000 steps, including 887 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 09:47:13] [INFO ] Flow matrix only has 106 transitions (discarded 10 similar events)
// Phase 1: matrix 106 rows 41 cols
[2022-05-16 09:47:13] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-16 09:47:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 09:47:13] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 15 ms returned sat
[2022-05-16 09:47:13] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-16 09:47:13] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-16 09:47:13] [INFO ] After 17ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:47:13] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:47:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-16 09:47:13] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:47:13] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 09:47:13] [INFO ] After 38ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-16 09:47:13] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-16 09:47:13] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41/41 places, 116/116 transitions.
Graph (complete) has 196 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 39 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 39 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 115
Applied a total of 5 rules in 22 ms. Remains 38 /41 variables (removed 3) and now considering 115/116 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/41 places, 115/116 transitions.
Incomplete random walk after 10000 steps, including 887 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 172 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Finished probabilistic random walk after 2108 steps, run visited all 4 properties in 61 ms. (steps per millisecond=34 )
Probabilistic random walk after 2108 steps, saw 655 distinct states, run finished after 61 ms. (steps per millisecond=34 ) properties seen :4
FORMULA HealthRecord-PT-10-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA HealthRecord-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 9 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&X(X(X(p1))))))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 57 transition count 105
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 54 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 53 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 53 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 53 transition count 87
Applied a total of 41 rules in 11 ms. Remains 53 /69 variables (removed 16) and now considering 87/128 (removed 41) transitions.
[2022-05-16 09:47:14] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 53 cols
[2022-05-16 09:47:14] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:47:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-16 09:47:14] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 53 cols
[2022-05-16 09:47:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:47:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 09:47:14] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 53 cols
[2022-05-16 09:47:14] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 09:47:15] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/69 places, 87/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/69 places, 87/128 transitions.
Stuttering acceptance computed with spot in 555 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s28 1)), p1:(AND (EQ s28 0) (EQ s40 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-01 finished in 946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(F(p0))||(F(p0)&&(!p0||G(!p1)))))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 128/128 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 58 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 58 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 58 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 54 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 54 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 52 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 52 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 51 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 51 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 51 transition count 80
Applied a total of 48 rules in 9 ms. Remains 51 /69 variables (removed 18) and now considering 80/128 (removed 48) transitions.
[2022-05-16 09:47:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2022-05-16 09:47:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:47:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 09:47:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2022-05-16 09:47:15] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:47:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:15] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-05-16 09:47:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2022-05-16 09:47:15] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:47:15] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/69 places, 80/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/69 places, 80/128 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s28 1), p1:(OR (EQ s48 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-04 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 128/128 transitions.
Graph (trivial) has 76 edges and 69 vertex of which 10 / 69 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 50 transition count 97
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 50 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 47 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 45 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 45 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 45 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 44 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 44 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 39 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 39 transition count 105
Applied a total of 62 rules in 34 ms. Remains 39 /69 variables (removed 30) and now considering 105/128 (removed 23) transitions.
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
// Phase 1: matrix 88 rows 39 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
// Phase 1: matrix 88 rows 39 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-16 09:47:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:47:16] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-05-16 09:47:16] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
// Phase 1: matrix 88 rows 39 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:16] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/69 places, 105/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/69 places, 105/128 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-06 finished in 438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 128/128 transitions.
Graph (trivial) has 75 edges and 69 vertex of which 10 / 69 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 49 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 49 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 49 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 46 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 46 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 44 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 44 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 44 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 43 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 43 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 43 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 52 place count 41 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 41 transition count 92
Applied a total of 53 rules in 43 ms. Remains 41 /69 variables (removed 28) and now considering 92/128 (removed 36) transitions.
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
// Phase 1: matrix 81 rows 41 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
// Phase 1: matrix 81 rows 41 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-16 09:47:16] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-05-16 09:47:16] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-16 09:47:16] [INFO ] Flow matrix only has 81 transitions (discarded 11 similar events)
// Phase 1: matrix 81 rows 41 cols
[2022-05-16 09:47:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:16] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/69 places, 92/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/69 places, 92/128 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s28 1)), p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-11 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 128/128 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 59 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 59 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 59 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 57 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 57 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 57 transition count 99
Applied a total of 30 rules in 7 ms. Remains 57 /69 variables (removed 12) and now considering 99/128 (removed 29) transitions.
[2022-05-16 09:47:17] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 57 cols
[2022-05-16 09:47:17] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:47:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 09:47:17] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 57 cols
[2022-05-16 09:47:17] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:47:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-05-16 09:47:17] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 57 cols
[2022-05-16 09:47:17] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:47:17] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/69 places, 99/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/69 places, 99/128 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s39 0) (EQ s30 1)), p0:(AND (EQ s26 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-12 finished in 423 ms.
All properties solved by simple procedures.
Total runtime 8352 ms.

BK_STOP 1652694437552

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-165264477300147"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;