Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 5.6K Apr 30 11:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652694147229

Running Version 202205111006
[2022-05-16 09:42:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:42:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:42:29] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2022-05-16 09:42:29] [INFO ] Transformed 157 places.
[2022-05-16 09:42:29] [INFO ] Transformed 327 transitions.
[2022-05-16 09:42:29] [INFO ] Found NUPN structural information;
[2022-05-16 09:42:29] [INFO ] Parsed PT model containing 157 places and 327 transitions in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 83 transition count 161
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 83 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 151 place count 80 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 154 place count 80 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 157 place count 80 transition count 152
Applied a total of 157 rules in 42 ms. Remains 80 /157 variables (removed 77) and now considering 152/301 (removed 149) transitions.
[2022-05-16 09:42:30] [INFO ] Flow matrix only has 148 transitions (discarded 4 similar events)
// Phase 1: matrix 148 rows 80 cols
[2022-05-16 09:42:30] [INFO ] Computed 10 place invariants in 19 ms
[2022-05-16 09:42:30] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-05-16 09:42:30] [INFO ] Flow matrix only has 148 transitions (discarded 4 similar events)
// Phase 1: matrix 148 rows 80 cols
[2022-05-16 09:42:30] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 09:42:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-16 09:42:30] [INFO ] Flow matrix only has 148 transitions (discarded 4 similar events)
// Phase 1: matrix 148 rows 80 cols
[2022-05-16 09:42:30] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 09:42:30] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/157 places, 152/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/157 places, 152/301 transitions.
Support contains 28 out of 80 places after structural reductions.
[2022-05-16 09:42:31] [INFO ] Flatten gal took : 67 ms
[2022-05-16 09:42:31] [INFO ] Flatten gal took : 29 ms
[2022-05-16 09:42:31] [INFO ] Input system was already deterministic with 152 transitions.
Incomplete random walk after 10000 steps, including 594 resets, run finished after 1156 ms. (steps per millisecond=8 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :2
Running SMT prover for 9 properties.
[2022-05-16 09:42:33] [INFO ] Flow matrix only has 148 transitions (discarded 4 similar events)
// Phase 1: matrix 148 rows 80 cols
[2022-05-16 09:42:33] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 09:42:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 09:42:33] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:42:33] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-16 09:42:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-16 09:42:33] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:42:34] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2022-05-16 09:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:34] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2022-05-16 09:42:34] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 9 ms to minimize.
[2022-05-16 09:42:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-16 09:42:34] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-05-16 09:42:34] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 75 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 300 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 132
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 70 transition count 129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 70 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 65 transition count 126
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 29 place count 55 transition count 107
Iterating global reduction 2 with 10 rules applied. Total rules applied 39 place count 55 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 55 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 52 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 52 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 52 place count 52 transition count 94
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 4 with 4 rules applied. Total rules applied 56 place count 50 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 64 place count 46 transition count 121
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 46 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 46 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 45 transition count 118
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 84 place count 45 transition count 118
Applied a total of 84 rules in 63 ms. Remains 45 /80 variables (removed 35) and now considering 118/152 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/80 places, 118/152 transitions.
Incomplete random walk after 10000 steps, including 2965 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 386 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 371 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 367 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 380 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 387 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 367 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-16 09:42:35] [INFO ] Flow matrix only has 115 transitions (discarded 3 similar events)
// Phase 1: matrix 115 rows 45 cols
[2022-05-16 09:42:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 09:42:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:35] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 09:42:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:35] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 09:42:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:42:35] [INFO ] After 56ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-16 09:42:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2022-05-16 09:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-16 09:42:36] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-05-16 09:42:36] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 45 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 45/45 places, 118/118 transitions.
Graph (complete) has 219 edges and 45 vertex of which 37 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 37 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 36 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 36 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 36 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 35 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 35 transition count 86
Applied a total of 31 rules in 18 ms. Remains 35 /45 variables (removed 10) and now considering 86/118 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/45 places, 86/118 transitions.
Incomplete random walk after 10000 steps, including 2688 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 416 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 410 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 86 rows 35 cols
[2022-05-16 09:42:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 09:42:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:42:36] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 09:42:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:42:36] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 09:42:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:42:36] [INFO ] After 18ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 09:42:36] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-16 09:42:36] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 43 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 3 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA HealthRecord-PT-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 12 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1)) U ((p2 U p3)&&X(p3))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 64 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 64 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 60 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 60 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 60 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 57 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 54 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 54 transition count 96
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 63 place count 54 transition count 87
Applied a total of 63 rules in 14 ms. Remains 54 /80 variables (removed 26) and now considering 87/152 (removed 65) transitions.
[2022-05-16 09:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-05-16 09:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:37] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:42:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:37] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-16 09:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:37] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 87/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/80 places, 87/152 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p3), p1, (NOT p3), true]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s8 1), p2:(EQ s39 1), p0:(OR (NEQ s43 1) (EQ s33 1)), p1:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 4 reset in 4 ms.
FORMULA HealthRecord-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-00 finished in 833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p0) U G(p0))&&X(F(X(p1)))) U p2)))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 62 transition count 117
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 62 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 57 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 57 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 56 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 55 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 55 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 59 place count 55 transition count 93
Applied a total of 59 rules in 13 ms. Remains 55 /80 variables (removed 25) and now considering 93/152 (removed 59) transitions.
[2022-05-16 09:42:37] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:38] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/80 places, 93/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/80 places, 93/152 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p2), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s4 1) (EQ s8 1) (EQ s12 1) (EQ s44 1)), p2:(OR (EQ s38 1) (AND (EQ s4 1) (EQ s8 1) (EQ s12 1) (EQ s44 1))), p1:(AND (EQ s4 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-01 finished in 536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 95 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 58 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 58 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 52 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 52 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 51 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 46 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 46 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 43 transition count 69
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 91 place count 37 transition count 105
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 103 place count 37 transition count 93
Applied a total of 103 rules in 50 ms. Remains 37 /80 variables (removed 43) and now considering 93/152 (removed 59) transitions.
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 79 transitions (discarded 14 similar events)
// Phase 1: matrix 79 rows 37 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 79 transitions (discarded 14 similar events)
// Phase 1: matrix 79 rows 37 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:42:38] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 09:42:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-16 09:42:38] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 79 transitions (discarded 14 similar events)
// Phase 1: matrix 79 rows 37 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:38] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/80 places, 93/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/80 places, 93/152 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-02 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(G(p1)||p0))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 74 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 56 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 56 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 50 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 50 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 53 place count 50 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 45 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 45 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 45 transition count 75
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 73 place count 43 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 43 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 41 transition count 88
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 41 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 40 transition count 83
Applied a total of 83 rules in 33 ms. Remains 40 /80 variables (removed 40) and now considering 83/152 (removed 69) transitions.
[2022-05-16 09:42:38] [INFO ] Flow matrix only has 72 transitions (discarded 11 similar events)
// Phase 1: matrix 72 rows 40 cols
[2022-05-16 09:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 72 transitions (discarded 11 similar events)
// Phase 1: matrix 72 rows 40 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 09:42:39] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-05-16 09:42:39] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 72 transitions (discarded 11 similar events)
// Phase 1: matrix 72 rows 40 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/80 places, 83/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/80 places, 83/152 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-04 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 93 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 58 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 58 transition count 116
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 37 place count 52 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 52 transition count 104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 48 place count 52 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 49 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 46 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 46 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 46 transition count 75
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 73 place count 44 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 44 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 42 transition count 86
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 42 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 41 transition count 81
Applied a total of 83 rules in 27 ms. Remains 41 /80 variables (removed 39) and now considering 81/152 (removed 71) transitions.
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-16 09:42:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:42:39] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2022-05-16 09:42:39] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:42:39] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/80 places, 81/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/80 places, 81/152 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s25 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-05 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 95 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 57 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 57 transition count 114
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 52 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 52 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 49 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 50 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 48 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 48 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 63 place count 48 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 46 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 46 transition count 79
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 72 place count 44 transition count 98
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 44 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 43 transition count 93
Applied a total of 77 rules in 34 ms. Remains 43 /80 variables (removed 37) and now considering 93/152 (removed 59) transitions.
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 82 transitions (discarded 11 similar events)
// Phase 1: matrix 82 rows 43 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 82 transitions (discarded 11 similar events)
// Phase 1: matrix 82 rows 43 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:42:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-16 09:42:39] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-16 09:42:39] [INFO ] Flow matrix only has 82 transitions (discarded 11 similar events)
// Phase 1: matrix 82 rows 43 cols
[2022-05-16 09:42:39] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:39] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/80 places, 93/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/80 places, 93/152 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-06 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 93 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 58 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 58 transition count 116
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 36 place count 53 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 41 place count 53 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 47 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 51 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 51 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 49 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 49 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 49 transition count 84
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 65 place count 47 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 47 transition count 81
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 70 place count 45 transition count 100
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 45 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 44 transition count 95
Applied a total of 75 rules in 34 ms. Remains 44 /80 variables (removed 36) and now considering 95/152 (removed 57) transitions.
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
// Phase 1: matrix 84 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
// Phase 1: matrix 84 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:42:40] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-05-16 09:42:40] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
// Phase 1: matrix 84 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:40] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/80 places, 95/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/80 places, 95/152 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s24 1), p1:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-07 finished in 508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(X(G((F(p0)&&p1))))))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 93 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 58 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 58 transition count 116
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 36 place count 53 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 41 place count 53 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 53 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 51 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 51 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 49 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 49 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 49 transition count 87
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 62 place count 47 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 47 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
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 67 place count 45 transition count 105
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 45 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 44 transition count 100
Applied a total of 72 rules in 41 ms. Remains 44 /80 variables (removed 36) and now considering 100/152 (removed 52) transitions.
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 09:42:40] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-16 09:42:40] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-16 09:42:40] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:40] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:42:40] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/80 places, 100/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/80 places, 100/152 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 0), p0:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 293 ms.
Product exploration explored 100000 steps with 3 reset in 130 ms.
Computed a total of 16 stabilizing places and 35 stable transitions
Computed a total of 16 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1041 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:42:42] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:42] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:42] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:42:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 09:42:42] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 09:42:42] [INFO ] After 11ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:42] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 09:42:42] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 100/100 transitions.
Graph (complete) has 159 edges and 44 vertex of which 28 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 28 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 23 place count 28 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 24 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 24 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 22 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 22 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 22 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 20 transition count 59
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 20 transition count 57
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 16 transition count 57
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 49 place count 16 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 49 place count 16 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 53 place count 14 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 13 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 13 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 56 place count 13 transition count 45
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 6 with 4 rules applied. Total rules applied 60 place count 11 transition count 43
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 66 place count 11 transition count 37
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 79 place count 11 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 11 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 82 place count 10 transition count 22
Applied a total of 82 rules in 14 ms. Remains 10 /44 variables (removed 34) and now considering 22/100 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/44 places, 22/100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 6707 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=609 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2022-05-16 09:42:42] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:42] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-05-16 09:42:42] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:42] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 09:42:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-16 09:42:42] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-16 09:42:42] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:42] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:43] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 100/100 transitions.
Computed a total of 16 stabilizing places and 35 stable transitions
Computed a total of 16 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1059 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:42:43] [INFO ] Flow matrix only has 88 transitions (discarded 12 similar events)
// Phase 1: matrix 88 rows 44 cols
[2022-05-16 09:42:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:42:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 09:42:43] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 09:42:43] [INFO ] After 13ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:43] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 09:42:43] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 100/100 transitions.
Graph (complete) has 159 edges and 44 vertex of which 28 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 28 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 23 place count 28 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 24 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 24 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 22 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 22 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 22 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 20 transition count 59
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 20 transition count 57
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 16 transition count 57
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 49 place count 16 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 49 place count 16 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 53 place count 14 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 13 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 13 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 56 place count 13 transition count 45
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 6 with 4 rules applied. Total rules applied 60 place count 11 transition count 43
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 66 place count 11 transition count 37
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 79 place count 11 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 11 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 82 place count 10 transition count 22
Applied a total of 82 rules in 15 ms. Remains 10 /44 variables (removed 34) and now considering 22/100 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/44 places, 22/100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67 steps, run visited all 1 properties in 15 ms. (steps per millisecond=4 )
Probabilistic random walk after 67 steps, saw 26 distinct states, run finished after 15 ms. (steps per millisecond=4 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Built C files in :
/tmp/ltsmin13138352064408309464
[2022-05-16 09:42:44] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-16 09:42:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:42:44] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-16 09:42:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:42:44] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-16 09:42:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:42:44] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13138352064408309464
Running compilation step : cd /tmp/ltsmin13138352064408309464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 543 ms.
Running link step : cd /tmp/ltsmin13138352064408309464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13138352064408309464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7693815853571058779.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA HealthRecord-PT-09-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-08 finished in 4902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F((F(p0)&&p1)))))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 94 edges and 80 vertex of which 12 / 80 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 57 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 57 transition count 114
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 52 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 52 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 46 place count 52 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 47 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 47 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 62 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 45 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 43 transition count 97
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 43 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 42 transition count 92
Applied a total of 76 rules in 13 ms. Remains 42 /80 variables (removed 38) and now considering 92/152 (removed 60) transitions.
[2022-05-16 09:42:45] [INFO ] Flow matrix only has 80 transitions (discarded 12 similar events)
// Phase 1: matrix 80 rows 42 cols
[2022-05-16 09:42:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-16 09:42:45] [INFO ] Flow matrix only has 80 transitions (discarded 12 similar events)
// Phase 1: matrix 80 rows 42 cols
[2022-05-16 09:42:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-16 09:42:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-16 09:42:45] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-16 09:42:45] [INFO ] Flow matrix only has 80 transitions (discarded 12 similar events)
// Phase 1: matrix 80 rows 42 cols
[2022-05-16 09:42:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:45] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/80 places, 92/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/80 places, 92/152 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s33 1), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-10 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1)||p2)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 64 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 64 transition count 121
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 58 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 58 transition count 109
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 58 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 56 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 56 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 54 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 54 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 54 transition count 87
Applied a total of 64 rules in 3 ms. Remains 54 /80 variables (removed 26) and now considering 87/152 (removed 65) transitions.
[2022-05-16 09:42:45] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 09:42:45] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-16 09:42:46] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2022-05-16 09:42:46] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 87/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/80 places, 87/152 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s12 0), p2:(EQ s21 0), p0:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HealthRecord-PT-09-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-12 finished in 1420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(X(X(p0))))||(p1 U p2))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 63 transition count 118
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 63 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 57 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 57 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 57 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 55 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 53 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 53 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 53 transition count 84
Applied a total of 66 rules in 2 ms. Remains 53 /80 variables (removed 27) and now considering 84/152 (removed 68) transitions.
[2022-05-16 09:42:47] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:47] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 09:42:47] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:47] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-05-16 09:42:47] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:47] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:47] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/80 places, 84/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/80 places, 84/152 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s51 1)), p1:(EQ s8 1), p0:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19942 reset in 422 ms.
Product exploration explored 100000 steps with 19993 reset in 476 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 374 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 595 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 09:42:49] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:49] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:50] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:42:50] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:42:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:50] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:42:50] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-16 09:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:50] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-16 09:42:50] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-05-16 09:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-16 09:42:50] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-16 09:42:50] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 84/84 transitions.
Graph (trivial) has 43 edges and 53 vertex of which 12 / 53 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 182 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 2 place count 46 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 41 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 40 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 40 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 40 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 38 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 33 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 33 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 33 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 32 transition count 87
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 32 transition count 87
Applied a total of 41 rules in 15 ms. Remains 32 /53 variables (removed 21) and now considering 87/84 (removed -3) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/53 places, 87/84 transitions.
Incomplete random walk after 10000 steps, including 1616 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:42:50] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
// Phase 1: matrix 80 rows 32 cols
[2022-05-16 09:42:50] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-16 09:42:50] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 09:42:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:42:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 09:42:50] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-16 09:42:50] [INFO ] After 13ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:50] [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 11 ms.
[2022-05-16 09:42:50] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 87/87 transitions.
Graph (complete) has 146 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 24 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 22 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 22 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 22 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 21 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 21 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 20 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 20 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 20 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 20 transition count 57
Applied a total of 27 rules in 8 ms. Remains 20 /32 variables (removed 12) and now considering 57/87 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/32 places, 57/87 transitions.
Incomplete random walk after 10000 steps, including 1570 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 340 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 793 steps, run visited all 1 properties in 15 ms. (steps per millisecond=52 )
Probabilistic random walk after 793 steps, saw 298 distinct states, run finished after 15 ms. (steps per millisecond=52 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 535 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2022-05-16 09:42:51] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 09:42:51] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:51] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:42:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:51] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-16 09:42:51] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:51] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:42:51] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 84/84 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 591 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-16 09:42:52] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 53 cols
[2022-05-16 09:42:52] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:42:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:52] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:42:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:42:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:52] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:42:52] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:52] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:42:52] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 09:42:52] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 84/84 transitions.
Graph (trivial) has 44 edges and 53 vertex of which 12 / 53 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 182 edges and 47 vertex of which 29 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 29 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 22 place count 29 transition count 37
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 30 place count 25 transition count 37
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 23 transition count 33
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 23 transition count 33
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 22 transition count 32
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 22 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 21 transition count 31
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 21 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 19 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 16 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 47 place count 16 transition count 24
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 51 place count 14 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 13 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 13 transition count 21
Applied a total of 55 rules in 17 ms. Remains 13 /53 variables (removed 40) and now considering 21/84 (removed 63) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/53 places, 21/84 transitions.
Finished random walk after 85 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20023 reset in 185 ms.
Product exploration explored 100000 steps with 20007 reset in 201 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Graph (trivial) has 43 edges and 53 vertex of which 12 / 53 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 46 transition count 114
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 46 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 13 ms. Remains 46 /53 variables (removed 7) and now considering 113/84 (removed -29) transitions.
[2022-05-16 09:42:54] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 09:42:54] [INFO ] Flow matrix only has 97 transitions (discarded 16 similar events)
// Phase 1: matrix 97 rows 46 cols
[2022-05-16 09:42:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:55] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/53 places, 113/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/53 places, 113/84 transitions.
Product exploration explored 100000 steps with 20093 reset in 449 ms.
Product exploration explored 100000 steps with 20064 reset in 461 ms.
Built C files in :
/tmp/ltsmin12519196860422992595
[2022-05-16 09:42:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12519196860422992595
Running compilation step : cd /tmp/ltsmin12519196860422992595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin12519196860422992595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12519196860422992595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7881485347446569609.hoa' '--buchi-type=spotba'
LTSmin run took 10319 ms.
FORMULA HealthRecord-PT-09-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-14 finished in 19358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 10 / 80 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 58 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 58 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 52 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 52 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 51 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 46 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 46 transition count 74
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 75 place count 44 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 44 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 42 transition count 85
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 42 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 41 transition count 81
Applied a total of 84 rules in 28 ms. Remains 41 /80 variables (removed 39) and now considering 81/152 (removed 71) transitions.
[2022-05-16 09:43:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-16 09:43:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:43:06] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-16 09:43:06] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-16 09:43:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/80 places, 81/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/80 places, 81/152 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-15 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=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s34 1) (NEQ s5 1)), p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 2 reset in 209 ms.
Computed a total of 13 stabilizing places and 22 stable transitions
Computed a total of 13 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1043 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:43:07] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:07] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:07] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 09:43:07] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:43:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 09:43:07] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:43:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:43:07] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:43:07] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 09:43:07] [INFO ] After 99ms 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 41 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41/41 places, 81/81 transitions.
Graph (complete) has 145 edges and 41 vertex of which 40 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 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 9 place count 40 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 39 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 39 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 34 transition count 69
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 34 transition count 67
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 34 transition count 60
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 27 transition count 60
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 27 transition count 58
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 27 transition count 97
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 25 transition count 96
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 44 place count 25 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 24 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 24 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 23 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 23 transition count 69
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 23 transition count 63
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 58 place count 23 transition count 59
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 23 transition count 59
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 23 transition count 57
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 69 place count 23 transition count 57
Applied a total of 69 rules in 28 ms. Remains 23 /41 variables (removed 18) and now considering 57/81 (removed 24) transitions.
[2022-05-16 09:43:07] [INFO ] Flow matrix only has 47 transitions (discarded 10 similar events)
// Phase 1: matrix 47 rows 23 cols
[2022-05-16 09:43:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:43:07] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/41 places, 57/81 transitions.
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 364 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 239 steps, run visited all 1 properties in 7 ms. (steps per millisecond=34 )
Probabilistic random walk after 239 steps, saw 95 distinct states, run finished after 7 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-16 09:43:08] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-05-16 09:43:08] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:43:08] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-16 09:43:08] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-16 09:43:08] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:08] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Computed a total of 13 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1049 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:43:09] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 41 cols
[2022-05-16 09:43:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:43:09] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 09:43:09] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:43:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 09:43:09] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:43:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:43:09] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:43:09] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 09:43:09] [INFO ] After 87ms 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 41 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 41/41 places, 81/81 transitions.
Graph (complete) has 145 edges and 41 vertex of which 40 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 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 9 place count 40 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 39 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 39 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 34 transition count 69
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 34 transition count 67
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 34 transition count 60
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 27 transition count 60
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 27 transition count 58
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 27 transition count 97
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 25 transition count 96
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 44 place count 25 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 24 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 24 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 23 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 23 transition count 69
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 23 transition count 63
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 58 place count 23 transition count 59
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 23 transition count 59
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 23 transition count 57
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 69 place count 23 transition count 57
Applied a total of 69 rules in 17 ms. Remains 23 /41 variables (removed 18) and now considering 57/81 (removed 24) transitions.
[2022-05-16 09:43:09] [INFO ] Flow matrix only has 47 transitions (discarded 10 similar events)
// Phase 1: matrix 47 rows 23 cols
[2022-05-16 09:43:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:43:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/41 places, 57/81 transitions.
Finished random walk after 1090 steps, including 137 resets, run visited all 1 properties in 2 ms. (steps per millisecond=545 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 15 reset in 73 ms.
Built C files in :
/tmp/ltsmin9059363124128523833
[2022-05-16 09:43:09] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2022-05-16 09:43:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:43:09] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2022-05-16 09:43:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:43:09] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2022-05-16 09:43:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:43:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9059363124128523833
Running compilation step : cd /tmp/ltsmin9059363124128523833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin9059363124128523833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9059363124128523833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10977776892126138126.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA HealthRecord-PT-09-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-15 finished in 3675 ms.
All properties solved by simple procedures.
Total runtime 40975 ms.

BK_STOP 1652694190519

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-09, 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 r114-smll-165264477300140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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