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.r201-smll-167840347600355.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 ltsminxred
Input is HealthRecord-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 125K 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-16-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678641229160

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:13:52] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-12 17:13:52] [INFO ] Transformed 453 places.
[2023-03-12 17:13:52] [INFO ] Transformed 594 transitions.
[2023-03-12 17:13:52] [INFO ] Found NUPN structural information;
[2023-03-12 17:13:52] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HealthRecord-PT-16-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 375 transition count 503
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 375 transition count 503
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 193 place count 338 transition count 454
Iterating global reduction 0 with 37 rules applied. Total rules applied 230 place count 338 transition count 454
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 235 place count 338 transition count 449
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 249 place count 324 transition count 422
Iterating global reduction 1 with 14 rules applied. Total rules applied 263 place count 324 transition count 422
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 272 place count 315 transition count 406
Iterating global reduction 1 with 9 rules applied. Total rules applied 281 place count 315 transition count 406
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 283 place count 313 transition count 402
Iterating global reduction 1 with 2 rules applied. Total rules applied 285 place count 313 transition count 402
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 287 place count 311 transition count 399
Iterating global reduction 1 with 2 rules applied. Total rules applied 289 place count 311 transition count 399
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 290 place count 310 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 291 place count 310 transition count 397
Applied a total of 291 rules in 171 ms. Remains 310 /453 variables (removed 143) and now considering 397/594 (removed 197) transitions.
// Phase 1: matrix 397 rows 310 cols
[2023-03-12 17:13:52] [INFO ] Computed 14 place invariants in 28 ms
[2023-03-12 17:13:53] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-12 17:13:53] [INFO ] Invariant cache hit.
[2023-03-12 17:13:53] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2023-03-12 17:13:53] [INFO ] Invariant cache hit.
[2023-03-12 17:13:53] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/453 places, 397/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1506 ms. Remains : 310/453 places, 397/594 transitions.
Support contains 22 out of 310 places after structural reductions.
[2023-03-12 17:13:54] [INFO ] Flatten gal took : 101 ms
[2023-03-12 17:13:54] [INFO ] Flatten gal took : 33 ms
[2023-03-12 17:13:54] [INFO ] Input system was already deterministic with 397 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:13:55] [INFO ] Invariant cache hit.
[2023-03-12 17:13:55] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:13:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-12 17:13:55] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 50 ms returned sat
[2023-03-12 17:13:56] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:13:56] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 12 ms to minimize.
[2023-03-12 17:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-12 17:13:56] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 2 ms to minimize.
[2023-03-12 17:13:56] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 4 ms to minimize.
[2023-03-12 17:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-12 17:13:57] [INFO ] After 1211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-12 17:13:57] [INFO ] After 1772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 54 ms.
Support contains 8 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 397/397 transitions.
Graph (trivial) has 335 edges and 310 vertex of which 46 / 310 are part of one of the 17 SCC in 8 ms
Free SCC test removed 29 places
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 555 edges and 281 vertex of which 273 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 273 transition count 220
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 139 rules applied. Total rules applied 269 place count 145 transition count 209
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 276 place count 139 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 138 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 277 place count 138 transition count 203
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 287 place count 133 transition count 203
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 297 place count 123 transition count 184
Iterating global reduction 4 with 10 rules applied. Total rules applied 307 place count 123 transition count 184
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 310 place count 123 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 313 place count 120 transition count 181
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 317 place count 116 transition count 174
Iterating global reduction 6 with 4 rules applied. Total rules applied 321 place count 116 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 322 place count 116 transition count 173
Performed 44 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 410 place count 72 transition count 126
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 415 place count 72 transition count 121
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 418 place count 69 transition count 115
Iterating global reduction 8 with 3 rules applied. Total rules applied 421 place count 69 transition count 115
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 422 place count 68 transition count 113
Iterating global reduction 8 with 1 rules applied. Total rules applied 423 place count 68 transition count 113
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 424 place count 67 transition count 112
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 67 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 426 place count 67 transition count 111
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 442 place count 59 transition count 177
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 58 transition count 167
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 58 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 446 place count 58 transition count 165
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 10 with 25 rules applied. Total rules applied 471 place count 58 transition count 140
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 472 place count 57 transition count 134
Iterating global reduction 10 with 1 rules applied. Total rules applied 473 place count 57 transition count 134
Free-agglomeration rule applied 21 times.
Iterating global reduction 10 with 21 rules applied. Total rules applied 494 place count 57 transition count 113
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 519 place count 36 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 523 place count 36 transition count 105
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 529 place count 36 transition count 105
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 534 place count 36 transition count 105
Applied a total of 534 rules in 141 ms. Remains 36 /310 variables (removed 274) and now considering 105/397 (removed 292) transitions.
[2023-03-12 17:13:57] [INFO ] Flow matrix only has 92 transitions (discarded 13 similar events)
// Phase 1: matrix 92 rows 36 cols
[2023-03-12 17:13:57] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 17:13:57] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 36/310 places, 105/397 transitions.
Incomplete random walk after 10000 steps, including 1739 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 391 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 369 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-12 17:13:58] [INFO ] Flow matrix only has 92 transitions (discarded 13 similar events)
[2023-03-12 17:13:58] [INFO ] Invariant cache hit.
[2023-03-12 17:13:58] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:13:58] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 17:13:58] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:13:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 17:13:58] [INFO ] After 22ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:13:58] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 17:13:58] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 105/105 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 36 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 33 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 33 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 32 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 32 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 32 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 12 place count 31 transition count 102
Applied a total of 12 rules in 11 ms. Remains 31 /36 variables (removed 5) and now considering 102/105 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 31/36 places, 102/105 transitions.
Incomplete random walk after 10000 steps, including 2581 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2683 steps, run visited all 2 properties in 32 ms. (steps per millisecond=83 )
Probabilistic random walk after 2683 steps, saw 811 distinct states, run finished after 33 ms. (steps per millisecond=81 ) properties seen :2
Computed a total of 93 stabilizing places and 99 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' '!(G((G(p1)||F(p2)||p0)))'
Support contains 8 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Graph (trivial) has 333 edges and 310 vertex of which 46 / 310 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 280 transition count 250
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 127 rules applied. Total rules applied 242 place count 166 transition count 237
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 251 place count 159 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 157 transition count 235
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 253 place count 157 transition count 230
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 263 place count 152 transition count 230
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 280 place count 135 transition count 203
Iterating global reduction 4 with 17 rules applied. Total rules applied 297 place count 135 transition count 203
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 301 place count 135 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 305 place count 131 transition count 199
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 313 place count 123 transition count 186
Iterating global reduction 6 with 8 rules applied. Total rules applied 321 place count 123 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 323 place count 123 transition count 184
Performed 41 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 405 place count 82 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 406 place count 82 transition count 139
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 408 place count 80 transition count 135
Iterating global reduction 8 with 2 rules applied. Total rules applied 410 place count 80 transition count 135
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 412 place count 78 transition count 127
Iterating global reduction 8 with 2 rules applied. Total rules applied 414 place count 78 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 415 place count 78 transition count 126
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 435 place count 68 transition count 194
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 455 place count 68 transition count 174
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 456 place count 67 transition count 168
Iterating global reduction 9 with 1 rules applied. Total rules applied 457 place count 67 transition count 168
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 458 place count 66 transition count 166
Iterating global reduction 9 with 1 rules applied. Total rules applied 459 place count 66 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 460 place count 66 transition count 165
Applied a total of 460 rules in 75 ms. Remains 66 /310 variables (removed 244) and now considering 165/397 (removed 232) transitions.
[2023-03-12 17:13:58] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
// Phase 1: matrix 154 rows 66 cols
[2023-03-12 17:13:58] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:13:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 17:13:58] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:13:58] [INFO ] Invariant cache hit.
[2023-03-12 17:13:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:13:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-12 17:13:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 17:13:59] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:13:59] [INFO ] Invariant cache hit.
[2023-03-12 17:13:59] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/310 places, 165/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 66/310 places, 165/397 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s41 0) (EQ s65 1) (EQ s50 0) (EQ s10 1)), p1:(OR (EQ s45 0) (EQ s56 1)), p2:(OR (EQ s28 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6959 reset in 437 ms.
Product exploration explored 100000 steps with 2360 reset in 287 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 762 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:14:01] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:01] [INFO ] Invariant cache hit.
[2023-03-12 17:14:01] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:14:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 26 ms returned sat
[2023-03-12 17:14:01] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 17:14:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:14:01] [INFO ] After 26ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 17:14:01] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:14:01] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:14:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-12 17:14:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-12 17:14:01] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 17:14:01] [INFO ] After 519ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 165/165 transitions.
Graph (complete) has 216 edges and 66 vertex of which 48 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 21 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 48 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 47 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 47 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 46 transition count 129
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 46 transition count 116
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 58 place count 35 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 34 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 34 transition count 110
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 34 transition count 110
Applied a total of 62 rules in 17 ms. Remains 34 /66 variables (removed 32) and now considering 110/165 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 34/66 places, 110/165 transitions.
Incomplete random walk after 10000 steps, including 1096 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 34664 steps, run visited all 2 properties in 119 ms. (steps per millisecond=291 )
Probabilistic random walk after 34664 steps, saw 7569 distinct states, run finished after 119 ms. (steps per millisecond=291 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 522 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 165/165 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2023-03-12 17:14:03] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:03] [INFO ] Invariant cache hit.
[2023-03-12 17:14:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 17:14:03] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:03] [INFO ] Invariant cache hit.
[2023-03-12 17:14:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:14:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-12 17:14:03] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:03] [INFO ] Invariant cache hit.
[2023-03-12 17:14:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 66/66 places, 165/165 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 769 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:14:04] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:04] [INFO ] Invariant cache hit.
[2023-03-12 17:14:04] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:14:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 17:14:04] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:14:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:14:04] [INFO ] After 40ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:14:04] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-12 17:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-12 17:14:04] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 17:14:04] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 165/165 transitions.
Graph (complete) has 216 edges and 66 vertex of which 48 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 21 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 48 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 47 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 47 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 46 transition count 129
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 46 transition count 116
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 58 place count 35 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 34 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 34 transition count 110
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 34 transition count 110
Applied a total of 62 rules in 24 ms. Remains 34 /66 variables (removed 32) and now considering 110/165 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 34/66 places, 110/165 transitions.
Incomplete random walk after 10000 steps, including 1100 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 34664 steps, run visited all 2 properties in 69 ms. (steps per millisecond=502 )
Probabilistic random walk after 34664 steps, saw 7569 distinct states, run finished after 72 ms. (steps per millisecond=481 ) properties seen :2
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7077 reset in 210 ms.
Product exploration explored 100000 steps with 270 reset in 123 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 165/165 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2023-03-12 17:14:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 17:14:06] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:06] [INFO ] Invariant cache hit.
[2023-03-12 17:14:06] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 66/66 places, 165/165 transitions.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 165/165 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2023-03-12 17:14:06] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:06] [INFO ] Invariant cache hit.
[2023-03-12 17:14:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 17:14:06] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:06] [INFO ] Invariant cache hit.
[2023-03-12 17:14:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:14:06] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-12 17:14:06] [INFO ] Flow matrix only has 154 transitions (discarded 11 similar events)
[2023-03-12 17:14:06] [INFO ] Invariant cache hit.
[2023-03-12 17:14:06] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 66/66 places, 165/165 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-00 finished in 8327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Graph (trivial) has 344 edges and 310 vertex of which 46 / 310 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 280 transition count 242
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 135 rules applied. Total rules applied 258 place count 158 transition count 229
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 266 place count 151 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 150 transition count 228
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 267 place count 150 transition count 223
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 277 place count 145 transition count 223
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 298 place count 124 transition count 188
Iterating global reduction 4 with 21 rules applied. Total rules applied 319 place count 124 transition count 188
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 323 place count 124 transition count 184
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 327 place count 120 transition count 184
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 337 place count 110 transition count 168
Iterating global reduction 6 with 10 rules applied. Total rules applied 347 place count 110 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 349 place count 110 transition count 166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 350 place count 109 transition count 165
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 109 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 352 place count 109 transition count 164
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 436 place count 67 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 437 place count 67 transition count 118
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 440 place count 64 transition count 112
Iterating global reduction 9 with 3 rules applied. Total rules applied 443 place count 64 transition count 112
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 445 place count 62 transition count 106
Iterating global reduction 9 with 2 rules applied. Total rules applied 447 place count 62 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 448 place count 62 transition count 105
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 449 place count 61 transition count 104
Iterating global reduction 10 with 1 rules applied. Total rules applied 450 place count 61 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 451 place count 61 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 463 place count 55 transition count 147
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 484 place count 55 transition count 126
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 485 place count 54 transition count 120
Iterating global reduction 11 with 1 rules applied. Total rules applied 486 place count 54 transition count 120
Applied a total of 486 rules in 49 ms. Remains 54 /310 variables (removed 256) and now considering 120/397 (removed 277) transitions.
[2023-03-12 17:14:07] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
// Phase 1: matrix 112 rows 54 cols
[2023-03-12 17:14:07] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:14:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 17:14:07] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:07] [INFO ] Invariant cache hit.
[2023-03-12 17:14:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:14:07] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-12 17:14:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 17:14:07] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:07] [INFO ] Invariant cache hit.
[2023-03-12 17:14:07] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/310 places, 120/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 54/310 places, 120/397 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2206 reset in 269 ms.
Product exploration explored 100000 steps with 5446 reset in 401 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 870 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 847782 steps, run visited all 1 properties in 1061 ms. (steps per millisecond=799 )
Probabilistic random walk after 847782 steps, saw 143698 distinct states, run finished after 1061 ms. (steps per millisecond=799 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-12 17:14:09] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:09] [INFO ] Invariant cache hit.
[2023-03-12 17:14:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 17:14:09] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:09] [INFO ] Invariant cache hit.
[2023-03-12 17:14:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:14:09] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-12 17:14:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:14:09] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:09] [INFO ] Invariant cache hit.
[2023-03-12 17:14:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 54/54 places, 120/120 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 868 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 847782 steps, run visited all 1 properties in 1042 ms. (steps per millisecond=813 )
Probabilistic random walk after 847782 steps, saw 143698 distinct states, run finished after 1042 ms. (steps per millisecond=813 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7907 reset in 205 ms.
Product exploration explored 100000 steps with 4390 reset in 138 ms.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-12 17:14:11] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:11] [INFO ] Invariant cache hit.
[2023-03-12 17:14:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 17:14:11] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:11] [INFO ] Invariant cache hit.
[2023-03-12 17:14:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:14:11] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-12 17:14:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:14:11] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2023-03-12 17:14:11] [INFO ] Invariant cache hit.
[2023-03-12 17:14:12] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 54/54 places, 120/120 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-01 finished in 5124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 299 transition count 381
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 299 transition count 381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 295 transition count 373
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 295 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 295 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 293 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 293 transition count 369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 291 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 291 transition count 366
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 289 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 289 transition count 363
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 287 transition count 361
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 287 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 287 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 286 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 286 transition count 359
Applied a total of 50 rules in 54 ms. Remains 286 /310 variables (removed 24) and now considering 359/397 (removed 38) transitions.
// Phase 1: matrix 359 rows 286 cols
[2023-03-12 17:14:12] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-12 17:14:12] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 17:14:12] [INFO ] Invariant cache hit.
[2023-03-12 17:14:12] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-12 17:14:12] [INFO ] Invariant cache hit.
[2023-03-12 17:14:13] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/310 places, 359/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 932 ms. Remains : 286/310 places, 359/397 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s114 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-04 finished in 1124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 298 transition count 380
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 298 transition count 380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 293 transition count 371
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 293 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 293 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 290 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 290 transition count 366
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 288 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 288 transition count 363
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 286 transition count 360
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 286 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 284 transition count 358
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 284 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 284 transition count 357
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 283 transition count 356
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 283 transition count 356
Applied a total of 56 rules in 51 ms. Remains 283 /310 variables (removed 27) and now considering 356/397 (removed 41) transitions.
// Phase 1: matrix 356 rows 283 cols
[2023-03-12 17:14:13] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-12 17:14:13] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 17:14:13] [INFO ] Invariant cache hit.
[2023-03-12 17:14:13] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-12 17:14:13] [INFO ] Invariant cache hit.
[2023-03-12 17:14:14] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 283/310 places, 356/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 876 ms. Remains : 283/310 places, 356/397 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-05 finished in 1080 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))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 298 transition count 380
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 298 transition count 380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 293 transition count 371
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 293 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 293 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 290 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 290 transition count 366
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 288 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 288 transition count 363
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 286 transition count 360
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 286 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 284 transition count 358
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 284 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 284 transition count 357
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 283 transition count 356
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 283 transition count 356
Applied a total of 56 rules in 35 ms. Remains 283 /310 variables (removed 27) and now considering 356/397 (removed 41) transitions.
[2023-03-12 17:14:14] [INFO ] Invariant cache hit.
[2023-03-12 17:14:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 17:14:14] [INFO ] Invariant cache hit.
[2023-03-12 17:14:14] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-12 17:14:14] [INFO ] Invariant cache hit.
[2023-03-12 17:14:15] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 283/310 places, 356/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 797 ms. Remains : 283/310 places, 356/397 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s210 0) (EQ s27 1)), p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLCardinality-12 finished in 1658 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 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Graph (trivial) has 345 edges and 310 vertex of which 46 / 310 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 280 transition count 241
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 134 rules applied. Total rules applied 258 place count 157 transition count 230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 264 place count 151 transition count 230
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 264 place count 151 transition count 225
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 274 place count 146 transition count 225
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 295 place count 125 transition count 190
Iterating global reduction 3 with 21 rules applied. Total rules applied 316 place count 125 transition count 190
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 125 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 121 transition count 186
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 333 place count 112 transition count 171
Iterating global reduction 5 with 9 rules applied. Total rules applied 342 place count 112 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 345 place count 112 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 346 place count 111 transition count 168
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 349 place count 108 transition count 163
Iterating global reduction 7 with 3 rules applied. Total rules applied 352 place count 108 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 353 place count 108 transition count 162
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 354 place count 107 transition count 161
Iterating global reduction 8 with 1 rules applied. Total rules applied 355 place count 107 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 356 place count 107 transition count 160
Performed 43 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 9 with 86 rules applied. Total rules applied 442 place count 64 transition count 113
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 444 place count 62 transition count 109
Iterating global reduction 9 with 2 rules applied. Total rules applied 446 place count 62 transition count 109
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 448 place count 60 transition count 101
Iterating global reduction 9 with 2 rules applied. Total rules applied 450 place count 60 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 451 place count 60 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 461 place count 55 transition count 138
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 481 place count 55 transition count 118
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 482 place count 54 transition count 115
Iterating global reduction 10 with 1 rules applied. Total rules applied 483 place count 54 transition count 115
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 484 place count 53 transition count 113
Iterating global reduction 10 with 1 rules applied. Total rules applied 485 place count 53 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 486 place count 53 transition count 112
Applied a total of 486 rules in 46 ms. Remains 53 /310 variables (removed 257) and now considering 112/397 (removed 285) transitions.
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
// Phase 1: matrix 104 rows 53 cols
[2023-03-12 17:14:16] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 17:14:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
[2023-03-12 17:14:16] [INFO ] Invariant cache hit.
[2023-03-12 17:14:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 17:14:16] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-12 17:14:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
[2023-03-12 17:14:16] [INFO ] Invariant cache hit.
[2023-03-12 17:14:16] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/310 places, 112/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 544 ms. Remains : 53/310 places, 112/397 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-14 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 s29 0) (NEQ s31 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 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-14 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 397/397 transitions.
Graph (trivial) has 343 edges and 310 vertex of which 46 / 310 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 280 transition count 241
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 136 rules applied. Total rules applied 260 place count 157 transition count 228
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 267 place count 150 transition count 228
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 267 place count 150 transition count 222
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 279 place count 144 transition count 222
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 299 place count 124 transition count 189
Iterating global reduction 3 with 20 rules applied. Total rules applied 319 place count 124 transition count 189
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 323 place count 124 transition count 185
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 327 place count 120 transition count 185
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 335 place count 112 transition count 172
Iterating global reduction 5 with 8 rules applied. Total rules applied 343 place count 112 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 112 transition count 171
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 345 place count 111 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 111 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 111 transition count 169
Performed 40 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 427 place count 71 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 428 place count 71 transition count 125
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 431 place count 68 transition count 119
Iterating global reduction 8 with 3 rules applied. Total rules applied 434 place count 68 transition count 119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 435 place count 67 transition count 115
Iterating global reduction 8 with 1 rules applied. Total rules applied 436 place count 67 transition count 115
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 450 place count 60 transition count 169
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 452 place count 58 transition count 152
Iterating global reduction 8 with 2 rules applied. Total rules applied 454 place count 58 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 456 place count 58 transition count 150
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 457 place count 57 transition count 148
Iterating global reduction 9 with 1 rules applied. Total rules applied 458 place count 57 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 459 place count 57 transition count 147
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 475 place count 57 transition count 131
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 476 place count 56 transition count 125
Iterating global reduction 10 with 1 rules applied. Total rules applied 477 place count 56 transition count 125
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 478 place count 55 transition count 123
Iterating global reduction 10 with 1 rules applied. Total rules applied 479 place count 55 transition count 123
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 480 place count 55 transition count 122
Applied a total of 480 rules in 37 ms. Remains 55 /310 variables (removed 255) and now considering 122/397 (removed 275) transitions.
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
// Phase 1: matrix 114 rows 55 cols
[2023-03-12 17:14:16] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 17:14:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
[2023-03-12 17:14:16] [INFO ] Invariant cache hit.
[2023-03-12 17:14:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 17:14:16] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-12 17:14:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:14:16] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
[2023-03-12 17:14:16] [INFO ] Invariant cache hit.
[2023-03-12 17:14:17] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/310 places, 122/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 55/310 places, 122/397 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s38 1)), p1:(AND (EQ s37 0) (EQ s24 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 5 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-15 finished in 440 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((G(p1)||F(p2)||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 17:14:17] [INFO ] Flatten gal took : 30 ms
[2023-03-12 17:14:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 17:14:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 310 places, 397 transitions and 921 arcs took 4 ms.
Total runtime 25586 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1057/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1057/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HealthRecord-PT-16-LTLCardinality-00
Could not compute solution for formula : HealthRecord-PT-16-LTLCardinality-01

BK_STOP 1678641259271

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name HealthRecord-PT-16-LTLCardinality-00
ltl formula formula --ltl=/tmp/1057/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 310 places, 397 transitions and 921 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1057/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1057/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.000 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1057/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1057/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name HealthRecord-PT-16-LTLCardinality-01
ltl formula formula --ltl=/tmp/1057/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 310 places, 397 transitions and 921 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1057/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1057/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1057/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1057/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-16, 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 r201-smll-167840347600355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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