Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678513214715

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 05:40:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:40:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:40:18] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-11 05:40:18] [INFO ] Transformed 159 places.
[2023-03-11 05:40:18] [INFO ] Transformed 334 transitions.
[2023-03-11 05:40:18] [INFO ] Found NUPN structural information;
[2023-03-11 05:40:18] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-11-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 78 transition count 152
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 78 transition count 152
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 169 place count 71 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 176 place count 71 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 181 place count 71 transition count 133
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 183 place count 69 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 185 place count 69 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 187 place count 67 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 189 place count 67 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 195 place count 67 transition count 117
Applied a total of 195 rules in 65 ms. Remains 67 /159 variables (removed 92) and now considering 117/307 (removed 190) transitions.
[2023-03-11 05:40:19] [INFO ] Flow matrix only has 112 transitions (discarded 5 similar events)
// Phase 1: matrix 112 rows 67 cols
[2023-03-11 05:40:19] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-11 05:40:19] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-11 05:40:19] [INFO ] Flow matrix only has 112 transitions (discarded 5 similar events)
[2023-03-11 05:40:19] [INFO ] Invariant cache hit.
[2023-03-11 05:40:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:19] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-11 05:40:19] [INFO ] Flow matrix only has 112 transitions (discarded 5 similar events)
[2023-03-11 05:40:19] [INFO ] Invariant cache hit.
[2023-03-11 05:40:19] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/159 places, 117/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 67/159 places, 117/307 transitions.
Support contains 18 out of 67 places after structural reductions.
[2023-03-11 05:40:20] [INFO ] Flatten gal took : 71 ms
[2023-03-11 05:40:20] [INFO ] Flatten gal took : 29 ms
[2023-03-11 05:40:20] [INFO ] Input system was already deterministic with 117 transitions.
Incomplete random walk after 10000 steps, including 674 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:40:21] [INFO ] Flow matrix only has 112 transitions (discarded 5 similar events)
[2023-03-11 05:40:21] [INFO ] Invariant cache hit.
[2023-03-11 05:40:21] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:40:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 05:40:21] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 05:40:21] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:21] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:40:21] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-11 05:40:21] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 117/117 transitions.
Graph (trivial) has 60 edges and 67 vertex of which 8 / 67 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 251 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 102
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 61 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 61 transition count 100
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 7 place count 60 transition count 100
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 13 place count 54 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 54 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 54 transition count 87
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 52 transition count 83
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 52 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 51 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 51 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 50 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 50 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 50 transition count 76
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 4 with 6 rules applied. Total rules applied 36 place count 47 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 47 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 49 place count 41 transition count 108
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 52 place count 41 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 41 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 54 place count 40 transition count 104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 56 place count 40 transition count 102
Applied a total of 56 rules in 72 ms. Remains 40 /67 variables (removed 27) and now considering 102/117 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 40/67 places, 102/117 transitions.
Incomplete random walk after 10000 steps, including 1865 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 05:40:22] [INFO ] Flow matrix only has 91 transitions (discarded 11 similar events)
// Phase 1: matrix 91 rows 40 cols
[2023-03-11 05:40:22] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-11 05:40:22] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:40:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 05:40:22] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 05:40:22] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:40:22] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 05:40:22] [INFO ] After 28ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:40:22] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 05:40:22] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 38 transition count 100
Applied a total of 4 rules in 13 ms. Remains 38 /40 variables (removed 2) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 38/40 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 1896 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Finished probabilistic random walk after 329 steps, run visited all 4 properties in 19 ms. (steps per millisecond=17 )
Probabilistic random walk after 329 steps, saw 171 distinct states, run finished after 19 ms. (steps per millisecond=17 ) properties seen :4
FORMULA HealthRecord-PT-11-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 6 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 117/117 transitions.
Graph (trivial) has 68 edges and 67 vertex of which 10 / 67 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 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 52 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 49 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 48 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 47 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 47 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 47 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 46 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 42 place count 44 transition count 90
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 45 place count 44 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 43 transition count 86
Applied a total of 46 rules in 37 ms. Remains 43 /67 variables (removed 24) and now considering 86/117 (removed 31) transitions.
[2023-03-11 05:40:23] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 43 cols
[2023-03-11 05:40:23] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 05:40:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 05:40:23] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2023-03-11 05:40:23] [INFO ] Invariant cache hit.
[2023-03-11 05:40:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:40:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 05:40:23] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 05:40:23] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2023-03-11 05:40:23] [INFO ] Invariant cache hit.
[2023-03-11 05:40:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/67 places, 86/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 43/67 places, 86/117 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-01 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:(AND (EQ s17 0) (EQ s24 1)), p0:(OR (EQ s5 0) (EQ s11 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 1 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-01 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(F((!p0&&F(p1))))) U G(p0)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 117/117 transitions.
Graph (trivial) has 68 edges and 67 vertex of which 10 / 67 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 52 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 52 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 50 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 50 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 49 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 49 transition count 86
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 2 with 4 rules applied. Total rules applied 33 place count 47 transition count 105
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 47 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 46 transition count 101
Applied a total of 37 rules in 44 ms. Remains 46 /67 variables (removed 21) and now considering 101/117 (removed 16) transitions.
[2023-03-11 05:40:23] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
// Phase 1: matrix 91 rows 46 cols
[2023-03-11 05:40:23] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:40:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:40:23] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2023-03-11 05:40:23] [INFO ] Invariant cache hit.
[2023-03-11 05:40:24] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 05:40:24] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 05:40:24] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 05:40:24] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2023-03-11 05:40:24] [INFO ] Invariant cache hit.
[2023-03-11 05:40:24] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/67 places, 101/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 46/67 places, 101/117 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s34 1)), p1:(OR (EQ s13 0) (EQ s2 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 5473 steps with 1812 reset in 91 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-05 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 117/117 transitions.
Graph (trivial) has 71 edges and 67 vertex of which 8 / 67 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 51 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 51 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 51 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 48 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 48 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 47 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 47 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 46 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 46 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 46 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 45 transition count 73
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 46 place count 43 transition count 87
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 43 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 42 transition count 83
Applied a total of 50 rules in 42 ms. Remains 42 /67 variables (removed 25) and now considering 83/117 (removed 34) transitions.
[2023-03-11 05:40:24] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-11 05:40:24] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-11 05:40:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 05:40:24] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:40:24] [INFO ] Invariant cache hit.
[2023-03-11 05:40:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:40:24] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-11 05:40:24] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 05:40:24] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:40:24] [INFO ] Invariant cache hit.
[2023-03-11 05:40:24] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/67 places, 83/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 42/67 places, 83/117 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s25 0) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-09 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||G(p1)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 117/117 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 57 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 57 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 55 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 55 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 55 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 54 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 54 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 53 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 53 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 53 transition count 82
Applied a total of 35 rules in 15 ms. Remains 53 /67 variables (removed 14) and now considering 82/117 (removed 35) transitions.
[2023-03-11 05:40:25] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
// Phase 1: matrix 78 rows 53 cols
[2023-03-11 05:40:25] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 05:40:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 05:40:25] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2023-03-11 05:40:25] [INFO ] Invariant cache hit.
[2023-03-11 05:40:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:25] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 05:40:25] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2023-03-11 05:40:25] [INFO ] Invariant cache hit.
[2023-03-11 05:40:25] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/67 places, 82/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 53/67 places, 82/117 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s21 1)), p1:(OR (EQ s32 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 344 ms.
Product exploration explored 100000 steps with 4 reset in 260 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:40:26] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2023-03-11 05:40:26] [INFO ] Invariant cache hit.
[2023-03-11 05:40:27] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:40:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 05:40:27] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 05:40:27] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 05:40:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:27] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 05:40:27] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 05:40:27] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 82/82 transitions.
Graph (trivial) has 45 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 178 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 46 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 46 transition count 64
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 7 place count 45 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 44 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 44 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 44 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 3 with 4 rules applied. Total rules applied 14 place count 42 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
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 26 place count 36 transition count 98
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 36 transition count 96
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 36 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 33 transition count 93
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 33 transition count 90
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 46 place count 33 transition count 90
Applied a total of 46 rules in 34 ms. Remains 33 /53 variables (removed 20) and now considering 90/82 (removed -8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 33/53 places, 90/82 transitions.
Incomplete random walk after 10000 steps, including 1970 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 260 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 407 steps, run visited all 1 properties in 7 ms. (steps per millisecond=58 )
Probabilistic random walk after 407 steps, saw 207 distinct states, run finished after 7 ms. (steps per millisecond=58 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 614 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 53 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 : 53/53 places, 82/82 transitions.
Graph (trivial) has 45 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 41 transition count 112
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 41 transition count 109
Applied a total of 19 rules in 19 ms. Remains 41 /53 variables (removed 12) and now considering 109/82 (removed -27) transitions.
[2023-03-11 05:40:28] [INFO ] Flow matrix only has 96 transitions (discarded 13 similar events)
// Phase 1: matrix 96 rows 41 cols
[2023-03-11 05:40:28] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:40:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 05:40:28] [INFO ] Flow matrix only has 96 transitions (discarded 13 similar events)
[2023-03-11 05:40:28] [INFO ] Invariant cache hit.
[2023-03-11 05:40:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-11 05:40:28] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 05:40:28] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-11 05:40:28] [INFO ] Flow matrix only has 96 transitions (discarded 13 similar events)
[2023-03-11 05:40:28] [INFO ] Invariant cache hit.
[2023-03-11 05:40:28] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/53 places, 109/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 41/53 places, 109/82 transitions.
Computed a total of 21 stabilizing places and 53 stable transitions
Computed a total of 21 stabilizing places and 53 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Finished random walk after 863 steps, including 118 resets, run visited all 1 properties in 3 ms. (steps per millisecond=287 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 109 ms.
Product exploration explored 100000 steps with 3 reset in 385 ms.
Built C files in :
/tmp/ltsmin2457261188914939205
[2023-03-11 05:40:29] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-11 05:40:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:40:29] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-11 05:40:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:40:29] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-11 05:40:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:40:29] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2457261188914939205
Running compilation step : cd /tmp/ltsmin2457261188914939205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 764 ms.
Running link step : cd /tmp/ltsmin2457261188914939205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin2457261188914939205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16761423572020849552.hoa' '--buchi-type=spotba'
LTSmin run took 355 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-11 finished in 6014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&F(p1)) U (G((G(!p0)||(!p0&&F(p1))))||(p2&&(G(!p0)||(!p0&&F(p1)))&&X(!p1))))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 117/117 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 57 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 57 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 55 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 55 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 54 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 53 transition count 88
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 53 transition count 85
Applied a total of 32 rules in 11 ms. Remains 53 /67 variables (removed 14) and now considering 85/117 (removed 32) transitions.
[2023-03-11 05:40:31] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2023-03-11 05:40:31] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:40:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 05:40:31] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:31] [INFO ] Invariant cache hit.
[2023-03-11 05:40:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:31] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-11 05:40:31] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:31] [INFO ] Invariant cache hit.
[2023-03-11 05:40:31] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/67 places, 85/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 53/67 places, 85/117 transitions.
Stuttering acceptance computed with spot in 300 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s17 1) (OR (EQ s42 0) (EQ s25 1))), p2:(OR (EQ s42 0) (EQ s25 1)), p1:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 483 ms.
Product exploration explored 100000 steps with 3 reset in 185 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1044 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 680 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 1131494 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1, 8=1, 9=1}
Probabilistic random walk after 1131494 steps, saw 140356 distinct states, run finished after 3003 ms. (steps per millisecond=376 ) properties seen :7
Running SMT prover for 3 properties.
[2023-03-11 05:40:37] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:37] [INFO ] Invariant cache hit.
[2023-03-11 05:40:37] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-11 05:40:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 05:40:37] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 05:40:37] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT (AND p2 p1 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 1044 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-11 05:40:39] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:39] [INFO ] Invariant cache hit.
[2023-03-11 05:40:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 05:40:39] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:39] [INFO ] Invariant cache hit.
[2023-03-11 05:40:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:40:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-11 05:40:39] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-11 05:40:39] [INFO ] Invariant cache hit.
[2023-03-11 05:40:39] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 53/53 places, 85/85 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X p1)), (X (X (AND p2 p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 490 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 670 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Finished probabilistic random walk after 6454 steps, run visited all 5 properties in 41 ms. (steps per millisecond=157 )
Probabilistic random walk after 6454 steps, saw 1551 distinct states, run finished after 41 ms. (steps per millisecond=157 ) properties seen :5
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X p1)), (X (X (AND p2 p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 740 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 24 reset in 99 ms.
Built C files in :
/tmp/ltsmin14177774713681881595
[2023-03-11 05:40:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14177774713681881595
Running compilation step : cd /tmp/ltsmin14177774713681881595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin14177774713681881595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14177774713681881595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13730771028384389372.hoa' '--buchi-type=spotba'
LTSmin run took 6718 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLCardinality-14 finished in 18652 ms.
All properties solved by simple procedures.
Total runtime 31448 ms.

BK_STOP 1678513250794

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-167840344100315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;