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-167840345800324.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 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.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 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 71K 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-12-LTLFireability-00
FORMULA_NAME HealthRecord-PT-12-LTLFireability-01
FORMULA_NAME HealthRecord-PT-12-LTLFireability-02
FORMULA_NAME HealthRecord-PT-12-LTLFireability-03
FORMULA_NAME HealthRecord-PT-12-LTLFireability-04
FORMULA_NAME HealthRecord-PT-12-LTLFireability-05
FORMULA_NAME HealthRecord-PT-12-LTLFireability-06
FORMULA_NAME HealthRecord-PT-12-LTLFireability-07
FORMULA_NAME HealthRecord-PT-12-LTLFireability-08
FORMULA_NAME HealthRecord-PT-12-LTLFireability-09
FORMULA_NAME HealthRecord-PT-12-LTLFireability-10
FORMULA_NAME HealthRecord-PT-12-LTLFireability-11
FORMULA_NAME HealthRecord-PT-12-LTLFireability-12
FORMULA_NAME HealthRecord-PT-12-LTLFireability-13
FORMULA_NAME HealthRecord-PT-12-LTLFireability-14
FORMULA_NAME HealthRecord-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678518857024

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-12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 07:14:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 07:14:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:14:20] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-11 07:14:20] [INFO ] Transformed 160 places.
[2023-03-11 07:14:20] [INFO ] Transformed 340 transitions.
[2023-03-11 07:14:20] [INFO ] Found NUPN structural information;
[2023-03-11 07:14:20] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 80 transition count 160
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 80 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 165 place count 75 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 170 place count 75 transition count 150
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 75 transition count 145
Applied a total of 175 rules in 35 ms. Remains 75 /160 variables (removed 85) and now considering 145/312 (removed 167) transitions.
[2023-03-11 07:14:21] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
// Phase 1: matrix 141 rows 75 cols
[2023-03-11 07:14:21] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-11 07:14:21] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-11 07:14:21] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 07:14:21] [INFO ] Invariant cache hit.
[2023-03-11 07:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:21] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-11 07:14:21] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 07:14:21] [INFO ] Invariant cache hit.
[2023-03-11 07:14:21] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/160 places, 145/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 75/160 places, 145/312 transitions.
Support contains 28 out of 75 places after structural reductions.
[2023-03-11 07:14:22] [INFO ] Flatten gal took : 60 ms
[2023-03-11 07:14:22] [INFO ] Flatten gal took : 26 ms
[2023-03-11 07:14:22] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 27 out of 75 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 719 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 25) seen :13
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 07:14:23] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 07:14:23] [INFO ] Invariant cache hit.
[2023-03-11 07:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 07:14:23] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 07:14:24] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-11 07:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:24] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 07:14:24] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 07:14:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-11 07:14:24] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 07:14:24] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-11 07:14:24] [INFO ] After 119ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-03-11 07:14:24] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 14 ms to minimize.
[2023-03-11 07:14:24] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-03-11 07:14:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-03-11 07:14:25] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2023-03-11 07:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-11 07:14:25] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-11 07:14:25] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 61 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 303 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 70 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 131
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 16 place count 57 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 28 place count 57 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 57 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 55 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 55 transition count 99
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 41 place count 53 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 49 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 48 transition count 115
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 66 place count 48 transition count 115
Applied a total of 66 rules in 71 ms. Remains 48 /75 variables (removed 27) and now considering 115/145 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 48/75 places, 115/145 transitions.
Incomplete random walk after 10000 steps, including 619 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-11 07:14:25] [INFO ] Flow matrix only has 106 transitions (discarded 9 similar events)
// Phase 1: matrix 106 rows 48 cols
[2023-03-11 07:14:25] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-11 07:14:25] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 07:14:25] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 07:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 07:14:26] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:14:26] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:14:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:14:26] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:14:26] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:14:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2023-03-11 07:14:26] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-11 07:14:26] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-11 07:14:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2023-03-11 07:14:26] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 07:14:26] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 115/115 transitions.
Graph (complete) has 236 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 44 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 44 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 43 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 42 transition count 119
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 42 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 39 transition count 116
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 39 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 37 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 37 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 36 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 36 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 36 transition count 104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 36 transition count 102
Applied a total of 34 rules in 60 ms. Remains 36 /48 variables (removed 12) and now considering 102/115 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 36/48 places, 102/115 transitions.
Finished random walk after 2251 steps, including 137 resets, run visited all 1 properties in 10 ms. (steps per millisecond=225 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 6 stabilizing places and 9 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((G(F((!p0&&X((!p0 U (p1||G(!p0)))))))||(!p1&&F((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 52 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 52 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 51 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 51 transition count 86
Applied a total of 58 rules in 17 ms. Remains 51 /75 variables (removed 24) and now considering 86/145 (removed 59) transitions.
[2023-03-11 07:14:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2023-03-11 07:14:26] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:14:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 07:14:27] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:27] [INFO ] Invariant cache hit.
[2023-03-11 07:14:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 07:14:27] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:27] [INFO ] Invariant cache hit.
[2023-03-11 07:14:27] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/75 places, 86/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 51/75 places, 86/145 transitions.
Stuttering acceptance computed with spot in 485 ms :[p0, p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s49 1)), p0:(AND (EQ s33 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 3 reset in 282 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 417 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 728 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:14:29] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:29] [INFO ] Invariant cache hit.
[2023-03-11 07:14:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:14:29] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:14:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:14:29] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:14:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:29] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:14:29] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-11 07:14:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-11 07:14:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-11 07:14:29] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 07:14:29] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 86/86 transitions.
Graph (trivial) has 41 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 181 edges and 47 vertex of which 46 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 46 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 43 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 43 transition count 69
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 11 place count 42 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 37 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 37 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 34 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 34 transition count 99
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 43 place count 34 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 34 transition count 99
Applied a total of 44 rules in 62 ms. Remains 34 /51 variables (removed 17) and now considering 99/86 (removed -13) transitions.
[2023-03-11 07:14:30] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 34 cols
[2023-03-11 07:14:30] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-11 07:14:30] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 34/51 places, 99/86 transitions.
Incomplete random walk after 10000 steps, including 666 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1061 steps, run visited all 2 properties in 26 ms. (steps per millisecond=40 )
Probabilistic random walk after 1061 steps, saw 410 distinct states, run finished after 26 ms. (steps per millisecond=40 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 144 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-11 07:14:31] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2023-03-11 07:14:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:14:31] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:31] [INFO ] Invariant cache hit.
[2023-03-11 07:14:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:31] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 07:14:31] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:31] [INFO ] Invariant cache hit.
[2023-03-11 07:14:31] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 51/51 places, 86/86 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 732 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:14:32] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:32] [INFO ] Invariant cache hit.
[2023-03-11 07:14:32] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 07:14:32] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:14:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 07:14:32] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:32] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:14:32] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-11 07:14:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-11 07:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-11 07:14:32] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 07:14:32] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 86/86 transitions.
Graph (trivial) has 41 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 181 edges and 47 vertex of which 46 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 46 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 43 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 43 transition count 69
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 11 place count 42 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 37 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 37 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 34 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 34 transition count 99
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 43 place count 34 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 34 transition count 99
Applied a total of 44 rules in 51 ms. Remains 34 /51 variables (removed 17) and now considering 99/86 (removed -13) transitions.
[2023-03-11 07:14:32] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 34 cols
[2023-03-11 07:14:32] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:14:32] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 34/51 places, 99/86 transitions.
Incomplete random walk after 10000 steps, including 711 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1061 steps, run visited all 2 properties in 20 ms. (steps per millisecond=53 )
Probabilistic random walk after 1061 steps, saw 410 distinct states, run finished after 20 ms. (steps per millisecond=53 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 3 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-11 07:14:34] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2023-03-11 07:14:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 07:14:34] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:34] [INFO ] Invariant cache hit.
[2023-03-11 07:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-11 07:14:34] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 07:14:34] [INFO ] Invariant cache hit.
[2023-03-11 07:14:35] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 51/51 places, 86/86 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-00 finished in 8237 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(((G(p1) U p2)&&p0))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 59 transition count 113
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 54 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 52 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 55 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 51 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 51 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 51 transition count 84
Applied a total of 59 rules in 7 ms. Remains 51 /75 variables (removed 24) and now considering 84/145 (removed 61) transitions.
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 51 cols
[2023-03-11 07:14:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 07:14:35] [INFO ] Invariant cache hit.
[2023-03-11 07:14:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 07:14:35] [INFO ] Invariant cache hit.
[2023-03-11 07:14:35] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/75 places, 84/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 51/75 places, 84/145 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s8 0) (EQ s3 0)), p2:(EQ s8 1), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-02 finished in 516 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))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 transition count 99
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 53 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 51 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 51 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 55 place count 51 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 50 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 50 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 50 transition count 83
Applied a total of 60 rules in 8 ms. Remains 50 /75 variables (removed 25) and now considering 83/145 (removed 62) transitions.
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 50 cols
[2023-03-11 07:14:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:14:35] [INFO ] Invariant cache hit.
[2023-03-11 07:14:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:35] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 07:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 07:14:35] [INFO ] Invariant cache hit.
[2023-03-11 07:14:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 83/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 50/75 places, 83/145 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-03 finished in 382 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)&&G(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 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 35 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 51 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 58 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 50 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 63 place count 50 transition count 80
Applied a total of 63 rules in 9 ms. Remains 50 /75 variables (removed 25) and now considering 80/145 (removed 65) transitions.
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2023-03-11 07:14:36] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 07:14:36] [INFO ] Invariant cache hit.
[2023-03-11 07:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:36] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 07:14:36] [INFO ] Invariant cache hit.
[2023-03-11 07:14:36] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 80/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 50/75 places, 80/145 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s19 0), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-07 finished in 519 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 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 51 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 58 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 50 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 63 place count 50 transition count 80
Applied a total of 63 rules in 10 ms. Remains 50 /75 variables (removed 25) and now considering 80/145 (removed 65) transitions.
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2023-03-11 07:14:36] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 07:14:36] [INFO ] Invariant cache hit.
[2023-03-11 07:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:36] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 07:14:36] [INFO ] Invariant cache hit.
[2023-03-11 07:14:36] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 80/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 50/75 places, 80/145 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-08 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 s39 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 9 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-08 finished in 355 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 46 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 46 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 57 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 44 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 44 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 43 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 43 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 43 transition count 69
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 73 place count 41 transition count 83
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 41 transition count 82
Applied a total of 74 rules in 39 ms. Remains 41 /75 variables (removed 34) and now considering 82/145 (removed 63) transitions.
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 41 cols
[2023-03-11 07:14:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:14:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:14:36] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:36] [INFO ] Invariant cache hit.
[2023-03-11 07:14:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:14:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-11 07:14:37] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 07:14:37] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:37] [INFO ] Invariant cache hit.
[2023-03-11 07:14:37] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/75 places, 82/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 41/75 places, 82/145 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 333 ms.
Product exploration explored 100000 steps with 1 reset in 268 ms.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Detected a total of 12/41 stabilizing places and 25/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 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 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 952 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1663 steps, run visited all 1 properties in 10 ms. (steps per millisecond=166 )
Probabilistic random walk after 1663 steps, saw 603 distinct states, run finished after 10 ms. (steps per millisecond=166 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 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 40 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 4 ms. Remains 41 /41 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 07:14:38] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:38] [INFO ] Invariant cache hit.
[2023-03-11 07:14:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 07:14:38] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:38] [INFO ] Invariant cache hit.
[2023-03-11 07:14:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:14:38] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-11 07:14:38] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 07:14:38] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:38] [INFO ] Invariant cache hit.
[2023-03-11 07:14:38] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 41/41 places, 82/82 transitions.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Detected a total of 12/41 stabilizing places and 25/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 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 51 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 952 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1663 steps, run visited all 1 properties in 9 ms. (steps per millisecond=184 )
Probabilistic random walk after 1663 steps, saw 603 distinct states, run finished after 9 ms. (steps per millisecond=184 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 253 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 108 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 6 ms. Remains 41 /41 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 07:14:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:39] [INFO ] Invariant cache hit.
[2023-03-11 07:14:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 07:14:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:39] [INFO ] Invariant cache hit.
[2023-03-11 07:14:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:14:39] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-11 07:14:39] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 07:14:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 07:14:39] [INFO ] Invariant cache hit.
[2023-03-11 07:14:40] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 41/41 places, 82/82 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-09 finished in 3197 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 U X(p1))&&F(p2)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 53 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 53 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 53 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 51 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 50 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 50 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 62 place count 50 transition count 81
Applied a total of 62 rules in 7 ms. Remains 50 /75 variables (removed 25) and now considering 81/145 (removed 64) transitions.
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 50 cols
[2023-03-11 07:14:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:40] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 07:14:40] [INFO ] Invariant cache hit.
[2023-03-11 07:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:40] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 07:14:40] [INFO ] Invariant cache hit.
[2023-03-11 07:14:40] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 81/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 50/75 places, 81/145 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3 1), p2:(AND (EQ s12 1) (EQ s48 1)), p1:(AND (EQ s34 1) (EQ s38 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-10 finished in 532 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(p0)||X((G(p1)||G(p2)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 59 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 59 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 59 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 55 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 55 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 53 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 53 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 52 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 55 place count 52 transition count 89
Applied a total of 55 rules in 6 ms. Remains 52 /75 variables (removed 23) and now considering 89/145 (removed 56) transitions.
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:14:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:40] [INFO ] Invariant cache hit.
[2023-03-11 07:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-11 07:14:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:40] [INFO ] Invariant cache hit.
[2023-03-11 07:14:40] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/75 places, 89/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 52/75 places, 89/145 transitions.
Stuttering acceptance computed with spot in 531 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(EQ s11 0), p2:(NEQ s17 1), p1:(OR (EQ s3 0) (EQ s7 0) (EQ s12 0) (EQ s41 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 259 ms.
Product exploration explored 100000 steps with 2 reset in 244 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 2133 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter sensitive) to 9 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 721 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-11 07:14:45] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:45] [INFO ] Invariant cache hit.
[2023-03-11 07:14:45] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-11 07:14:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:14:45] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-11 07:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:45] [INFO ] After 122ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :13
[2023-03-11 07:14:45] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-11 07:14:45] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 183 edges and 48 vertex of which 33 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 33 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 33 transition count 48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 26 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 25 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 24 transition count 39
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 24 transition count 38
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 46 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 18 transition count 34
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 18 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 18 transition count 29
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 58 place count 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 16 transition count 25
Applied a total of 63 rules in 11 ms. Remains 16 /52 variables (removed 36) and now considering 25/89 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 16/52 places, 25/89 transitions.
Incomplete random walk after 10000 steps, including 678 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 711 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 714 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 25 rows 16 cols
[2023-03-11 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:14:46] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:14:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:14:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:14:46] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 07:14:46] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p0 p1))), (F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (AND p2 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 p0 p1))), (F (AND (NOT p2) p0 p1)), (F (NOT (AND p2 p0))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 40 factoid took 2963 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 417 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-11 07:14:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:14:50] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 07:14:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:50] [INFO ] Invariant cache hit.
[2023-03-11 07:14:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-11 07:14:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:50] [INFO ] Invariant cache hit.
[2023-03-11 07:14:50] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 52/52 places, 89/89 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1470 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 723 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :3
Running SMT prover for 4 properties.
[2023-03-11 07:14:52] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:52] [INFO ] Invariant cache hit.
[2023-03-11 07:14:52] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:14:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-11 07:14:53] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:53] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:14:53] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 07:14:53] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 183 edges and 48 vertex of which 33 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 33 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 33 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 26 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 25 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 24 transition count 39
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 24 transition count 38
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 46 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 18 transition count 34
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 18 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 18 transition count 29
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 58 place count 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 16 transition count 25
Applied a total of 63 rules in 13 ms. Remains 16 /52 variables (removed 36) and now considering 25/89 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 16/52 places, 25/89 transitions.
Incomplete random walk after 10000 steps, including 708 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 714 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 16 cols
[2023-03-11 07:14:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:14:53] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:14:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:14:53] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:14:53] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 07:14:53] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p0 p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 20 factoid took 1771 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 383 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 597 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Applying partial POR strategy [true, false, true, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 400 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 4 place count 47 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 47 transition count 108
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 8 rules in 15 ms. Remains 47 /52 variables (removed 5) and now considering 108/89 (removed -19) transitions.
[2023-03-11 07:14:57] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:14:57] [INFO ] Flow matrix only has 94 transitions (discarded 14 similar events)
// Phase 1: matrix 94 rows 47 cols
[2023-03-11 07:14:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:57] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 108/89 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 47/52 places, 108/89 transitions.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-11 07:14:57] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:14:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 07:14:57] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:57] [INFO ] Invariant cache hit.
[2023-03-11 07:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:57] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-11 07:14:57] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:14:57] [INFO ] Invariant cache hit.
[2023-03-11 07:14:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 52/52 places, 89/89 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 17408 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||G(p1)))&&F(p2))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 6 / 75 are part of one of the 3 SCC in 0 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 53 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 53 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 53 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 49 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 48 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 47 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 47 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 60 place count 47 transition count 81
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 3 with 4 rules applied. Total rules applied 64 place count 45 transition count 96
Applied a total of 64 rules in 20 ms. Remains 45 /75 variables (removed 30) and now considering 96/145 (removed 49) transitions.
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 45 cols
[2023-03-11 07:14:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2023-03-11 07:14:58] [INFO ] Invariant cache hit.
[2023-03-11 07:14:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:14:58] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 07:14:58] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2023-03-11 07:14:58] [INFO ] Invariant cache hit.
[2023-03-11 07:14:58] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/75 places, 96/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 45/75 places, 96/145 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s13 1), p2:(EQ s9 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 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-12 finished in 484 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 U p1)&&X((p2 U X(!p1)))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 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 35 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 54 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 54 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 54 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 53 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 53 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 53 transition count 90
Applied a total of 54 rules in 7 ms. Remains 53 /75 variables (removed 22) and now considering 90/145 (removed 55) transitions.
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 53 cols
[2023-03-11 07:14:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2023-03-11 07:14:58] [INFO ] Invariant cache hit.
[2023-03-11 07:14:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:14:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 07:14:58] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2023-03-11 07:14:58] [INFO ] Invariant cache hit.
[2023-03-11 07:14:58] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 90/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 53/75 places, 90/145 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, true, (NOT p1), p1, p1, p1]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(OR p1 p0 p2), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 3}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s4 1), p2:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-13 finished in 613 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 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 47 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 47 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 46 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 46 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 45 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 45 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 62 place count 45 transition count 78
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 3 with 4 rules applied. Total rules applied 66 place count 43 transition count 97
Applied a total of 66 rules in 18 ms. Remains 43 /75 variables (removed 32) and now considering 97/145 (removed 48) transitions.
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
// Phase 1: matrix 88 rows 43 cols
[2023-03-11 07:14:59] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:14:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:14:59] [INFO ] Invariant cache hit.
[2023-03-11 07:14:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:14:59] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-11 07:14:59] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 07:14:59] [INFO ] Invariant cache hit.
[2023-03-11 07:14:59] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/75 places, 97/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 43/75 places, 97/145 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-14 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 s26 1) (EQ s30 1) (EQ s33 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 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-14 finished in 380 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 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 87 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 46 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 46 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 44 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 44 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 64 place count 44 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 43 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 43 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 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 73 place count 41 transition count 84
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 41 transition count 83
Applied a total of 74 rules in 19 ms. Remains 41 /75 variables (removed 34) and now considering 83/145 (removed 62) transitions.
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 41 cols
[2023-03-11 07:14:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:14:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:14:59] [INFO ] Invariant cache hit.
[2023-03-11 07:14:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:14:59] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-11 07:14:59] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 07:14:59] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:14:59] [INFO ] Invariant cache hit.
[2023-03-11 07:14:59] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/75 places, 83/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 41/75 places, 83/145 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-15 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:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3099 steps, including 293 resets, run visited all 1 properties in 8 ms. (steps per millisecond=387 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 07:15:00] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:00] [INFO ] Invariant cache hit.
[2023-03-11 07:15:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 07:15:00] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:00] [INFO ] Invariant cache hit.
[2023-03-11 07:15:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:15:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 07:15:00] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 07:15:00] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:00] [INFO ] Invariant cache hit.
[2023-03-11 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 41/41 places, 83/83 transitions.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 996 steps, including 89 resets, run visited all 1 properties in 3 ms. (steps per millisecond=332 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 07:15:01] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:01] [INFO ] Invariant cache hit.
[2023-03-11 07:15:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 07:15:02] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:02] [INFO ] Invariant cache hit.
[2023-03-11 07:15:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 07:15:02] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 07:15:02] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 07:15:02] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 07:15:02] [INFO ] Invariant cache hit.
[2023-03-11 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 41/41 places, 83/83 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-15 finished in 2792 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((G(F((!p0&&X((!p0 U (p1||G(!p0)))))))||(!p1&&F((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Found a Shortening insensitive property : HealthRecord-PT-12-LTLFireability-00
Stuttering acceptance computed with spot in 198 ms :[p0, p0, (AND (NOT p1) p0), p0]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 75 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 47 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 47 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 46 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 46 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 45 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 45 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 62 place count 45 transition count 78
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 3 with 4 rules applied. Total rules applied 66 place count 43 transition count 97
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 43 transition count 96
Applied a total of 67 rules in 19 ms. Remains 43 /75 variables (removed 32) and now considering 96/145 (removed 49) transitions.
[2023-03-11 07:15:02] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 43 cols
[2023-03-11 07:15:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:15:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 07:15:02] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:02] [INFO ] Invariant cache hit.
[2023-03-11 07:15:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:15:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-11 07:15:02] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:02] [INFO ] Invariant cache hit.
[2023-03-11 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 43/75 places, 96/145 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 269 ms. Remains : 43/75 places, 96/145 transitions.
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s22 1) (EQ s41 1)), p0:(AND (EQ s26 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Product exploration explored 100000 steps with 2 reset in 241 ms.
Computed a total of 11 stabilizing places and 30 stable transitions
Computed a total of 11 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 951 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:15:04] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:04] [INFO ] Invariant cache hit.
[2023-03-11 07:15:04] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:15:04] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:15:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:15:04] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:15:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:15:04] [INFO ] After 21ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:15:04] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 07:15:04] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 96/96 transitions.
Graph (complete) has 160 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 8 place count 42 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 41 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 40 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 86
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 13 place count 39 transition count 86
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 22 place count 39 transition count 77
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 31 place count 30 transition count 77
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 30 transition count 75
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 46 place count 30 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 30 transition count 75
Applied a total of 47 rules in 14 ms. Remains 30 /43 variables (removed 13) and now considering 75/96 (removed 21) transitions.
[2023-03-11 07:15:04] [INFO ] Flow matrix only has 62 transitions (discarded 13 similar events)
// Phase 1: matrix 62 rows 30 cols
[2023-03-11 07:15:04] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:15:04] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 30/43 places, 75/96 transitions.
Incomplete random walk after 10000 steps, including 658 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished Best-First random walk after 9189 steps, including 170 resets, run visited all 2 properties in 25 ms. (steps per millisecond=367 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 481 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 96/96 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-11 07:15:05] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 43 cols
[2023-03-11 07:15:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:15:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 07:15:05] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:05] [INFO ] Invariant cache hit.
[2023-03-11 07:15:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:15:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-11 07:15:05] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:05] [INFO ] Invariant cache hit.
[2023-03-11 07:15:05] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 43/43 places, 96/96 transitions.
Computed a total of 11 stabilizing places and 30 stable transitions
Computed a total of 11 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 325 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 944 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:15:06] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:06] [INFO ] Invariant cache hit.
[2023-03-11 07:15:06] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:15:06] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:15:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:15:06] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:15:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:15:06] [INFO ] After 25ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:15:06] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 07:15:06] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 96/96 transitions.
Graph (complete) has 160 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 8 place count 42 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 41 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 40 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 86
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 13 place count 39 transition count 86
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 22 place count 39 transition count 77
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 31 place count 30 transition count 77
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 30 transition count 75
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 46 place count 30 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 30 transition count 75
Applied a total of 47 rules in 17 ms. Remains 30 /43 variables (removed 13) and now considering 75/96 (removed 21) transitions.
[2023-03-11 07:15:06] [INFO ] Flow matrix only has 62 transitions (discarded 13 similar events)
// Phase 1: matrix 62 rows 30 cols
[2023-03-11 07:15:06] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:15:06] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30/43 places, 75/96 transitions.
Finished random walk after 603 steps, including 37 resets, run visited all 2 properties in 8 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 424 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 146 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 1 reset in 136 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-11 07:15:07] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 43 cols
[2023-03-11 07:15:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:15:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 07:15:08] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:08] [INFO ] Invariant cache hit.
[2023-03-11 07:15:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 07:15:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 07:15:08] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2023-03-11 07:15:08] [INFO ] Invariant cache hit.
[2023-03-11 07:15:08] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 43/43 places, 96/96 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-00 finished in 6001 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' '!((G(p0)||X((G(p1)||G(p2)))))'
Found a Lengthening insensitive property : HealthRecord-PT-12-LTLFireability-11
Stuttering acceptance computed with spot in 393 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 71 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 53 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 49 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 49 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 49 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 47 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 47 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 46 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 46 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 46 transition count 81
Applied a total of 59 rules in 16 ms. Remains 46 /75 variables (removed 29) and now considering 81/145 (removed 64) transitions.
[2023-03-11 07:15:08] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 46 cols
[2023-03-11 07:15:08] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:15:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 07:15:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:09] [INFO ] Invariant cache hit.
[2023-03-11 07:15:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-11 07:15:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:09] [INFO ] Invariant cache hit.
[2023-03-11 07:15:09] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/75 places, 81/145 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 266 ms. Remains : 46/75 places, 81/145 transitions.
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(EQ s10 0), p2:(NEQ s15 1), p1:(OR (EQ s2 0) (EQ s6 0) (EQ s11 0) (EQ s36 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 281 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 2129 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter sensitive) to 9 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 919 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-11 07:15:12] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:12] [INFO ] Invariant cache hit.
[2023-03-11 07:15:12] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-11 07:15:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:15:13] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-11 07:15:13] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-11 07:15:13] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 81/81 transitions.
Graph (complete) has 162 edges and 46 vertex of which 32 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 32 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 24 place count 32 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 24 transition count 47
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 11 edges and 24 vertex of which 3 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 43 place count 22 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 22 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 22 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 19 transition count 35
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 54 place count 18 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 17 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 17 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 17 transition count 32
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 59 place count 16 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 16 transition count 30
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 16 transition count 25
Applied a total of 66 rules in 16 ms. Remains 16 /46 variables (removed 30) and now considering 25/81 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 16/46 places, 25/81 transitions.
Finished random walk after 8151 steps, including 594 resets, run visited all 13 properties in 148 ms. (steps per millisecond=55 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p0 p1))), (F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (AND p2 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 p0 p1))), (F (AND (NOT p2) p0 p1)), (F (NOT (AND p2 p0))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 40 factoid took 2979 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 295 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-11 07:15:17] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:17] [INFO ] Invariant cache hit.
[2023-03-11 07:15:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:15:17] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:17] [INFO ] Invariant cache hit.
[2023-03-11 07:15:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-11 07:15:17] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:17] [INFO ] Invariant cache hit.
[2023-03-11 07:15:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 46/46 places, 81/81 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1499 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 931 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:15:19] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:19] [INFO ] Invariant cache hit.
[2023-03-11 07:15:19] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:15:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:15:20] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:15:20] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 07:15:20] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 81/81 transitions.
Graph (complete) has 162 edges and 46 vertex of which 32 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 32 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 24 place count 32 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 24 transition count 47
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 11 edges and 24 vertex of which 3 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 43 place count 22 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 22 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 22 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 19 transition count 35
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 54 place count 18 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 17 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 17 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 17 transition count 32
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 59 place count 16 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 16 transition count 30
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 16 transition count 25
Applied a total of 66 rules in 25 ms. Remains 16 /46 variables (removed 30) and now considering 25/81 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 16/46 places, 25/81 transitions.
Incomplete random walk after 10000 steps, including 740 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 711 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 16 cols
[2023-03-11 07:15:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 07:15:20] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:15:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:15:20] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:15:20] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 07:15:20] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 25/25 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 24
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 15 transition count 23
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 15 transition count 22
Applied a total of 4 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 22/25 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 15/16 places, 22/25 transitions.
Incomplete random walk after 10000 steps, including 640 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 8 ms. (steps per millisecond=13 )
Probabilistic random walk after 110 steps, saw 77 distinct states, run finished after 9 ms. (steps per millisecond=12 ) properties seen :1
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p0 p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 20 factoid took 2046 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 437 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 436 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 220 ms.
Product exploration explored 100000 steps with 2 reset in 240 ms.
Applying partial POR strategy [true, false, true, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 442 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-11 07:15:24] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 07:15:24] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 46 cols
[2023-03-11 07:15:24] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:15:24] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 46/46 places, 81/81 transitions.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-11 07:15:24] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:25] [INFO ] Invariant cache hit.
[2023-03-11 07:15:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:15:25] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:25] [INFO ] Invariant cache hit.
[2023-03-11 07:15:25] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 07:15:25] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2023-03-11 07:15:25] [INFO ] Invariant cache hit.
[2023-03-11 07:15:25] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 46/46 places, 81/81 transitions.
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 16871 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)))'
[2023-03-11 07:15:25] [INFO ] Flatten gal took : 23 ms
[2023-03-11 07:15:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-11 07:15:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 145 transitions and 464 arcs took 3 ms.
Total runtime 64826 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-12
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

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

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

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

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

BK_STOP 1678518938904

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/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: LAUNCH task # 4 (type EXCL) for 3 HealthRecord-PT-12-LTLFireability-09
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HealthRecord-PT-12-LTLFireability-09
lola: result : false
lola: markings : 92
lola: fired transitions : 131
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-12-LTLFireability-00
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-12-LTLFireability-00
lola: result : false
lola: markings : 130215
lola: fired transitions : 946594
lola: time used : 2.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 HealthRecord-PT-12-LTLFireability-11
lola: time limit : 1798 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-12-LTLFireability-00: LTL false LTL model checker
HealthRecord-PT-12-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HealthRecord-PT-12-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
HealthRecord-PT-12-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 3/1798 2/32 HealthRecord-PT-12-LTLFireability-11 254679 m, 50935 m/sec, 2226685 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-12-LTLFireability-00: LTL false LTL model checker
HealthRecord-PT-12-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HealthRecord-PT-12-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
HealthRecord-PT-12-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 8/1798 5/32 HealthRecord-PT-12-LTLFireability-11 754533 m, 99970 m/sec, 6679348 t fired, .

Time elapsed: 11 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 7 (type EXCL) for HealthRecord-PT-12-LTLFireability-11
lola: result : false
lola: markings : 937230
lola: fired transitions : 8244804
lola: time used : 9.000000
lola: memory pages used : 7
lola: LAUNCH task # 10 (type EXCL) for 9 HealthRecord-PT-12-LTLFireability-15
lola: time limit : 3588 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for HealthRecord-PT-12-LTLFireability-15
lola: result : false
lola: markings : 675
lola: fired transitions : 1289
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

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


Time elapsed: 12 secs. Pages in use: 7

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

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