Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625700487.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HealthRecord-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625700487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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-11-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716557800981

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 13:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:36:42] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-24 13:36:42] [INFO ] Transformed 159 places.
[2024-05-24 13:36:42] [INFO ] Transformed 334 transitions.
[2024-05-24 13:36:42] [INFO ] Found NUPN structural information;
[2024-05-24 13:36:42] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 76 transition count 148
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 76 transition count 148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 171 place count 71 transition count 138
Iterating global reduction 0 with 5 rules applied. Total rules applied 176 place count 71 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 179 place count 71 transition count 135
Applied a total of 179 rules in 29 ms. Remains 71 /159 variables (removed 88) and now considering 135/307 (removed 172) transitions.
[2024-05-24 13:36:43] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 71 cols
[2024-05-24 13:36:43] [INFO ] Computed 11 invariants in 10 ms
[2024-05-24 13:36:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-24 13:36:43] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-05-24 13:36:43] [INFO ] Invariant cache hit.
[2024-05-24 13:36:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-24 13:36:43] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-05-24 13:36:43] [INFO ] Invariant cache hit.
[2024-05-24 13:36:43] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/159 places, 135/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 71/159 places, 135/307 transitions.
Support contains 19 out of 71 places after structural reductions.
[2024-05-24 13:36:43] [INFO ] Flatten gal took : 37 ms
[2024-05-24 13:36:43] [INFO ] Flatten gal took : 15 ms
[2024-05-24 13:36:43] [INFO ] Input system was already deterministic with 135 transitions.
Incomplete random walk after 10000 steps, including 665 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 13:36:44] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-05-24 13:36:44] [INFO ] Invariant cache hit.
[2024-05-24 13:36:44] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 13:36:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 13:36:44] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:36:44] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 13:36:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:44] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-24 13:36:44] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-24 13:36:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 13:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-05-24 13:36:44] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-24 13:36:44] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 18 ms.
Support contains 11 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 135/135 transitions.
Graph (trivial) has 59 edges and 71 vertex of which 8 / 71 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 290 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 66 transition count 119
Deduced a syphon composed of 2 places in 0 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 63 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 60 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 60 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 58 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 58 transition count 106
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 1 with 4 rules applied. Total rules applied 24 place count 56 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 51 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 51 transition count 132
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 51 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 50 transition count 131
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 50 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 50 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 49 transition count 129
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 55 place count 49 transition count 129
Applied a total of 55 rules in 67 ms. Remains 49 /71 variables (removed 22) and now considering 129/135 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 49/71 places, 129/135 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:36:45] [INFO ] Flow matrix only has 123 transitions (discarded 6 similar events)
// Phase 1: matrix 123 rows 49 cols
[2024-05-24 13:36:45] [INFO ] Computed 9 invariants in 7 ms
[2024-05-24 13:36:45] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:36:45] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 13:36:45] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:36:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 13:36:45] [INFO ] After 13ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:36:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-24 13:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 13:36:45] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 13:36:45] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 129/129 transitions.
Graph (trivial) has 20 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 251 edges and 48 vertex of which 37 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 37 transition count 102
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 33 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 33 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 33 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 33 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 32 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 31 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 31 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 30 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 30 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 30 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 27 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 26 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 61 place count 26 transition count 72
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 71 place count 26 transition count 72
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 76 place count 26 transition count 67
Applied a total of 76 rules in 15 ms. Remains 26 /49 variables (removed 23) and now considering 67/129 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 26/49 places, 67/129 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:36:45] [INFO ] Flow matrix only has 55 transitions (discarded 12 similar events)
// Phase 1: matrix 55 rows 26 cols
[2024-05-24 13:36:45] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 13:36:45] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:36:45] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:36:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 13:36:45] [INFO ] After 6ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:36:45] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 13:36:45] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 67/67 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 25 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 24 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 24 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 23 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 23 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 23 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 22 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 22 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 22 transition count 56
Applied a total of 13 rules in 7 ms. Remains 22 /26 variables (removed 4) and now considering 56/67 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 22/26 places, 56/67 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 248 steps, run visited all 1 properties in 10 ms. (steps per millisecond=24 )
Probabilistic random walk after 248 steps, saw 129 distinct states, run finished after 10 ms. (steps per millisecond=24 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(p2))))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Graph (trivial) has 67 edges and 71 vertex of which 8 / 71 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 58 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 58 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 58 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 54 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 54 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 54 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 53 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 53 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 53 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 51 transition count 117
Applied a total of 40 rules in 14 ms. Remains 51 /71 variables (removed 20) and now considering 117/135 (removed 18) transitions.
[2024-05-24 13:36:46] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
// Phase 1: matrix 106 rows 51 cols
[2024-05-24 13:36:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:36:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:36:46] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-24 13:36:46] [INFO ] Invariant cache hit.
[2024-05-24 13:36:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 13:36:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 13:36:46] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 13:36:46] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-24 13:36:46] [INFO ] Invariant cache hit.
[2024-05-24 13:36:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/71 places, 117/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 51/71 places, 117/135 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s29 0) (EQ s8 1)) (OR (EQ s46 0) (EQ s35 1))), p2:(OR (EQ s11 0) (EQ s2 1)), p1:(AND (EQ s8 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 17 reset in 159 ms.
Product exploration explored 100000 steps with 4 reset in 97 ms.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1032 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 53533 steps, run visited all 2 properties in 69 ms. (steps per millisecond=775 )
Probabilistic random walk after 53533 steps, saw 9053 distinct states, run finished after 69 ms. (steps per millisecond=775 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 117/117 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-24 13:36:47] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-24 13:36:47] [INFO ] Invariant cache hit.
[2024-05-24 13:36:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:36:47] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-24 13:36:47] [INFO ] Invariant cache hit.
[2024-05-24 13:36:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 13:36:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 13:36:47] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 13:36:47] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-24 13:36:47] [INFO ] Invariant cache hit.
[2024-05-24 13:36:47] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 51/51 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1034 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Finished probabilistic random walk after 53533 steps, run visited all 2 properties in 75 ms. (steps per millisecond=713 )
Probabilistic random walk after 53533 steps, saw 9053 distinct states, run finished after 75 ms. (steps per millisecond=713 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 112 ms.
Product exploration explored 100000 steps with 3 reset in 83 ms.
Built C files in :
/tmp/ltsmin5972678929095547201
[2024-05-24 13:36:48] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-24 13:36:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:48] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-24 13:36:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:48] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-24 13:36:48] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5972678929095547201
Running compilation step : cd /tmp/ltsmin5972678929095547201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 318 ms.
Running link step : cd /tmp/ltsmin5972678929095547201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5972678929095547201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4187544904865121051.hoa' '--buchi-type=spotba'
LTSmin run took 339 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-00 finished in 3218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G((!p0||G(p1))) U G(p2)))))))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 61 transition count 116
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 61 transition count 116
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 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 57 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 55 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 53 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 53 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 53 transition count 86
Applied a total of 48 rules in 12 ms. Remains 53 /71 variables (removed 18) and now considering 86/135 (removed 49) transitions.
[2024-05-24 13:36:49] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 53 cols
[2024-05-24 13:36:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 13:36:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 13:36:49] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-24 13:36:49] [INFO ] Invariant cache hit.
[2024-05-24 13:36:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:49] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-24 13:36:49] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-24 13:36:49] [INFO ] Invariant cache hit.
[2024-05-24 13:36:49] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 86/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 53/71 places, 86/135 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND p2 (NOT p1) p0), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p1) (AND (NOT p0) p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s30 1), p0:(OR (EQ s12 0) (EQ s21 1)), p1:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 76 ms.
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-03 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 60 transition count 115
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 60 transition count 115
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 60 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 56 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 56 transition count 103
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 56 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 54 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 54 transition count 95
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 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 53 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 53 transition count 90
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 53 transition count 87
Applied a total of 48 rules in 7 ms. Remains 53 /71 variables (removed 18) and now considering 87/135 (removed 48) transitions.
[2024-05-24 13:36:49] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 53 cols
[2024-05-24 13:36:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:36:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:36:49] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:36:49] [INFO ] Invariant cache hit.
[2024-05-24 13:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:36:50] [INFO ] Invariant cache hit.
[2024-05-24 13:36:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 87/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 53/71 places, 87/135 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s34 0), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Entered a terminal (fully accepting) state of product in 78 steps with 5 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-06 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((p1&&X(p2))))&&p0)))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 62 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 62 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 59 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 59 transition count 112
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 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 57 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 57 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 56 transition count 96
Applied a total of 39 rules in 9 ms. Remains 56 /71 variables (removed 15) and now considering 96/135 (removed 39) transitions.
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 56 cols
[2024-05-24 13:36:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:36:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 13:36:50] [INFO ] Invariant cache hit.
[2024-05-24 13:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 13:36:50] [INFO ] Invariant cache hit.
[2024-05-24 13:36:50] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/71 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 56/71 places, 96/135 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 6}, { cond=p0, acceptance={0} source=4 dest: 7}], [{ cond=p0, acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=5, aps=[p0:(AND (NEQ s8 0) (NEQ s30 1)), p2:(OR (EQ s8 0) (EQ s30 1)), p1:(OR (EQ s31 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-11 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Graph (trivial) has 68 edges and 71 vertex of which 10 / 71 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 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 52 transition count 105
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 52 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 31 place count 52 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 47 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 47 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 47 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 44 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 44 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 44 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 42 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 42 transition count 72
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 42 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 40 transition count 80
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 40 transition count 79
Applied a total of 68 rules in 17 ms. Remains 40 /71 variables (removed 31) and now considering 79/135 (removed 56) transitions.
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 40 cols
[2024-05-24 13:36:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:36:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-24 13:36:50] [INFO ] Invariant cache hit.
[2024-05-24 13:36:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:36:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-24 13:36:50] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 13:36:50] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-24 13:36:50] [INFO ] Invariant cache hit.
[2024-05-24 13:36:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/71 places, 79/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 40/71 places, 79/135 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-12 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 s6 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 115 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 79/79 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-05-24 13:36:51] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-24 13:36:51] [INFO ] Invariant cache hit.
[2024-05-24 13:36:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:36:51] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-24 13:36:51] [INFO ] Invariant cache hit.
[2024-05-24 13:36:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:36:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 13:36:51] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 13:36:51] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-24 13:36:51] [INFO ] Invariant cache hit.
[2024-05-24 13:36:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 40/40 places, 79/79 transitions.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 249 steps, including 26 resets, run visited all 1 properties in 3 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 50 ms.
Product exploration explored 100000 steps with 27 reset in 93 ms.
Built C files in :
/tmp/ltsmin15643568310621322783
[2024-05-24 13:36:52] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-05-24 13:36:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:52] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-05-24 13:36:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:52] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-05-24 13:36:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:36:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15643568310621322783
Running compilation step : cd /tmp/ltsmin15643568310621322783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin15643568310621322783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15643568310621322783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15291464423589509539.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-12 finished in 1732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&F(p1)) U (G((G(!p0)||(!p0&&F(p1))))||(p2&&(G(!p0)||(!p0&&F(p1)))&&X(!p1))))))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 62 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 62 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 62 transition count 115
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 58 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 58 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 55 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 53 transition count 85
Applied a total of 48 rules in 9 ms. Remains 53 /71 variables (removed 18) and now considering 85/135 (removed 50) transitions.
[2024-05-24 13:36:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2024-05-24 13:36:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 13:36:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:36:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:52] [INFO ] Invariant cache hit.
[2024-05-24 13:36:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 13:36:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:52] [INFO ] Invariant cache hit.
[2024-05-24 13:36:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 85/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 53/71 places, 85/135 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s17 1) (OR (EQ s42 0) (EQ s25 1))), p2:(OR (EQ s42 0) (EQ s25 1)), p1:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 1 reset in 75 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 153 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 671 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 13:36:53] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:53] [INFO ] Invariant cache hit.
[2024-05-24 13:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:36:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:36:53] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-24 13:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:36:53] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:36:53] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2024-05-24 13:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:53] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2024-05-24 13:36:53] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 13:36:53] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 85/85 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 183 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 47 transition count 68
Deduced a syphon composed of 2 places in 0 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 44 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 43 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 43 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 43 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 41 transition count 64
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 35 transition count 100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 35 transition count 99
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 35 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 33 transition count 97
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 33 transition count 95
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 33 transition count 95
Applied a total of 43 rules in 30 ms. Remains 33 /53 variables (removed 20) and now considering 95/85 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 33/53 places, 95/85 transitions.
Finished random walk after 1337 steps, including 222 resets, run visited all 3 properties in 14 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 585 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-24 13:36:54] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:54] [INFO ] Invariant cache hit.
[2024-05-24 13:36:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 13:36:55] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:55] [INFO ] Invariant cache hit.
[2024-05-24 13:36:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:36:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 13:36:55] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 13:36:55] [INFO ] Invariant cache hit.
[2024-05-24 13:36:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 53/53 places, 85/85 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 87 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), false, (NOT p1)]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Finished probabilistic random walk after 6454 steps, run visited all 3 properties in 11 ms. (steps per millisecond=586 )
Probabilistic random walk after 6454 steps, saw 1551 distinct states, run finished after 12 ms. (steps per millisecond=537 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), false, (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 9 reset in 94 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 10 / 53 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 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 47 transition count 125
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 47 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 47 /53 variables (removed 6) and now considering 124/85 (removed -39) transitions.
[2024-05-24 13:36:56] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 13:36:56] [INFO ] Flow matrix only has 107 transitions (discarded 17 similar events)
// Phase 1: matrix 107 rows 47 cols
[2024-05-24 13:36:56] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 13:36:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 124/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 47/53 places, 124/85 transitions.
Built C files in :
/tmp/ltsmin9684586214747355735
[2024-05-24 13:36:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9684586214747355735
Running compilation step : cd /tmp/ltsmin9684586214747355735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin9684586214747355735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9684586214747355735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4277422543732796748.hoa' '--buchi-type=spotba'
LTSmin run took 11610 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-14 finished in 15841 ms.
All properties solved by simple procedures.
Total runtime 25859 ms.

BK_STOP 1716557829453

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HealthRecord-PT-11, 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 r197-tall-171640625700487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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