Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-LTLFireability-00
FORMULA_NAME HealthRecord-PT-11-LTLFireability-01
FORMULA_NAME HealthRecord-PT-11-LTLFireability-02
FORMULA_NAME HealthRecord-PT-11-LTLFireability-03
FORMULA_NAME HealthRecord-PT-11-LTLFireability-04
FORMULA_NAME HealthRecord-PT-11-LTLFireability-05
FORMULA_NAME HealthRecord-PT-11-LTLFireability-06
FORMULA_NAME HealthRecord-PT-11-LTLFireability-07
FORMULA_NAME HealthRecord-PT-11-LTLFireability-08
FORMULA_NAME HealthRecord-PT-11-LTLFireability-09
FORMULA_NAME HealthRecord-PT-11-LTLFireability-10
FORMULA_NAME HealthRecord-PT-11-LTLFireability-11
FORMULA_NAME HealthRecord-PT-11-LTLFireability-12
FORMULA_NAME HealthRecord-PT-11-LTLFireability-13
FORMULA_NAME HealthRecord-PT-11-LTLFireability-14
FORMULA_NAME HealthRecord-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678517981982

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:59:46] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-11 06:59:46] [INFO ] Transformed 159 places.
[2023-03-11 06:59:46] [INFO ] Transformed 334 transitions.
[2023-03-11 06:59:46] [INFO ] Found NUPN structural information;
[2023-03-11 06:59:46] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 81 transition count 159
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 81 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 163 place count 74 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 170 place count 74 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 175 place count 74 transition count 140
Applied a total of 175 rules in 52 ms. Remains 74 /159 variables (removed 85) and now considering 140/307 (removed 167) transitions.
[2023-03-11 06:59:46] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 74 cols
[2023-03-11 06:59:46] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-11 06:59:46] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-11 06:59:46] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2023-03-11 06:59:46] [INFO ] Invariant cache hit.
[2023-03-11 06:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:59:47] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-11 06:59:47] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2023-03-11 06:59:47] [INFO ] Invariant cache hit.
[2023-03-11 06:59:47] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/159 places, 140/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 898 ms. Remains : 74/159 places, 140/307 transitions.
Support contains 29 out of 74 places after structural reductions.
[2023-03-11 06:59:47] [INFO ] Flatten gal took : 71 ms
[2023-03-11 06:59:47] [INFO ] Flatten gal took : 31 ms
[2023-03-11 06:59:47] [INFO ] Input system was already deterministic with 140 transitions.
Support contains 28 out of 74 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 668 resets, run finished after 701 ms. (steps per millisecond=14 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1001 steps, including 9 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 10 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 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 06:59:48] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
[2023-03-11 06:59:48] [INFO ] Invariant cache hit.
[2023-03-11 06:59:48] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-11 06:59:48] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:59:48] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 06:59:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-11 06:59:49] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:59:49] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-11 06:59:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:59:49] [INFO ] After 163ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2023-03-11 06:59:49] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-11 06:59:49] [INFO ] After 1035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 16 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 59 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 9 ms
Free SCC test removed 3 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 293 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 70 transition count 127
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 67 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 12 place count 62 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 62 transition count 117
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 0 with 4 rules applied. Total rules applied 21 place count 60 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 31 place count 55 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 55 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 55 transition count 146
Applied a total of 34 rules in 60 ms. Remains 55 /74 variables (removed 19) and now considering 146/140 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 55/74 places, 146/140 transitions.
Incomplete random walk after 10000 steps, including 1801 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 388 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 364 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 368 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 360 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 372 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 367 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 06:59:51] [INFO ] Flow matrix only has 134 transitions (discarded 12 similar events)
// Phase 1: matrix 134 rows 55 cols
[2023-03-11 06:59:51] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 06:59:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 06:59:51] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:59:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 06:59:51] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 06:59:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 06:59:51] [INFO ] After 49ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 06:59:51] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 06:59:51] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 146/146 transitions.
Graph (trivial) has 34 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 248 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 52 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 50 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 50 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 50 transition count 133
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 3 with 2 rules applied. Total rules applied 16 place count 49 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 48 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 48 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 46 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 46 transition count 142
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 46 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 45 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 45 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 27 place count 45 transition count 140
Applied a total of 27 rules in 78 ms. Remains 45 /55 variables (removed 10) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 45/55 places, 140/146 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 313 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:59:52] [INFO ] Flow matrix only has 123 transitions (discarded 17 similar events)
// Phase 1: matrix 123 rows 45 cols
[2023-03-11 06:59:52] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 06:59:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 06:59:52] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:59:52] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 06:59:52] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:59:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:59:52] [INFO ] After 54ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:59:53] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 2 ms to minimize.
[2023-03-11 06:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2023-03-11 06:59:53] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-11 06:59:53] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 140/140 transitions.
Graph (trivial) has 25 edges and 45 vertex of which 2 / 45 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 197 edges and 44 vertex of which 35 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 35 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 33 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 33 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 34 place count 33 transition count 97
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 2 with 4 rules applied. Total rules applied 38 place count 31 transition count 95
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 31 transition count 95
Applied a total of 48 rules in 29 ms. Remains 31 /45 variables (removed 14) and now considering 95/140 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 31/45 places, 95/140 transitions.
Incomplete random walk after 10000 steps, including 2489 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 417 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 414 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Finished probabilistic random walk after 1517 steps, run visited all 5 properties in 51 ms. (steps per millisecond=29 )
Probabilistic random walk after 1517 steps, saw 570 distinct states, run finished after 51 ms. (steps per millisecond=29 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 6 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 109
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 58 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 54 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 51 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 50 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 50 transition count 77
Applied a total of 61 rules in 9 ms. Remains 50 /74 variables (removed 24) and now considering 77/140 (removed 63) transitions.
[2023-03-11 06:59:54] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2023-03-11 06:59:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:59:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 06:59:54] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2023-03-11 06:59:54] [INFO ] Invariant cache hit.
[2023-03-11 06:59:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:59:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 06:59:54] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2023-03-11 06:59:54] [INFO ] Invariant cache hit.
[2023-03-11 06:59:54] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 77/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 50/74 places, 77/140 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-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 s30 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 8 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-01 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 56 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 54 transition count 98
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 54 transition count 92
Applied a total of 47 rules in 15 ms. Remains 54 /74 variables (removed 20) and now considering 92/140 (removed 48) transitions.
[2023-03-11 06:59:54] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2023-03-11 06:59:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:59:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-11 06:59:55] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2023-03-11 06:59:55] [INFO ] Invariant cache hit.
[2023-03-11 06:59:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:59:55] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-11 06:59:55] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2023-03-11 06:59:55] [INFO ] Invariant cache hit.
[2023-03-11 06:59:55] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 92/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 54/74 places, 92/140 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s30 1), p1:(AND (EQ s35 1) (EQ s39 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-03 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 108
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 58 transition count 104
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 54 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 54 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 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 56 place count 51 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 50 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 50 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 50 transition count 76
Applied a total of 61 rules in 17 ms. Remains 50 /74 variables (removed 24) and now considering 76/140 (removed 64) transitions.
[2023-03-11 06:59:55] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
// Phase 1: matrix 72 rows 50 cols
[2023-03-11 06:59:55] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 06:59:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 06:59:55] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2023-03-11 06:59:55] [INFO ] Invariant cache hit.
[2023-03-11 06:59:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:59:56] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-11 06:59:56] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2023-03-11 06:59:56] [INFO ] Invariant cache hit.
[2023-03-11 06:59:56] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 76/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 50/74 places, 76/140 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s48 1)), p1:(EQ s7 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 626 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-04 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 10 / 74 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 53 transition count 105
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 53 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 53 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 48 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 48 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 45 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 45 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 45 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 44 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 44 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 44 transition count 71
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 64 place count 43 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 41 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 41 transition count 82
Applied a total of 70 rules in 34 ms. Remains 41 /74 variables (removed 33) and now considering 82/140 (removed 58) transitions.
[2023-03-11 06:59:57] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 41 cols
[2023-03-11 06:59:57] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 06:59:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 06:59:57] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:57] [INFO ] Invariant cache hit.
[2023-03-11 06:59:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:59:57] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-11 06:59:57] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 06:59:57] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:57] [INFO ] Invariant cache hit.
[2023-03-11 06:59:57] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/74 places, 82/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 41/74 places, 82/140 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-05 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 86 edges and 74 vertex of which 10 / 74 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 53 transition count 105
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 53 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 53 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 48 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 48 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 48 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 45 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 45 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 44 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 44 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 44 transition count 71
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 64 place count 43 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 41 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 41 transition count 82
Applied a total of 70 rules in 29 ms. Remains 41 /74 variables (removed 33) and now considering 82/140 (removed 58) transitions.
[2023-03-11 06:59:57] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 41 cols
[2023-03-11 06:59:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:59:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 06:59:57] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:57] [INFO ] Invariant cache hit.
[2023-03-11 06:59:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:59:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 06:59:58] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 06:59:58] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:58] [INFO ] Invariant cache hit.
[2023-03-11 06:59:58] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/74 places, 82/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 41/74 places, 82/140 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 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 4 reset in 216 ms.
Product exploration explored 100000 steps with 2 reset in 187 ms.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1043 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 553 steps, run visited all 1 properties in 9 ms. (steps per millisecond=61 )
Probabilistic random walk after 553 steps, saw 258 distinct states, run finished after 9 ms. (steps per millisecond=61 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 06:59:59] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:59] [INFO ] Invariant cache hit.
[2023-03-11 06:59:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 06:59:59] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:59] [INFO ] Invariant cache hit.
[2023-03-11 06:59:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:59:59] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 06:59:59] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 06:59:59] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 06:59:59] [INFO ] Invariant cache hit.
[2023-03-11 06:59:59] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 41/41 places, 82/82 transitions.
Computed a total of 14 stabilizing places and 27 stable transitions
Computed a total of 14 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 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 57 ms :[(NOT p0)]
Finished random walk after 8625 steps, including 884 resets, run visited all 1 properties in 19 ms. (steps per millisecond=453 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 97 ms.
Product exploration explored 100000 steps with 8 reset in 339 ms.
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 82/82 transitions.
Applied a total of 0 rules in 13 ms. Remains 41 /41 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:00:00] [INFO ] Invariant cache hit.
[2023-03-11 07:00:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:00:00] [INFO ] Invariant cache hit.
[2023-03-11 07:00:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:00:00] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 07:00:00] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:00:00] [INFO ] Invariant cache hit.
[2023-03-11 07:00:00] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 41/41 places, 82/82 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-06 finished in 2844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 107
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 57 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 53 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 53 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 50 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 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 58 place count 50 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 49 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 49 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 49 transition count 75
Applied a total of 63 rules in 7 ms. Remains 49 /74 variables (removed 25) and now considering 75/140 (removed 65) transitions.
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
// Phase 1: matrix 72 rows 49 cols
[2023-03-11 07:00:00] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:00:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2023-03-11 07:00:00] [INFO ] Invariant cache hit.
[2023-03-11 07:00:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:00] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 07:00:00] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2023-03-11 07:00:00] [INFO ] Invariant cache hit.
[2023-03-11 07:00:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 75/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 49/74 places, 75/140 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-07 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 s40 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 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-07 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(F(p2)))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 81 edges and 74 vertex of which 10 / 74 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 53 transition count 105
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 53 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 53 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 48 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 48 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 48 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 46 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 46 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 46 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 45 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 45 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 45 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 44 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 42 transition count 90
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 42 transition count 88
Applied a total of 66 rules in 20 ms. Remains 42 /74 variables (removed 32) and now considering 88/140 (removed 52) transitions.
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
// Phase 1: matrix 78 rows 42 cols
[2023-03-11 07:00:01] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2023-03-11 07:00:01] [INFO ] Invariant cache hit.
[2023-03-11 07:00:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:00:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 07:00:01] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2023-03-11 07:00:01] [INFO ] Invariant cache hit.
[2023-03-11 07:00:01] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/74 places, 88/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 42/74 places, 88/140 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s35 1)), p2:(EQ s32 1), p1:(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-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-08 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(p1))) U G(p2)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 59 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 56 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 56 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 55 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 55 transition count 95
Applied a total of 45 rules in 4 ms. Remains 55 /74 variables (removed 19) and now considering 95/140 (removed 45) transitions.
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 55 cols
[2023-03-11 07:00:01] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:00:01] [INFO ] Invariant cache hit.
[2023-03-11 07:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:01] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-11 07:00:01] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:00:01] [INFO ] Invariant cache hit.
[2023-03-11 07:00:01] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/74 places, 95/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 55/74 places, 95/140 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s8 1), p0:(EQ s42 1), p1:(OR (EQ s25 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 48 ms.
Product exploration explored 100000 steps with 3 reset in 65 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1287 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 667 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 82569 steps, run visited all 1 properties in 208 ms. (steps per millisecond=396 )
Probabilistic random walk after 82569 steps, saw 13522 distinct states, run finished after 208 ms. (steps per millisecond=396 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 22 factoid took 1081 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 95/95 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-11 07:00:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:00:05] [INFO ] Invariant cache hit.
[2023-03-11 07:00:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 07:00:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:00:05] [INFO ] Invariant cache hit.
[2023-03-11 07:00:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-11 07:00:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:00:05] [INFO ] Invariant cache hit.
[2023-03-11 07:00:05] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 55/55 places, 95/95 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 674 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 82569 steps, run visited all 1 properties in 102 ms. (steps per millisecond=809 )
Probabilistic random walk after 82569 steps, saw 13522 distinct states, run finished after 103 ms. (steps per millisecond=801 ) properties seen :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4 reset in 49 ms.
Product exploration explored 100000 steps with 13 reset in 63 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 95/95 transitions.
Graph (trivial) has 53 edges and 55 vertex of which 10 / 55 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.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 47 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 47 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 47 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 46 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 46 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 46 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 46 transition count 127
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 46 transition count 126
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 20 rules in 13 ms. Remains 46 /55 variables (removed 9) and now considering 126/95 (removed -31) transitions.
[2023-03-11 07:00:06] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:00:06] [INFO ] Flow matrix only has 109 transitions (discarded 17 similar events)
// Phase 1: matrix 109 rows 46 cols
[2023-03-11 07:00:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:06] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/55 places, 126/95 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 46/55 places, 126/95 transitions.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 95/95 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 52 transition count 85
Applied a total of 9 rules in 2 ms. Remains 52 /55 variables (removed 3) and now considering 85/95 (removed 10) transitions.
[2023-03-11 07:00:06] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 52 cols
[2023-03-11 07:00:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 07:00:06] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 07:00:06] [INFO ] Invariant cache hit.
[2023-03-11 07:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:07] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 07:00:07] [INFO ] Invariant cache hit.
[2023-03-11 07:00:07] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/55 places, 85/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 52/55 places, 85/95 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-09 finished in 5584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 109
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 58 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 54 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 51 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 51 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 50 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 50 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 50 transition count 78
Applied a total of 60 rules in 3 ms. Remains 50 /74 variables (removed 24) and now considering 78/140 (removed 62) transitions.
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 50 cols
[2023-03-11 07:00:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 07:00:07] [INFO ] Invariant cache hit.
[2023-03-11 07:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:07] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 07:00:07] [INFO ] Invariant cache hit.
[2023-03-11 07:00:07] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 78/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 50/74 places, 78/140 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s8 0), p1:(EQ s13 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-10 finished in 749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&G((X(G(p1))||F(p2)))))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 80 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 55 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 55 transition count 107
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 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 52 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 52 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 50 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 49 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 49 transition count 83
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 3 with 2 rules applied. Total rules applied 55 place count 48 transition count 82
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 59 place count 46 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 46 transition count 97
Applied a total of 61 rules in 14 ms. Remains 46 /74 variables (removed 28) and now considering 97/140 (removed 43) transitions.
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
// Phase 1: matrix 88 rows 46 cols
[2023-03-11 07:00:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 07:00:07] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:07] [INFO ] Invariant cache hit.
[2023-03-11 07:00:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:08] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-11 07:00:08] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 07:00:08] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:08] [INFO ] Invariant cache hit.
[2023-03-11 07:00:08] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/74 places, 97/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 46/74 places, 97/140 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s27 0), p2:(EQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 2 reset in 227 ms.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 794 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1041 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1245 steps, run visited all 4 properties in 18 ms. (steps per millisecond=69 )
Probabilistic random walk after 1245 steps, saw 483 distinct states, run finished after 18 ms. (steps per millisecond=69 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 13 factoid took 695 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-11 07:00:11] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:11] [INFO ] Invariant cache hit.
[2023-03-11 07:00:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:00:12] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:12] [INFO ] Invariant cache hit.
[2023-03-11 07:00:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:12] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 07:00:12] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:12] [INFO ] Invariant cache hit.
[2023-03-11 07:00:12] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 46/46 places, 97/97 transitions.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 573 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1036 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 142 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1245 steps, run visited all 4 properties in 11 ms. (steps per millisecond=113 )
Probabilistic random walk after 1245 steps, saw 483 distinct states, run finished after 12 ms. (steps per millisecond=103 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 641 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14 reset in 73 ms.
Product exploration explored 100000 steps with 4 reset in 557 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-11 07:00:15] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 07:00:15] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:15] [INFO ] Invariant cache hit.
[2023-03-11 07:00:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 46/46 places, 97/97 transitions.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 97/97 transitions.
Applied a total of 0 rules in 0 ms. Remains 46 /46 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-11 07:00:15] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:15] [INFO ] Invariant cache hit.
[2023-03-11 07:00:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 07:00:15] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:15] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:00:16] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 46/46 places, 97/97 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-11 finished in 8315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 84 edges and 74 vertex of which 10 / 74 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 54 transition count 107
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 107
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 54 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 50 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 50 transition count 94
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 50 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 48 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 48 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 47 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 47 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 47 transition count 80
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 56 place count 46 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 44 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 44 transition count 93
Applied a total of 61 rules in 19 ms. Remains 44 /74 variables (removed 30) and now considering 93/140 (removed 47) transitions.
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 44 cols
[2023-03-11 07:00:16] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:16] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:00:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-11 07:00:16] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:16] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/74 places, 93/140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 44/74 places, 93/140 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s5 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-12 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 107
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 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 54 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 52 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 51 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 51 transition count 83
Applied a total of 56 rules in 6 ms. Remains 51 /74 variables (removed 23) and now considering 83/140 (removed 57) transitions.
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 51 cols
[2023-03-11 07:00:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:16] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:16] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 07:00:16] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:16] [INFO ] Invariant cache hit.
[2023-03-11 07:00:16] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/74 places, 83/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 51/74 places, 83/140 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s40 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]]
Product exploration explored 100000 steps with 20 reset in 86 ms.
Product exploration explored 100000 steps with 7 reset in 104 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 681 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5885 steps, run visited all 1 properties in 15 ms. (steps per millisecond=392 )
Probabilistic random walk after 5885 steps, saw 1450 distinct states, run finished after 15 ms. (steps per millisecond=392 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 83/83 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-11 07:00:18] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:18] [INFO ] Invariant cache hit.
[2023-03-11 07:00:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 51/51 places, 83/83 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5885 steps, run visited all 1 properties in 19 ms. (steps per millisecond=309 )
Probabilistic random walk after 5885 steps, saw 1450 distinct states, run finished after 20 ms. (steps per millisecond=294 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 49 ms.
Product exploration explored 100000 steps with 17 reset in 63 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 83/83 transitions.
Graph (trivial) has 46 edges and 51 vertex of which 10 / 51 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 45 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 45 transition count 127
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 45 transition count 126
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 13 ms. Remains 45 /51 variables (removed 6) and now considering 126/83 (removed -43) transitions.
[2023-03-11 07:00:19] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-11 07:00:19] [INFO ] Flow matrix only has 109 transitions (discarded 17 similar events)
// Phase 1: matrix 109 rows 45 cols
[2023-03-11 07:00:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:19] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/51 places, 126/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 45/51 places, 126/83 transitions.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 83/83 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 07:00:19] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 51 cols
[2023-03-11 07:00:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 07:00:19] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:19] [INFO ] Invariant cache hit.
[2023-03-11 07:00:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 07:00:19] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:00:19] [INFO ] Invariant cache hit.
[2023-03-11 07:00:20] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 51/51 places, 83/83 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-14 finished in 3382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 109
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 58 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 55 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 52 transition count 90
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 52 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 51 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 51 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 59 place count 51 transition count 79
Applied a total of 59 rules in 3 ms. Remains 51 /74 variables (removed 23) and now considering 79/140 (removed 61) transitions.
[2023-03-11 07:00:20] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2023-03-11 07:00:20] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 07:00:20] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:20] [INFO ] Invariant cache hit.
[2023-03-11 07:00:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:20] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-11 07:00:20] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:20] [INFO ] Invariant cache hit.
[2023-03-11 07:00:20] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/74 places, 79/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 51/74 places, 79/140 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (NEQ s6 1) (NEQ s49 1)), p0:(EQ s30 0)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 57 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 626 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 679 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:00:21] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:21] [INFO ] Invariant cache hit.
[2023-03-11 07:00:21] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:00:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:00:21] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:21] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:00:21] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 07:00:21] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 79/79 transitions.
Graph (trivial) has 43 edges and 51 vertex of which 10 / 51 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 167 edges and 46 vertex of which 30 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 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 30 transition count 40
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 30 transition count 34
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 24 transition count 34
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 21 transition count 27
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 20 transition count 26
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 19 transition count 25
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 19 transition count 24
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 47 place count 18 transition count 23
Applied a total of 47 rules in 14 ms. Remains 18 /51 variables (removed 33) and now considering 23/79 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 18/51 places, 23/79 transitions.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 321 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:00:22] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 18 cols
[2023-03-11 07:00:22] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 07:00:22] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 07:00:22] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 07:00:22] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-11 07:00:22] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 620 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-11 07:00:23] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2023-03-11 07:00:23] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:00:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:00:23] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:23] [INFO ] Invariant cache hit.
[2023-03-11 07:00:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:23] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 07:00:23] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:23] [INFO ] Invariant cache hit.
[2023-03-11 07:00:23] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 51/51 places, 79/79 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 418 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 670 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:00:23] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:23] [INFO ] Invariant cache hit.
[2023-03-11 07:00:23] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 07:00:24] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:24] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:24] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 07:00:24] [INFO ] After 80ms 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 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 79/79 transitions.
Graph (trivial) has 46 edges and 51 vertex of which 10 / 51 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 167 edges and 46 vertex of which 30 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 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 30 transition count 40
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 30 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 24 transition count 34
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 21 transition count 27
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 20 transition count 26
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 19 transition count 25
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 19 transition count 24
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 2 with 4 rules applied. Total rules applied 49 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 15 transition count 21
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 15 transition count 17
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 3 with 2 rules applied. Total rules applied 57 place count 14 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 13 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 13 transition count 15
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 13 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 12 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 12 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 12 transition count 10
Applied a total of 66 rules in 20 ms. Remains 12 /51 variables (removed 39) and now considering 10/79 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 12/51 places, 10/79 transitions.
Finished random walk after 12 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 403 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 13 reset in 53 ms.
Product exploration explored 100000 steps with 4 reset in 58 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 79/79 transitions.
Graph (trivial) has 43 edges and 51 vertex of which 10 / 51 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 45 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 45 transition count 117
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 10 rules in 7 ms. Remains 45 /51 variables (removed 6) and now considering 117/79 (removed -38) transitions.
[2023-03-11 07:00:25] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 07:00:25] [INFO ] Flow matrix only has 101 transitions (discarded 16 similar events)
// Phase 1: matrix 101 rows 45 cols
[2023-03-11 07:00:25] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:25] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/51 places, 117/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 45/51 places, 117/79 transitions.
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-11 07:00:25] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2023-03-11 07:00:25] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 07:00:25] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:25] [INFO ] Invariant cache hit.
[2023-03-11 07:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:00:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-11 07:00:25] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:00:25] [INFO ] Invariant cache hit.
[2023-03-11 07:00:25] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 51/51 places, 79/79 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-15 finished in 5714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(p1))) U G(p2)))'
Found a Lengthening insensitive property : HealthRecord-PT-11-LTLFireability-09
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 82 edges and 74 vertex of which 10 / 74 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 54 transition count 107
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 107
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 54 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 50 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 50 transition count 94
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 50 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 49 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 49 transition count 88
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 3 with 2 rules applied. Total rules applied 49 place count 48 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 53 place count 46 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 54 place count 46 transition count 108
Applied a total of 54 rules in 14 ms. Remains 46 /74 variables (removed 28) and now considering 108/140 (removed 32) transitions.
[2023-03-11 07:00:26] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
// Phase 1: matrix 97 rows 46 cols
[2023-03-11 07:00:26] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:00:26] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
[2023-03-11 07:00:26] [INFO ] Invariant cache hit.
[2023-03-11 07:00:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-11 07:00:26] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-11 07:00:26] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
[2023-03-11 07:00:26] [INFO ] Invariant cache hit.
[2023-03-11 07:00:26] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/74 places, 108/140 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 220 ms. Remains : 46/74 places, 108/140 transitions.
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s5 1), p0:(EQ s34 1), p1:(OR (EQ s20 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 49 ms.
Product exploration explored 100000 steps with 12 reset in 62 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 901 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1048 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44138 steps, run visited all 1 properties in 80 ms. (steps per millisecond=551 )
Probabilistic random walk after 44138 steps, saw 7806 distinct states, run finished after 80 ms. (steps per millisecond=551 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 22 factoid took 968 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-11 07:00:28] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
[2023-03-11 07:00:28] [INFO ] Invariant cache hit.
[2023-03-11 07:00:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 07:00:28] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
[2023-03-11 07:00:28] [INFO ] Invariant cache hit.
[2023-03-11 07:00:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-11 07:00:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-11 07:00:28] [INFO ] Flow matrix only has 97 transitions (discarded 11 similar events)
[2023-03-11 07:00:28] [INFO ] Invariant cache hit.
[2023-03-11 07:00:28] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 46/46 places, 108/108 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1046 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44138 steps, run visited all 1 properties in 76 ms. (steps per millisecond=580 )
Probabilistic random walk after 44138 steps, saw 7806 distinct states, run finished after 77 ms. (steps per millisecond=573 ) properties seen :1
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 5 reset in 90 ms.
Product exploration explored 100000 steps with 10 reset in 103 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 43 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 43 transition count 92
Applied a total of 12 rules in 11 ms. Remains 43 /46 variables (removed 3) and now considering 92/108 (removed 16) transitions.
[2023-03-11 07:00:30] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 07:00:30] [INFO ] Flow matrix only has 82 transitions (discarded 10 similar events)
// Phase 1: matrix 82 rows 43 cols
[2023-03-11 07:00:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:30] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/46 places, 92/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 43/46 places, 92/108 transitions.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 43 transition count 93
Applied a total of 11 rules in 5 ms. Remains 43 /46 variables (removed 3) and now considering 93/108 (removed 15) transitions.
[2023-03-11 07:00:30] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 43 cols
[2023-03-11 07:00:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 07:00:30] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:30] [INFO ] Invariant cache hit.
[2023-03-11 07:00:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:00:30] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-11 07:00:30] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:30] [INFO ] Invariant cache hit.
[2023-03-11 07:00:30] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 93/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 43/46 places, 93/108 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-09 finished in 5058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&G((X(G(p1))||F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : HealthRecord-PT-11-LTLFireability-14
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 86 edges and 74 vertex of which 10 / 74 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 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 52 transition count 103
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 52 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 52 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 48 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 48 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 48 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 46 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 46 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 46 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 45 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 45 transition count 76
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 60 place count 44 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 42 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 42 transition count 93
Applied a total of 65 rules in 29 ms. Remains 42 /74 variables (removed 32) and now considering 93/140 (removed 47) transitions.
[2023-03-11 07:00:31] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 42 cols
[2023-03-11 07:00:31] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:31] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-11 07:00:31] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:31] [INFO ] Invariant cache hit.
[2023-03-11 07:00:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:00:31] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-11 07:00:31] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:31] [INFO ] Invariant cache hit.
[2023-03-11 07:00:31] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/74 places, 93/140 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 420 ms. Remains : 42/74 places, 93/140 transitions.
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s32 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 87 ms.
Product exploration explored 100000 steps with 7 reset in 106 ms.
Computed a total of 14 stabilizing places and 33 stable transitions
Computed a total of 14 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6813 steps, including 710 resets, run visited all 1 properties in 16 ms. (steps per millisecond=425 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 93/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-11 07:00:32] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:32] [INFO ] Invariant cache hit.
[2023-03-11 07:00:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 07:00:32] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:32] [INFO ] Invariant cache hit.
[2023-03-11 07:00:33] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:00:33] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-11 07:00:33] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:33] [INFO ] Invariant cache hit.
[2023-03-11 07:00:33] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 42/42 places, 93/93 transitions.
Computed a total of 14 stabilizing places and 33 stable transitions
Computed a total of 14 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1039 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5776 steps, run visited all 1 properties in 14 ms. (steps per millisecond=412 )
Probabilistic random walk after 5776 steps, saw 1377 distinct states, run finished after 15 ms. (steps per millisecond=385 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 92 ms.
Product exploration explored 100000 steps with 4 reset in 104 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 93/93 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 92
Applied a total of 1 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 92/93 (removed 1) transitions.
[2023-03-11 07:00:35] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 82 transitions (discarded 10 similar events)
// Phase 1: matrix 82 rows 42 cols
[2023-03-11 07:00:35] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:35] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/42 places, 92/93 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 42/42 places, 92/93 transitions.
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 93/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 42 cols
[2023-03-11 07:00:35] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:35] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:35] [INFO ] Invariant cache hit.
[2023-03-11 07:00:35] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:00:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
[2023-03-11 07:00:35] [INFO ] Invariant cache hit.
[2023-03-11 07:00:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 42/42 places, 93/93 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-14 finished in 4654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Found a Lengthening insensitive property : HealthRecord-PT-11-LTLFireability-15
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 140/140 transitions.
Graph (trivial) has 80 edges and 74 vertex of which 10 / 74 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.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 54 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 54 transition count 106
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 54 transition count 102
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 50 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 50 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 47 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 47 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 47 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 46 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 46 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 46 transition count 73
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 63 place count 45 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 75 place count 39 transition count 106
Applied a total of 75 rules in 11 ms. Remains 39 /74 variables (removed 35) and now considering 106/140 (removed 34) transitions.
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
// Phase 1: matrix 90 rows 39 cols
[2023-03-11 07:00:35] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 07:00:35] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:35] [INFO ] Invariant cache hit.
[2023-03-11 07:00:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 07:00:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 07:00:36] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:36] [INFO ] Invariant cache hit.
[2023-03-11 07:00:36] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 39/74 places, 106/140 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 207 ms. Remains : 39/74 places, 106/140 transitions.
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (NEQ s5 1) (NEQ s37 1)), p0:(EQ s22 0)], 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 50 ms.
Product exploration explored 100000 steps with 10 reset in 61 ms.
Computed a total of 21 stabilizing places and 53 stable transitions
Computed a total of 21 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 482 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1569 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 254 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 353 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:00:37] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:37] [INFO ] Invariant cache hit.
[2023-03-11 07:00:37] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:00:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:00:37] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:00:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 07:00:37] [INFO ] After 36ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 07:00:37] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 07:00:37] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 106/106 transitions.
Graph (complete) has 161 edges and 39 vertex of which 24 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 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 24 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 24 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 23 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 20 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 20 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 34 place count 20 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 19 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 19 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 18 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 18 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 18 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 18 transition count 50
Applied a total of 41 rules in 7 ms. Remains 18 /39 variables (removed 21) and now considering 50/106 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 18/39 places, 50/106 transitions.
Finished random walk after 7317 steps, including 1224 resets, run visited all 2 properties in 104 ms. (steps per millisecond=70 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 731 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 106/106 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-11 07:00:38] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:38] [INFO ] Invariant cache hit.
[2023-03-11 07:00:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 07:00:38] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:38] [INFO ] Invariant cache hit.
[2023-03-11 07:00:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 07:00:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-11 07:00:38] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:38] [INFO ] Invariant cache hit.
[2023-03-11 07:00:38] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 39/39 places, 106/106 transitions.
Computed a total of 21 stabilizing places and 53 stable transitions
Computed a total of 21 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 1588 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 239 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:00:39] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:39] [INFO ] Invariant cache hit.
[2023-03-11 07:00:39] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:00:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 07:00:39] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 07:00:39] [INFO ] After 8ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:00:39] [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 6 ms.
[2023-03-11 07:00:39] [INFO ] After 80ms 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 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 106/106 transitions.
Graph (complete) has 161 edges and 39 vertex of which 24 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 24 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 24 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 23 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 20 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 20 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 34 place count 20 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 19 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 19 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 18 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 18 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 18 transition count 50
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 3 with 2 rules applied. Total rules applied 42 place count 17 transition count 49
Applied a total of 42 rules in 8 ms. Remains 17 /39 variables (removed 22) and now considering 49/106 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 17/39 places, 49/106 transitions.
Incomplete random walk after 10000 steps, including 2144 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 355 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 310 steps, run visited all 1 properties in 4 ms. (steps per millisecond=77 )
Probabilistic random walk after 310 steps, saw 143 distinct states, run finished after 4 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 58 ms.
Product exploration explored 100000 steps with 7 reset in 59 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 106/106 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 105
Applied a total of 1 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 105/106 (removed 1) transitions.
[2023-03-11 07:00:41] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 07:00:41] [INFO ] Flow matrix only has 89 transitions (discarded 16 similar events)
// Phase 1: matrix 89 rows 39 cols
[2023-03-11 07:00:41] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:00:41] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 105/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 39/39 places, 105/106 transitions.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 106/106 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-11 07:00:41] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
// Phase 1: matrix 90 rows 39 cols
[2023-03-11 07:00:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:00:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 07:00:41] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:41] [INFO ] Invariant cache hit.
[2023-03-11 07:00:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 07:00:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-11 07:00:41] [INFO ] Flow matrix only has 90 transitions (discarded 16 similar events)
[2023-03-11 07:00:41] [INFO ] Invariant cache hit.
[2023-03-11 07:00:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 39/39 places, 106/106 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-15 finished in 5828 ms.
[2023-03-11 07:00:41] [INFO ] Flatten gal took : 12 ms
[2023-03-11 07:00:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 07:00:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 140 transitions and 446 arcs took 2 ms.
Total runtime 55780 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-11
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA HealthRecord-PT-11-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-11-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-11-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-11-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-11-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678518044312

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-11-LTLFireability-06
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-11-LTLFireability-06
lola: result : false
lola: markings : 332
lola: fired transitions : 583
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 HealthRecord-PT-11-LTLFireability-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for HealthRecord-PT-11-LTLFireability-11
lola: result : false
lola: markings : 200
lola: fired transitions : 433
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 HealthRecord-PT-11-LTLFireability-15
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for HealthRecord-PT-11-LTLFireability-15
lola: result : false
lola: markings : 92028
lola: fired transitions : 645451
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 HealthRecord-PT-11-LTLFireability-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for HealthRecord-PT-11-LTLFireability-14
lola: result : false
lola: markings : 1297
lola: fired transitions : 5086
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 HealthRecord-PT-11-LTLFireability-09
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HealthRecord-PT-11-LTLFireability-09
lola: result : false
lola: markings : 102923
lola: fired transitions : 728242
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-11-LTLFireability-06: LTL false LTL model checker
HealthRecord-PT-11-LTLFireability-09: LTL false LTL model checker
HealthRecord-PT-11-LTLFireability-11: LTL false LTL model checker
HealthRecord-PT-11-LTLFireability-14: LTL false LTL model checker
HealthRecord-PT-11-LTLFireability-15: LTL false LTL model checker


Time elapsed: 2 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-11, 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 r199-smll-167840345800316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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