fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r197-tall-171640625700483
Last Updated
July 7, 2024

About the Execution of 2023-gold for HealthRecord-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
363.388 18096.00 35034.00 418.70 TFFFTFTFFTFTTTFT normal

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-171640625700483.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625700483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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-10-LTLFireability-00
FORMULA_NAME HealthRecord-PT-10-LTLFireability-01
FORMULA_NAME HealthRecord-PT-10-LTLFireability-02
FORMULA_NAME HealthRecord-PT-10-LTLFireability-03
FORMULA_NAME HealthRecord-PT-10-LTLFireability-04
FORMULA_NAME HealthRecord-PT-10-LTLFireability-05
FORMULA_NAME HealthRecord-PT-10-LTLFireability-06
FORMULA_NAME HealthRecord-PT-10-LTLFireability-07
FORMULA_NAME HealthRecord-PT-10-LTLFireability-08
FORMULA_NAME HealthRecord-PT-10-LTLFireability-09
FORMULA_NAME HealthRecord-PT-10-LTLFireability-10
FORMULA_NAME HealthRecord-PT-10-LTLFireability-11
FORMULA_NAME HealthRecord-PT-10-LTLFireability-12
FORMULA_NAME HealthRecord-PT-10-LTLFireability-13
FORMULA_NAME HealthRecord-PT-10-LTLFireability-14
FORMULA_NAME HealthRecord-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716557718887

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:35:20] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-24 13:35:20] [INFO ] Transformed 158 places.
[2024-05-24 13:35:20] [INFO ] Transformed 333 transitions.
[2024-05-24 13:35:20] [INFO ] Found NUPN structural information;
[2024-05-24 13:35:20] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 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-10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 79 transition count 156
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 79 transition count 156
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 165 place count 72 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 172 place count 72 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 179 place count 72 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 71 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 71 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 70 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 70 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 184 place count 70 transition count 129
Applied a total of 184 rules in 24 ms. Remains 70 /158 variables (removed 88) and now considering 129/306 (removed 177) transitions.
[2024-05-24 13:35:20] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
// Phase 1: matrix 125 rows 70 cols
[2024-05-24 13:35:20] [INFO ] Computed 10 invariants in 9 ms
[2024-05-24 13:35:21] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 13:35:21] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
[2024-05-24 13:35:21] [INFO ] Invariant cache hit.
[2024-05-24 13:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-24 13:35:21] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
[2024-05-24 13:35:21] [INFO ] Invariant cache hit.
[2024-05-24 13:35:21] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/158 places, 129/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 70/158 places, 129/306 transitions.
Support contains 24 out of 70 places after structural reductions.
[2024-05-24 13:35:21] [INFO ] Flatten gal took : 30 ms
[2024-05-24 13:35:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 13:35:21] [INFO ] Input system was already deterministic with 129 transitions.
Incomplete random walk after 10000 steps, including 638 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-24 13:35:22] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
[2024-05-24 13:35:22] [INFO ] Invariant cache hit.
[2024-05-24 13:35:22] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 13:35:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:35:22] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:35:22] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-24 13:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:22] [INFO ] After 77ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-24 13:35:22] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 13:35:22] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 17 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 129/129 transitions.
Graph (trivial) has 44 edges and 70 vertex of which 4 / 70 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 271 edges and 68 vertex of which 67 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 67 transition count 118
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 64 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 13 place count 58 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 19 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 21 place count 58 transition count 104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 55 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 55 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 52 transition count 110
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 52 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 51 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 51 transition count 109
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 51 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 51 transition count 108
Applied a total of 39 rules in 34 ms. Remains 51 /70 variables (removed 19) and now considering 108/129 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 51/70 places, 108/129 transitions.
Incomplete random walk after 10000 steps, including 1478 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :3
Running SMT prover for 7 properties.
[2024-05-24 13:35:23] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
// Phase 1: matrix 102 rows 51 cols
[2024-05-24 13:35:23] [INFO ] Computed 8 invariants in 4 ms
[2024-05-24 13:35:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 13:35:23] [INFO ] [Real]Absence check using 1 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 13:35:23] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 13:35:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 13:35:23] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 13:35:24] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 13:35:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 13:35:24] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 13:35:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 13:35:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-24 13:35:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-24 13:35:24] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-24 13:35:24] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 108/108 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 4 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 222 edges and 49 vertex of which 48 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 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 102
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 46 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 43 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 43 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 43 transition count 92
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 20 place count 41 transition count 110
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 41 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 40 transition count 109
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 34 place count 40 transition count 109
Applied a total of 34 rules in 25 ms. Remains 40 /51 variables (removed 11) and now considering 109/108 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 40/51 places, 109/108 transitions.
Incomplete random walk after 10000 steps, including 1516 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 13:35:24] [INFO ] Flow matrix only has 98 transitions (discarded 11 similar events)
// Phase 1: matrix 98 rows 40 cols
[2024-05-24 13:35:24] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 13:35:24] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 13:35:24] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-24 13:35:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 13:35:24] [INFO ] After 13ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 13:35:24] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 13:35:24] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 13:35:24] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 13:35:24] [INFO ] After 18ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 13:35:24] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 13:35:24] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 109/109 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 38 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 38 transition count 104
Applied a total of 6 rules in 39 ms. Remains 38 /40 variables (removed 2) and now considering 104/109 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 38/40 places, 104/109 transitions.
Incomplete random walk after 10000 steps, including 1500 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 241 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:35:25] [INFO ] Flow matrix only has 93 transitions (discarded 11 similar events)
// Phase 1: matrix 93 rows 38 cols
[2024-05-24 13:35:25] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 13:35:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-24 13:35:25] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 13:35:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 13:35:25] [INFO ] After 8ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:35:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:35:25] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 13:35:25] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:35:25] [INFO ] After 7ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:35:25] [INFO ] After 17ms 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:35:25] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 102
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 37 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 34 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 34 transition count 97
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 34 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 33 transition count 96
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 33 transition count 96
Applied a total of 13 rules in 23 ms. Remains 33 /38 variables (removed 5) and now considering 96/104 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 33/38 places, 96/104 transitions.
Incomplete random walk after 10000 steps, including 2148 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:35:25] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
// Phase 1: matrix 81 rows 33 cols
[2024-05-24 13:35:25] [INFO ] Computed 7 invariants in 6 ms
[2024-05-24 13:35:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 13:35:25] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:35:25] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 13:35:25] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:35:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 13:35:25] [INFO ] After 9ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:35:25] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 13:35:25] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 96/96 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 31 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 31 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 30 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 30 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 30 transition count 85
Applied a total of 10 rules in 8 ms. Remains 30 /33 variables (removed 3) and now considering 85/96 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 30/33 places, 85/96 transitions.
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 707 steps, run visited all 1 properties in 9 ms. (steps per millisecond=78 )
Probabilistic random walk after 707 steps, saw 293 distinct states, run finished after 9 ms. (steps per millisecond=78 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 4 stabilizing places and 5 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' '!(X(F((p0||(X(p0)&&p1)))))'
Support contains 1 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 55 transition count 100
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 53 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 53 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 51 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 51 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 47 place count 51 transition count 81
Applied a total of 47 rules in 5 ms. Remains 51 /70 variables (removed 19) and now considering 81/129 (removed 48) transitions.
[2024-05-24 13:35:25] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2024-05-24 13:35:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:35:25] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 13:35:25] [INFO ] Invariant cache hit.
[2024-05-24 13:35:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:25] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 13:35:25] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 13:35:25] [INFO ] Invariant cache hit.
[2024-05-24 13:35:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/70 places, 81/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 51/70 places, 81/129 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 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s33 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-00 finished in 817 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(F(p0)))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 52 transition count 94
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 52 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 48 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 48 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 48 transition count 74
Applied a total of 54 rules in 10 ms. Remains 48 /70 variables (removed 22) and now considering 74/129 (removed 55) transitions.
[2024-05-24 13:35:26] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
// Phase 1: matrix 71 rows 48 cols
[2024-05-24 13:35:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 13:35:26] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2024-05-24 13:35:26] [INFO ] Invariant cache hit.
[2024-05-24 13:35:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-24 13:35:26] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2024-05-24 13:35:26] [INFO ] Invariant cache hit.
[2024-05-24 13:35:26] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/70 places, 74/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 48/70 places, 74/129 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-01 finished in 271 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(F((F(X(X(F((X(p0) U p1)))))&&p0))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Graph (trivial) has 79 edges and 70 vertex of which 10 / 70 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 50 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 50 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 32 place count 50 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 48 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 48 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 47 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 45 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
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 50 place count 43 transition count 97
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 43 transition count 94
Applied a total of 53 rules in 29 ms. Remains 43 /70 variables (removed 27) and now considering 94/129 (removed 35) transitions.
[2024-05-24 13:35:26] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
// Phase 1: matrix 84 rows 43 cols
[2024-05-24 13:35:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:35:26] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
[2024-05-24 13:35:26] [INFO ] Invariant cache hit.
[2024-05-24 13:35:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 13:35:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 13:35:27] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 13:35:27] [INFO ] Flow matrix only has 84 transitions (discarded 10 similar events)
[2024-05-24 13:35:27] [INFO ] Invariant cache hit.
[2024-05-24 13:35:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/70 places, 94/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 43/70 places, 94/129 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s6 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-02 finished in 373 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 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Graph (trivial) has 73 edges and 70 vertex of which 10 / 70 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.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 49 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 49 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 47 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 47 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 46 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 46 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 44 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 43 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 43 transition count 82
Applied a total of 53 rules in 29 ms. Remains 43 /70 variables (removed 27) and now considering 82/129 (removed 47) transitions.
[2024-05-24 13:35:27] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
// Phase 1: matrix 75 rows 43 cols
[2024-05-24 13:35:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:35:27] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-24 13:35:27] [INFO ] Invariant cache hit.
[2024-05-24 13:35:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:35:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:35:27] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 13:35:27] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-24 13:35:27] [INFO ] Invariant cache hit.
[2024-05-24 13:35:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/70 places, 82/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 43/70 places, 82/129 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 0) (OR (EQ s26 0) (EQ s30 0)))], 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 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 29 ms :[(NOT p0)]
Finished random walk after 20 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 93 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 39 ms :[(NOT p0)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-24 13:35:28] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-24 13:35:28] [INFO ] Invariant cache hit.
[2024-05-24 13:35:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 13:35:28] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-24 13:35:28] [INFO ] Invariant cache hit.
[2024-05-24 13:35:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 13:35:28] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 13:35:28] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 13:35:28] [INFO ] Flow matrix only has 75 transitions (discarded 7 similar events)
[2024-05-24 13:35:28] [INFO ] Invariant cache hit.
[2024-05-24 13:35:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 43/43 places, 82/82 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 39 ms :[(NOT p0)]
Finished random walk after 130 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
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 85 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 175 ms.
Built C files in :
/tmp/ltsmin3081176410257961629
[2024-05-24 13:35:28] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-24 13:35:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:28] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-24 13:35:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:28] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-24 13:35:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:28] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3081176410257961629
Running compilation step : cd /tmp/ltsmin3081176410257961629;'/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 257 ms.
Running link step : cd /tmp/ltsmin3081176410257961629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3081176410257961629;'/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/stateBased5493898934948316292.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA HealthRecord-PT-10-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-03 finished in 2090 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)||G(p1))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Graph (trivial) has 62 edges and 70 vertex of which 10 / 70 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 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 49 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 49 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 47 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 47 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 46 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 46 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 44 transition count 77
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 44 transition count 75
Applied a total of 51 rules in 13 ms. Remains 44 /70 variables (removed 26) and now considering 75/129 (removed 54) transitions.
[2024-05-24 13:35:29] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 44 cols
[2024-05-24 13:35:29] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:35:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 13:35:29] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:29] [INFO ] Invariant cache hit.
[2024-05-24 13:35:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 13:35:29] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 13:35:29] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:29] [INFO ] Invariant cache hit.
[2024-05-24 13:35:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/70 places, 75/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 44/70 places, 75/129 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 0), p1:(OR (EQ s3 0) (EQ s7 0) (EQ s11 0) (EQ s42 0))], nbAcceptance=2, 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 4 reset in 81 ms.
Product exploration explored 100000 steps with 1 reset in 119 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Computed a total of 9 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 918 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-24 13:35:30] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:30] [INFO ] Invariant cache hit.
[2024-05-24 13:35:30] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:35:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 13:35:30] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 13:35:30] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 13:35:30] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 75/75 transitions.
Graph (complete) has 153 edges and 44 vertex of which 29 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 29 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 24 place count 29 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 21 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 44 place count 21 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 19 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 19 transition count 29
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 50 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 16 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 15 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 15 transition count 26
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 4 with 2 rules applied. Total rules applied 57 place count 14 transition count 25
Applied a total of 57 rules in 10 ms. Remains 14 /44 variables (removed 30) and now considering 25/75 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 14/44 places, 25/75 transitions.
Finished random walk after 83 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-24 13:35:30] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:30] [INFO ] Invariant cache hit.
[2024-05-24 13:35:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:35:30] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:30] [INFO ] Invariant cache hit.
[2024-05-24 13:35:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:35:30] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 13:35:30] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:30] [INFO ] Invariant cache hit.
[2024-05-24 13:35:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 44/44 places, 75/75 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Computed a total of 9 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 925 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-24 13:35:31] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 13:35:31] [INFO ] Invariant cache hit.
[2024-05-24 13:35:31] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:35:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 13:35:31] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 13:35:31] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 13:35:31] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 75/75 transitions.
Graph (complete) has 153 edges and 44 vertex of which 29 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 29 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 24 place count 29 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 21 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 44 place count 21 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 19 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 19 transition count 29
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 50 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 16 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 15 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 15 transition count 26
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 4 with 2 rules applied. Total rules applied 57 place count 14 transition count 25
Applied a total of 57 rules in 11 ms. Remains 14 /44 variables (removed 30) and now considering 25/75 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 14/44 places, 25/75 transitions.
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=121 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 191 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Built C files in :
/tmp/ltsmin11010005062676190631
[2024-05-24 13:35:31] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-24 13:35:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:31] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-24 13:35:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:31] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-24 13:35:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:35:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11010005062676190631
Running compilation step : cd /tmp/ltsmin11010005062676190631;'/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 158 ms.
Running link step : cd /tmp/ltsmin11010005062676190631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11010005062676190631;'/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/stateBased2259418399711911600.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA HealthRecord-PT-10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLFireability-05 finished in 2652 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||X(p2)))))||(!p0&&X((p1||X(p2)))&&F(p3))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 56 transition count 102
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 56 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 55 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 54 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 54 transition count 90
Applied a total of 39 rules in 4 ms. Remains 54 /70 variables (removed 16) and now considering 90/129 (removed 39) transitions.
[2024-05-24 13:35:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 13:35:32] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:35:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:35:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 13:35:32] [INFO ] Invariant cache hit.
[2024-05-24 13:35:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 13:35:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 13:35:32] [INFO ] Invariant cache hit.
[2024-05-24 13:35:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/70 places, 90/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 54/70 places, 90/129 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR p0 (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s42 1)), p3:(NEQ s8 1), p1:(NEQ s33 1), p2:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X p1), (X (X p3)), true, (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-06 finished in 902 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((G(p0)||F(p1))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 53 transition count 96
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 53 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 53 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 51 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 50 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 50 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 50 transition count 81
Applied a total of 47 rules in 5 ms. Remains 50 /70 variables (removed 20) and now considering 81/129 (removed 48) transitions.
[2024-05-24 13:35:32] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 50 cols
[2024-05-24 13:35:32] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:35:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:35:32] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 13:35:32] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 13:35:33] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/70 places, 81/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 50/70 places, 81/129 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s38 1), p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-07 finished in 284 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(F((p0||G(p1)))) U !p1))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Graph (trivial) has 79 edges and 70 vertex of which 10 / 70 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 50 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 50 transition count 96
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 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 47 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 47 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 45 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 45 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 45 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 43 transition count 71
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 3 with 4 rules applied. Total rules applied 58 place count 41 transition count 85
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 41 transition count 82
Applied a total of 61 rules in 13 ms. Remains 41 /70 variables (removed 29) and now considering 82/129 (removed 47) transitions.
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 41 cols
[2024-05-24 13:35:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-24 13:35:33] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:35:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:35:33] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-24 13:35:33] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/70 places, 82/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 41/70 places, 82/129 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s22 1), p0:(EQ s15 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 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-08 finished in 311 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((G(p0) U p1)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 54 transition count 97
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 54 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 36 place count 54 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 52 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 52 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 50 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 50 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 50 transition count 77
Applied a total of 50 rules in 5 ms. Remains 50 /70 variables (removed 20) and now considering 77/129 (removed 52) transitions.
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 50 cols
[2024-05-24 13:35:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 13:35:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 13:35:33] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:35:33] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 13:35:33] [INFO ] Invariant cache hit.
[2024-05-24 13:35:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/70 places, 77/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 50/70 places, 77/129 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s35 1), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-09 finished in 628 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(G((G(p0)||(G(p0) U p1)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 54 transition count 98
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 54 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 54 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 50 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 50 transition count 79
Applied a total of 49 rules in 6 ms. Remains 50 /70 variables (removed 20) and now considering 79/129 (removed 50) transitions.
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2024-05-24 13:35:34] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:35:34] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:35:34] [INFO ] Invariant cache hit.
[2024-05-24 13:35:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:35:34] [INFO ] Invariant cache hit.
[2024-05-24 13:35:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/70 places, 79/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 50/70 places, 79/129 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s7 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-10 finished in 291 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(F((X(G((X(p0)||F(p1))))&&(X(p3)||p2)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 54 transition count 98
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 54 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 52 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 50 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 50 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 48 place count 50 transition count 80
Applied a total of 48 rules in 5 ms. Remains 50 /70 variables (removed 20) and now considering 80/129 (removed 49) transitions.
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2024-05-24 13:35:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:35:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:35:34] [INFO ] Invariant cache hit.
[2024-05-24 13:35:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 13:35:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:35:34] [INFO ] Invariant cache hit.
[2024-05-24 13:35:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/70 places, 80/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 50/70 places, 80/129 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p1) p0 (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s9 0) (EQ s48 0)), p1:(OR (EQ s9 0) (EQ s48 0)), p3:(EQ s2 0), p0:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p3 p0), (X p2), (X (X p3)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p1) p0 (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 626 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 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 55 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 13:35:35] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:35:35] [INFO ] Invariant cache hit.
[2024-05-24 13:35:35] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 13:35:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:35:35] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2024-05-24 13:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:35:35] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2024-05-24 13:35:36] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 13:35:36] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (trivial) has 40 edges and 50 vertex of which 10 / 50 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 163 edges and 45 vertex of which 29 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 29 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 21 place count 29 transition count 37
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 31 place count 24 transition count 37
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 21 transition count 30
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 21 transition count 30
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 20 transition count 29
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 20 transition count 29
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 19 transition count 28
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 19 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 19 transition count 27
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 2 with 2 rules applied. Total rules applied 44 place count 18 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 18 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 17 transition count 23
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 14 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 14 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 13 transition count 21
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 4 with 2 rules applied. Total rules applied 55 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 12 transition count 19
Applied a total of 56 rules in 9 ms. Remains 12 /50 variables (removed 38) and now considering 19/80 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 12/50 places, 19/80 transitions.
Finished random walk after 150 steps, including 10 resets, run visited all 2 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p3 p0), (X p2), (X (X p3)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (G (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p3) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-11 finished in 1627 ms.
All properties solved by simple procedures.
Total runtime 15750 ms.

BK_STOP 1716557736983

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-10"
export BK_EXAMINATION="LTLFireability"
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-10, examination is LTLFireability"
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-171640625700483"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;