Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 17:53 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 175K 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-17-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678525849884

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:10:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 09:10:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:10:54] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-11 09:10:54] [INFO ] Transformed 624 places.
[2023-03-11 09:10:54] [INFO ] Transformed 828 transitions.
[2023-03-11 09:10:54] [INFO ] Found NUPN structural information;
[2023-03-11 09:10:54] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 3 formulas.
FORMULA HealthRecord-PT-17-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 499 transition count 677
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 499 transition count 677
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 299 place count 450 transition count 615
Iterating global reduction 0 with 49 rules applied. Total rules applied 348 place count 450 transition count 615
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 353 place count 450 transition count 610
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 376 place count 427 transition count 568
Iterating global reduction 1 with 23 rules applied. Total rules applied 399 place count 427 transition count 568
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 407 place count 419 transition count 555
Iterating global reduction 1 with 8 rules applied. Total rules applied 415 place count 419 transition count 555
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 418 place count 416 transition count 552
Iterating global reduction 1 with 3 rules applied. Total rules applied 421 place count 416 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 423 place count 414 transition count 548
Iterating global reduction 1 with 2 rules applied. Total rules applied 425 place count 414 transition count 548
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 427 place count 412 transition count 546
Iterating global reduction 1 with 2 rules applied. Total rules applied 429 place count 412 transition count 546
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 431 place count 410 transition count 544
Iterating global reduction 1 with 2 rules applied. Total rules applied 433 place count 410 transition count 544
Applied a total of 433 rules in 347 ms. Remains 410 /624 variables (removed 214) and now considering 544/828 (removed 284) transitions.
// Phase 1: matrix 544 rows 410 cols
[2023-03-11 09:10:55] [INFO ] Computed 18 place invariants in 49 ms
[2023-03-11 09:10:55] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-11 09:10:55] [INFO ] Invariant cache hit.
[2023-03-11 09:10:56] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2023-03-11 09:10:56] [INFO ] Invariant cache hit.
[2023-03-11 09:10:57] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 410/624 places, 544/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2339 ms. Remains : 410/624 places, 544/828 transitions.
Support contains 26 out of 410 places after structural reductions.
[2023-03-11 09:10:57] [INFO ] Flatten gal took : 143 ms
[2023-03-11 09:10:57] [INFO ] Flatten gal took : 69 ms
[2023-03-11 09:10:57] [INFO ] Input system was already deterministic with 544 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 09:10:59] [INFO ] Invariant cache hit.
[2023-03-11 09:10:59] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2023-03-11 09:10:59] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 09:10:59] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 09:10:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2023-03-11 09:10:59] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-11 09:11:00] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 09:11:00] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 10 ms to minimize.
[2023-03-11 09:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-11 09:11:01] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 2 ms to minimize.
[2023-03-11 09:11:01] [INFO ] Deduced a trap composed of 80 places in 366 ms of which 2 ms to minimize.
[2023-03-11 09:11:02] [INFO ] Deduced a trap composed of 109 places in 265 ms of which 1 ms to minimize.
[2023-03-11 09:11:02] [INFO ] Deduced a trap composed of 45 places in 326 ms of which 2 ms to minimize.
[2023-03-11 09:11:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1542 ms
[2023-03-11 09:11:02] [INFO ] Deduced a trap composed of 114 places in 332 ms of which 1 ms to minimize.
[2023-03-11 09:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-11 09:11:03] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 1 ms to minimize.
[2023-03-11 09:11:03] [INFO ] Deduced a trap composed of 83 places in 189 ms of which 1 ms to minimize.
[2023-03-11 09:11:03] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 0 ms to minimize.
[2023-03-11 09:11:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 727 ms
[2023-03-11 09:11:03] [INFO ] After 3725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-11 09:11:04] [INFO ] After 4341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 94 ms.
Support contains 16 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 544/544 transitions.
Graph (trivial) has 443 edges and 410 vertex of which 67 / 410 are part of one of the 20 SCC in 7 ms
Free SCC test removed 47 places
Drop transitions removed 75 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 809 edges and 363 vertex of which 354 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 354 transition count 327
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 156 rules applied. Total rules applied 299 place count 213 transition count 312
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 310 place count 205 transition count 309
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 313 place count 202 transition count 309
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 313 place count 202 transition count 303
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 325 place count 196 transition count 303
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 334 place count 187 transition count 286
Iterating global reduction 4 with 9 rules applied. Total rules applied 343 place count 187 transition count 286
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 348 place count 187 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 353 place count 182 transition count 281
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 362 place count 173 transition count 267
Iterating global reduction 6 with 9 rules applied. Total rules applied 371 place count 173 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 374 place count 173 transition count 264
Performed 56 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 486 place count 117 transition count 206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 498 place count 117 transition count 194
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 507 place count 108 transition count 176
Iterating global reduction 8 with 9 rules applied. Total rules applied 516 place count 108 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 530 place count 101 transition count 224
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 531 place count 101 transition count 223
Free-agglomeration rule applied 28 times.
Iterating global reduction 8 with 28 rules applied. Total rules applied 559 place count 101 transition count 195
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 587 place count 73 transition count 195
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 591 place count 73 transition count 191
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 606 place count 73 transition count 191
Applied a total of 606 rules in 207 ms. Remains 73 /410 variables (removed 337) and now considering 191/544 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 73/410 places, 191/544 transitions.
Incomplete random walk after 10000 steps, including 845 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 143 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 09:11:04] [INFO ] Flow matrix only has 179 transitions (discarded 12 similar events)
// Phase 1: matrix 179 rows 73 cols
[2023-03-11 09:11:04] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-11 09:11:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 09:11:05] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 09:11:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 09:11:05] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 09:11:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 09:11:05] [INFO ] After 55ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 09:11:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-11 09:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-11 09:11:05] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2023-03-11 09:11:05] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2023-03-11 09:11:05] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-11 09:11:05] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-03-11 09:11:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 362 ms
[2023-03-11 09:11:05] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-11 09:11:05] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 10 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 191/191 transitions.
Graph (trivial) has 21 edges and 73 vertex of which 2 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 71 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 70 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 185
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 68 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 65 transition count 182
Applied a total of 15 rules in 55 ms. Remains 65 /73 variables (removed 8) and now considering 182/191 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 65/73 places, 182/191 transitions.
Incomplete random walk after 10000 steps, including 894 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 09:11:06] [INFO ] Flow matrix only has 170 transitions (discarded 12 similar events)
// Phase 1: matrix 170 rows 65 cols
[2023-03-11 09:11:06] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 09:11:06] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 09:11:06] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 09:11:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 09:11:06] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 09:11:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 09:11:06] [INFO ] After 45ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 09:11:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-11 09:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-11 09:11:06] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-03-11 09:11:06] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-11 09:11:07] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-03-11 09:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2023-03-11 09:11:07] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 09:11:07] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 182/182 transitions.
Graph (trivial) has 14 edges and 65 vertex of which 2 / 65 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 301 edges and 64 vertex of which 55 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 55 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 54 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 50 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 50 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 49 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 49 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 49 transition count 140
Performed 5 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
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 52 place count 44 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 44 transition count 123
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 44 transition count 119
Applied a total of 57 rules in 49 ms. Remains 44 /65 variables (removed 21) and now considering 119/182 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 44/65 places, 119/182 transitions.
Incomplete random walk after 10000 steps, including 1900 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 242 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 09:11:07] [INFO ] Flow matrix only has 106 transitions (discarded 13 similar events)
// Phase 1: matrix 106 rows 44 cols
[2023-03-11 09:11:07] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 09:11:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 09:11:07] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 09:11:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 09:11:07] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 09:11:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 09:11:07] [INFO ] After 32ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 09:11:07] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 09:11:07] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 119/119 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 44 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 40 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 39 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 39 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 38 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 38 transition count 110
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 35 transition count 104
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 35 transition count 103
Applied a total of 21 rules in 22 ms. Remains 35 /44 variables (removed 9) and now considering 103/119 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 35/44 places, 103/119 transitions.
Incomplete random walk after 10000 steps, including 1907 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1947 steps, run visited all 2 properties in 37 ms. (steps per millisecond=52 )
Probabilistic random walk after 1947 steps, saw 751 distinct states, run finished after 38 ms. (steps per millisecond=51 ) properties seen :2
Computed a total of 114 stabilizing places and 124 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 396 transition count 528
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 396 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 396 transition count 527
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 39 place count 386 transition count 513
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 386 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 386 transition count 512
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 378 transition count 498
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 378 transition count 498
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 372 transition count 490
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 372 transition count 490
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 367 transition count 480
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 367 transition count 480
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 362 transition count 474
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 362 transition count 474
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 358 transition count 469
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 358 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 358 transition count 466
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 357 transition count 464
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 357 transition count 464
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 357 transition count 461
Applied a total of 114 rules in 170 ms. Remains 357 /410 variables (removed 53) and now considering 461/544 (removed 83) transitions.
// Phase 1: matrix 461 rows 357 cols
[2023-03-11 09:11:08] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-11 09:11:08] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-11 09:11:08] [INFO ] Invariant cache hit.
[2023-03-11 09:11:09] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-11 09:11:09] [INFO ] Invariant cache hit.
[2023-03-11 09:11:09] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 357/410 places, 461/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1066 ms. Remains : 357/410 places, 461/544 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s356 0) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 700 ms.
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-00 finished in 2796 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||(G(p2)&&p1))))))'
Support contains 6 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 399 transition count 531
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 399 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 399 transition count 530
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 392 transition count 520
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 392 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 392 transition count 519
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 387 transition count 509
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 387 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 385 transition count 505
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 385 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 384 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 384 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 383 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 383 transition count 502
Applied a total of 56 rules in 73 ms. Remains 383 /410 variables (removed 27) and now considering 502/544 (removed 42) transitions.
// Phase 1: matrix 502 rows 383 cols
[2023-03-11 09:11:11] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-11 09:11:11] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-11 09:11:11] [INFO ] Invariant cache hit.
[2023-03-11 09:11:11] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-11 09:11:11] [INFO ] Invariant cache hit.
[2023-03-11 09:11:12] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 383/410 places, 502/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 383/410 places, 502/544 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s110 0) (EQ s115 1)), p1:(AND (EQ s3 0) (EQ s303 1)), p2:(AND (EQ s78 0) (EQ s349 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 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-02 finished in 1266 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 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Graph (trivial) has 469 edges and 410 vertex of which 69 / 410 are part of one of the 21 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 361 transition count 333
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 172 rules applied. Total rules applied 327 place count 207 transition count 315
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 337 place count 198 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 197 transition count 314
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 338 place count 197 transition count 308
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 350 place count 191 transition count 308
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 376 place count 165 transition count 263
Iterating global reduction 4 with 26 rules applied. Total rules applied 402 place count 165 transition count 263
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 408 place count 165 transition count 257
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 414 place count 159 transition count 257
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 426 place count 147 transition count 237
Iterating global reduction 6 with 12 rules applied. Total rules applied 438 place count 147 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 441 place count 147 transition count 234
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 445 place count 143 transition count 229
Iterating global reduction 7 with 4 rules applied. Total rules applied 449 place count 143 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 452 place count 143 transition count 226
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 453 place count 142 transition count 225
Iterating global reduction 8 with 1 rules applied. Total rules applied 454 place count 142 transition count 225
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 455 place count 141 transition count 223
Iterating global reduction 8 with 1 rules applied. Total rules applied 456 place count 141 transition count 223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 457 place count 140 transition count 221
Iterating global reduction 8 with 1 rules applied. Total rules applied 458 place count 140 transition count 221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 459 place count 139 transition count 219
Iterating global reduction 8 with 1 rules applied. Total rules applied 460 place count 139 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 463 place count 139 transition count 216
Performed 51 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 565 place count 88 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 570 place count 88 transition count 155
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 577 place count 81 transition count 141
Iterating global reduction 10 with 7 rules applied. Total rules applied 584 place count 81 transition count 141
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 587 place count 78 transition count 136
Iterating global reduction 10 with 3 rules applied. Total rules applied 590 place count 78 transition count 136
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 591 place count 77 transition count 134
Iterating global reduction 10 with 1 rules applied. Total rules applied 592 place count 77 transition count 134
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 593 place count 76 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 594 place count 76 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 597 place count 76 transition count 127
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 607 place count 71 transition count 187
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 609 place count 69 transition count 181
Iterating global reduction 11 with 2 rules applied. Total rules applied 611 place count 69 transition count 181
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 612 place count 68 transition count 177
Iterating global reduction 11 with 1 rules applied. Total rules applied 613 place count 68 transition count 177
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 634 place count 68 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 636 place count 67 transition count 167
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 637 place count 66 transition count 164
Iterating global reduction 11 with 1 rules applied. Total rules applied 638 place count 66 transition count 164
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 641 place count 63 transition count 159
Iterating global reduction 11 with 3 rules applied. Total rules applied 644 place count 63 transition count 159
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 655 place count 63 transition count 148
Applied a total of 655 rules in 140 ms. Remains 63 /410 variables (removed 347) and now considering 148/544 (removed 396) transitions.
[2023-03-11 09:11:12] [INFO ] Flow matrix only has 134 transitions (discarded 14 similar events)
// Phase 1: matrix 134 rows 63 cols
[2023-03-11 09:11:12] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 09:11:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 09:11:12] [INFO ] Flow matrix only has 134 transitions (discarded 14 similar events)
[2023-03-11 09:11:12] [INFO ] Invariant cache hit.
[2023-03-11 09:11:12] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 09:11:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 09:11:12] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 09:11:12] [INFO ] Flow matrix only has 134 transitions (discarded 14 similar events)
[2023-03-11 09:11:12] [INFO ] Invariant cache hit.
[2023-03-11 09:11:13] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/410 places, 148/544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 556 ms. Remains : 63/410 places, 148/544 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 188 steps with 12 reset in 3 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-04 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 531
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 398 transition count 530
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 389 transition count 518
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 389 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 389 transition count 517
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 382 transition count 505
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 382 transition count 505
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 376 transition count 497
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 376 transition count 497
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 371 transition count 487
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 371 transition count 487
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 367 transition count 482
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 367 transition count 482
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 363 transition count 477
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 363 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 363 transition count 474
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 362 transition count 472
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 362 transition count 472
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 104 place count 362 transition count 469
Applied a total of 104 rules in 114 ms. Remains 362 /410 variables (removed 48) and now considering 469/544 (removed 75) transitions.
// Phase 1: matrix 469 rows 362 cols
[2023-03-11 09:11:13] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-11 09:11:13] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-11 09:11:13] [INFO ] Invariant cache hit.
[2023-03-11 09:11:13] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-11 09:11:13] [INFO ] Invariant cache hit.
[2023-03-11 09:11:14] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/410 places, 469/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1141 ms. Remains : 362/410 places, 469/544 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s332 0) (NEQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-05 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Graph (trivial) has 470 edges and 410 vertex of which 72 / 410 are part of one of the 21 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 157 place count 358 transition count 326
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 174 rules applied. Total rules applied 331 place count 202 transition count 308
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 340 place count 193 transition count 308
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 340 place count 193 transition count 303
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 188 transition count 303
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 376 place count 162 transition count 258
Iterating global reduction 3 with 26 rules applied. Total rules applied 402 place count 162 transition count 258
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 408 place count 162 transition count 252
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 414 place count 156 transition count 252
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 426 place count 144 transition count 232
Iterating global reduction 5 with 12 rules applied. Total rules applied 438 place count 144 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 441 place count 144 transition count 229
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 445 place count 140 transition count 224
Iterating global reduction 6 with 4 rules applied. Total rules applied 449 place count 140 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 452 place count 140 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 453 place count 139 transition count 220
Iterating global reduction 7 with 1 rules applied. Total rules applied 454 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 455 place count 138 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 456 place count 138 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 457 place count 137 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 458 place count 137 transition count 216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 459 place count 136 transition count 214
Iterating global reduction 7 with 1 rules applied. Total rules applied 460 place count 136 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 463 place count 136 transition count 211
Performed 52 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 8 with 104 rules applied. Total rules applied 567 place count 84 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 572 place count 84 transition count 149
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 579 place count 77 transition count 135
Iterating global reduction 9 with 7 rules applied. Total rules applied 586 place count 77 transition count 135
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 589 place count 74 transition count 130
Iterating global reduction 9 with 3 rules applied. Total rules applied 592 place count 74 transition count 130
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 593 place count 73 transition count 128
Iterating global reduction 9 with 1 rules applied. Total rules applied 594 place count 73 transition count 128
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 595 place count 72 transition count 124
Iterating global reduction 9 with 1 rules applied. Total rules applied 596 place count 72 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 599 place count 72 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 607 place count 68 transition count 166
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 609 place count 66 transition count 160
Iterating global reduction 10 with 2 rules applied. Total rules applied 611 place count 66 transition count 160
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 612 place count 65 transition count 156
Iterating global reduction 10 with 1 rules applied. Total rules applied 613 place count 65 transition count 156
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 629 place count 65 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 631 place count 64 transition count 151
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 632 place count 63 transition count 148
Iterating global reduction 10 with 1 rules applied. Total rules applied 633 place count 63 transition count 148
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 636 place count 60 transition count 143
Iterating global reduction 10 with 3 rules applied. Total rules applied 639 place count 60 transition count 143
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 650 place count 60 transition count 132
Applied a total of 650 rules in 90 ms. Remains 60 /410 variables (removed 350) and now considering 132/544 (removed 412) transitions.
[2023-03-11 09:11:14] [INFO ] Flow matrix only has 122 transitions (discarded 10 similar events)
// Phase 1: matrix 122 rows 60 cols
[2023-03-11 09:11:14] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 09:11:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 09:11:14] [INFO ] Flow matrix only has 122 transitions (discarded 10 similar events)
[2023-03-11 09:11:14] [INFO ] Invariant cache hit.
[2023-03-11 09:11:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 09:11:14] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-11 09:11:14] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-11 09:11:14] [INFO ] Flow matrix only has 122 transitions (discarded 10 similar events)
[2023-03-11 09:11:14] [INFO ] Invariant cache hit.
[2023-03-11 09:11:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/410 places, 132/544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 60/410 places, 132/544 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-06 finished in 588 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 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 530
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 530
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 388 transition count 516
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 388 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 388 transition count 515
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 380 transition count 501
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 380 transition count 501
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 374 transition count 493
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 374 transition count 493
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 369 transition count 483
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 369 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 88 place count 364 transition count 477
Iterating global reduction 1 with 5 rules applied. Total rules applied 93 place count 364 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 361 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 361 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 361 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 360 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 360 transition count 466
Applied a total of 106 rules in 75 ms. Remains 360 /410 variables (removed 50) and now considering 466/544 (removed 78) transitions.
// Phase 1: matrix 466 rows 360 cols
[2023-03-11 09:11:15] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-11 09:11:15] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-11 09:11:15] [INFO ] Invariant cache hit.
[2023-03-11 09:11:15] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-11 09:11:15] [INFO ] Invariant cache hit.
[2023-03-11 09:11:16] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/410 places, 466/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 360/410 places, 466/544 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s191 1), p0:(OR (EQ s334 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-07 finished in 1368 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 U G((!p1||X(F(p2)))))))'
Support contains 6 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 530
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 398 transition count 529
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 389 transition count 516
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 389 transition count 516
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 381 transition count 502
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 381 transition count 502
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 375 transition count 494
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 375 transition count 494
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 370 transition count 484
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 370 transition count 484
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 365 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 365 transition count 478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 361 transition count 473
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 361 transition count 473
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 361 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 360 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 360 transition count 468
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 360 transition count 465
Applied a total of 107 rules in 88 ms. Remains 360 /410 variables (removed 50) and now considering 465/544 (removed 79) transitions.
// Phase 1: matrix 465 rows 360 cols
[2023-03-11 09:11:16] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-11 09:11:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-11 09:11:16] [INFO ] Invariant cache hit.
[2023-03-11 09:11:17] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-11 09:11:17] [INFO ] Invariant cache hit.
[2023-03-11 09:11:17] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/410 places, 465/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1238 ms. Remains : 360/410 places, 465/544 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s229 0) (EQ s178 1)), p1:(OR (EQ s52 0) (EQ s189 1)), p2:(OR (EQ s84 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25041 reset in 429 ms.
Product exploration explored 100000 steps with 24951 reset in 475 ms.
Computed a total of 112 stabilizing places and 120 stable transitions
Computed a total of 112 stabilizing places and 120 stable transitions
Detected a total of 112/360 stabilizing places and 120/465 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1010 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 09:11:21] [INFO ] Invariant cache hit.
[2023-03-11 09:11:21] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 09:11:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2023-03-11 09:11:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 79 ms returned sat
[2023-03-11 09:11:22] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-11 09:11:22] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-11 09:11:22] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 465/465 transitions.
Graph (trivial) has 398 edges and 360 vertex of which 58 / 360 are part of one of the 20 SCC in 1 ms
Free SCC test removed 38 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 703 edges and 322 vertex of which 313 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 313 transition count 265
Reduce places removed 136 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 149 rules applied. Total rules applied 287 place count 177 transition count 252
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 298 place count 170 transition count 248
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 302 place count 166 transition count 248
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 302 place count 166 transition count 243
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 312 place count 161 transition count 243
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 322 place count 151 transition count 224
Iterating global reduction 4 with 10 rules applied. Total rules applied 332 place count 151 transition count 224
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 337 place count 151 transition count 219
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 342 place count 146 transition count 219
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 351 place count 137 transition count 205
Iterating global reduction 6 with 9 rules applied. Total rules applied 360 place count 137 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 363 place count 137 transition count 202
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 467 place count 85 transition count 146
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 478 place count 85 transition count 135
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 486 place count 77 transition count 119
Iterating global reduction 8 with 8 rules applied. Total rules applied 494 place count 77 transition count 119
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 497 place count 74 transition count 114
Iterating global reduction 8 with 3 rules applied. Total rules applied 500 place count 74 transition count 114
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 502 place count 72 transition count 106
Iterating global reduction 8 with 2 rules applied. Total rules applied 504 place count 72 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 507 place count 72 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 519 place count 66 transition count 158
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 521 place count 66 transition count 156
Free-agglomeration rule applied 22 times with reduction of 5 identical transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 543 place count 66 transition count 129
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 565 place count 44 transition count 129
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 570 place count 44 transition count 124
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 575 place count 44 transition count 124
Applied a total of 575 rules in 64 ms. Remains 44 /360 variables (removed 316) and now considering 124/465 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 44/360 places, 124/465 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:11:22] [INFO ] Flow matrix only has 113 transitions (discarded 11 similar events)
// Phase 1: matrix 113 rows 44 cols
[2023-03-11 09:11:22] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 09:11:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:11:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 09:11:22] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:11:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-11 09:11:22] [INFO ] After 18ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 09:11:23] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 09:11:23] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 124/124 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 44/44 places, 124/124 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20226 steps, run visited all 1 properties in 100 ms. (steps per millisecond=202 )
Probabilistic random walk after 20226 steps, saw 5204 distinct states, run finished after 101 ms. (steps per millisecond=200 ) properties seen :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 18 factoid took 1288 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 174 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 360 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 465/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 360 cols
[2023-03-11 09:11:24] [INFO ] Computed 18 place invariants in 6 ms
[2023-03-11 09:11:25] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 09:11:25] [INFO ] Invariant cache hit.
[2023-03-11 09:11:25] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-11 09:11:25] [INFO ] Invariant cache hit.
[2023-03-11 09:11:26] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1254 ms. Remains : 360/360 places, 465/465 transitions.
Computed a total of 112 stabilizing places and 120 stable transitions
Computed a total of 112 stabilizing places and 120 stable transitions
Detected a total of 112/360 stabilizing places and 120/465 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X p1), true, (X (X p1)), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 887524 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{1=1}
Probabilistic random walk after 887524 steps, saw 182944 distinct states, run finished after 3003 ms. (steps per millisecond=295 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-11 09:11:29] [INFO ] Invariant cache hit.
[2023-03-11 09:11:30] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:11:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-11 09:11:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 79 ms returned sat
[2023-03-11 09:11:30] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:11:30] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 09:11:30] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 465/465 transitions.
Graph (trivial) has 405 edges and 360 vertex of which 58 / 360 are part of one of the 20 SCC in 2 ms
Free SCC test removed 38 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 703 edges and 322 vertex of which 313 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 313 transition count 258
Reduce places removed 143 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 156 rules applied. Total rules applied 301 place count 170 transition count 245
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 308 place count 163 transition count 245
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 308 place count 163 transition count 240
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 318 place count 158 transition count 240
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 328 place count 148 transition count 221
Iterating global reduction 3 with 10 rules applied. Total rules applied 338 place count 148 transition count 221
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 343 place count 148 transition count 216
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 348 place count 143 transition count 216
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 357 place count 134 transition count 202
Iterating global reduction 5 with 9 rules applied. Total rules applied 366 place count 134 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 369 place count 134 transition count 199
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 477 place count 80 transition count 141
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 488 place count 80 transition count 130
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 496 place count 72 transition count 114
Iterating global reduction 7 with 8 rules applied. Total rules applied 504 place count 72 transition count 114
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 507 place count 69 transition count 109
Iterating global reduction 7 with 3 rules applied. Total rules applied 510 place count 69 transition count 109
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 512 place count 67 transition count 101
Iterating global reduction 7 with 2 rules applied. Total rules applied 514 place count 67 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 517 place count 67 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 527 place count 62 transition count 145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 528 place count 61 transition count 143
Iterating global reduction 8 with 1 rules applied. Total rules applied 529 place count 61 transition count 143
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 538 place count 61 transition count 134
Free-agglomeration rule applied 27 times with reduction of 5 identical transitions.
Iterating global reduction 8 with 27 rules applied. Total rules applied 565 place count 61 transition count 102
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 592 place count 34 transition count 102
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 599 place count 34 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 604 place count 34 transition count 95
Applied a total of 604 rules in 58 ms. Remains 34 /360 variables (removed 326) and now considering 95/465 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 34/360 places, 95/465 transitions.
Finished random walk after 1529 steps, including 154 resets, run visited all 1 properties in 7 ms. (steps per millisecond=218 )
Knowledge obtained : [(AND p1 p2), (X p1), true, (X (X p1)), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33294 reset in 361 ms.
Product exploration explored 100000 steps with 33317 reset in 378 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 465/465 transitions.
Graph (trivial) has 404 edges and 360 vertex of which 58 / 360 are part of one of the 20 SCC in 0 ms
Free SCC test removed 38 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 322 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 142 place count 322 transition count 415
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 142 place count 322 transition count 415
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 322 transition count 415
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 240 place count 229 transition count 317
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 333 place count 229 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 225 transition count 313
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 225 transition count 313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 344 place count 225 transition count 310
Performed 60 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 404 place count 225 transition count 337
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 413 place count 225 transition count 328
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 465 place count 173 transition count 259
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 4 with 52 rules applied. Total rules applied 517 place count 173 transition count 259
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 520 place count 170 transition count 254
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 523 place count 170 transition count 254
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 529 place count 164 transition count 236
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 535 place count 164 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 538 place count 164 transition count 233
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 5 with 18 rules applied. Total rules applied 556 place count 164 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 557 place count 164 transition count 390
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 575 place count 146 transition count 341
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 6 with 18 rules applied. Total rules applied 593 place count 146 transition count 341
Deduced a syphon composed of 74 places in 0 ms
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 616 place count 146 transition count 318
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 624 place count 138 transition count 294
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 632 place count 138 transition count 294
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 635 place count 135 transition count 289
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 638 place count 135 transition count 289
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 639 place count 134 transition count 288
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 134 transition count 288
Deduced a syphon composed of 66 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 643 place count 134 transition count 285
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 643 rules in 125 ms. Remains 134 /360 variables (removed 226) and now considering 285/465 (removed 180) transitions.
[2023-03-11 09:11:32] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-11 09:11:32] [INFO ] Flow matrix only has 269 transitions (discarded 16 similar events)
// Phase 1: matrix 269 rows 134 cols
[2023-03-11 09:11:32] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 09:11:33] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/360 places, 285/465 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 464 ms. Remains : 134/360 places, 285/465 transitions.
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 465/465 transitions.
Applied a total of 0 rules in 14 ms. Remains 360 /360 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 360 cols
[2023-03-11 09:11:33] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-11 09:11:33] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-11 09:11:33] [INFO ] Invariant cache hit.
[2023-03-11 09:11:33] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-11 09:11:33] [INFO ] Invariant cache hit.
[2023-03-11 09:11:34] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 360/360 places, 465/465 transitions.
Treatment of property HealthRecord-PT-17-LTLCardinality-09 finished in 18161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Graph (trivial) has 466 edges and 410 vertex of which 72 / 410 are part of one of the 21 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 358 transition count 333
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 167 rules applied. Total rules applied 317 place count 209 transition count 315
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 326 place count 200 transition count 315
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 326 place count 200 transition count 310
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 336 place count 195 transition count 310
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 359 place count 172 transition count 272
Iterating global reduction 3 with 23 rules applied. Total rules applied 382 place count 172 transition count 272
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 388 place count 172 transition count 266
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 394 place count 166 transition count 266
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 405 place count 155 transition count 248
Iterating global reduction 5 with 11 rules applied. Total rules applied 416 place count 155 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 419 place count 155 transition count 245
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 422 place count 152 transition count 242
Iterating global reduction 6 with 3 rules applied. Total rules applied 425 place count 152 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 428 place count 152 transition count 239
Performed 54 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 536 place count 98 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 543 place count 98 transition count 176
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 551 place count 90 transition count 160
Iterating global reduction 8 with 8 rules applied. Total rules applied 559 place count 90 transition count 160
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 561 place count 88 transition count 157
Iterating global reduction 8 with 2 rules applied. Total rules applied 563 place count 88 transition count 157
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 87 transition count 155
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 87 transition count 155
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 86 transition count 151
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 86 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 575 place count 82 transition count 188
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 576 place count 81 transition count 186
Iterating global reduction 8 with 1 rules applied. Total rules applied 577 place count 81 transition count 186
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 578 place count 80 transition count 182
Iterating global reduction 8 with 1 rules applied. Total rules applied 579 place count 80 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 583 place count 80 transition count 178
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 598 place count 80 transition count 163
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 9 with 2 rules applied. Total rules applied 600 place count 79 transition count 176
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 608 place count 79 transition count 168
Applied a total of 608 rules in 67 ms. Remains 79 /410 variables (removed 331) and now considering 168/544 (removed 376) transitions.
[2023-03-11 09:11:34] [INFO ] Flow matrix only has 158 transitions (discarded 10 similar events)
// Phase 1: matrix 158 rows 79 cols
[2023-03-11 09:11:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 09:11:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 09:11:34] [INFO ] Flow matrix only has 158 transitions (discarded 10 similar events)
[2023-03-11 09:11:34] [INFO ] Invariant cache hit.
[2023-03-11 09:11:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 09:11:34] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-11 09:11:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 09:11:34] [INFO ] Flow matrix only has 158 transitions (discarded 10 similar events)
[2023-03-11 09:11:34] [INFO ] Invariant cache hit.
[2023-03-11 09:11:34] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/410 places, 168/544 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 ms. Remains : 79/410 places, 168/544 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (NEQ s55 0) (NEQ s13 1)) (AND (NEQ s4 0) (NEQ s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-11 finished in 497 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 U G((!p1||X(F(p2)))))))'
Found a Lengthening insensitive property : HealthRecord-PT-17-LTLCardinality-09
Stuttering acceptance computed with spot in 230 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p2) p1)]
Support contains 6 out of 410 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 410/410 places, 544/544 transitions.
Graph (trivial) has 463 edges and 410 vertex of which 70 / 410 are part of one of the 20 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 359 transition count 336
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 163 rules applied. Total rules applied 311 place count 212 transition count 320
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 323 place count 204 transition count 316
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 327 place count 200 transition count 316
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 327 place count 200 transition count 311
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 337 place count 195 transition count 311
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 362 place count 170 transition count 267
Iterating global reduction 4 with 25 rules applied. Total rules applied 387 place count 170 transition count 267
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 393 place count 170 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 399 place count 164 transition count 261
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 411 place count 152 transition count 241
Iterating global reduction 6 with 12 rules applied. Total rules applied 423 place count 152 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 426 place count 152 transition count 238
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 430 place count 148 transition count 233
Iterating global reduction 7 with 4 rules applied. Total rules applied 434 place count 148 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 437 place count 148 transition count 230
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 438 place count 147 transition count 229
Iterating global reduction 8 with 1 rules applied. Total rules applied 439 place count 147 transition count 229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 440 place count 146 transition count 227
Iterating global reduction 8 with 1 rules applied. Total rules applied 441 place count 146 transition count 227
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 442 place count 145 transition count 225
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 145 transition count 225
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 444 place count 144 transition count 223
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 144 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 448 place count 144 transition count 220
Performed 50 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 9 with 100 rules applied. Total rules applied 548 place count 94 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 553 place count 94 transition count 160
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 560 place count 87 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 567 place count 87 transition count 146
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 570 place count 84 transition count 141
Iterating global reduction 10 with 3 rules applied. Total rules applied 573 place count 84 transition count 141
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 574 place count 83 transition count 139
Iterating global reduction 10 with 1 rules applied. Total rules applied 575 place count 83 transition count 139
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 576 place count 82 transition count 135
Iterating global reduction 10 with 1 rules applied. Total rules applied 577 place count 82 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 580 place count 82 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 590 place count 77 transition count 190
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 591 place count 76 transition count 186
Iterating global reduction 11 with 1 rules applied. Total rules applied 592 place count 76 transition count 186
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 593 place count 75 transition count 182
Iterating global reduction 11 with 1 rules applied. Total rules applied 594 place count 75 transition count 182
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 596 place count 75 transition count 182
Applied a total of 596 rules in 59 ms. Remains 75 /410 variables (removed 335) and now considering 182/544 (removed 362) transitions.
[2023-03-11 09:11:35] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
// Phase 1: matrix 172 rows 75 cols
[2023-03-11 09:11:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 09:11:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 09:11:35] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:35] [INFO ] Invariant cache hit.
[2023-03-11 09:11:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 09:11:35] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-11 09:11:35] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:35] [INFO ] Invariant cache hit.
[2023-03-11 09:11:35] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 75/410 places, 182/544 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 429 ms. Remains : 75/410 places, 182/544 transitions.
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s32 1)), p1:(OR (EQ s9 0) (EQ s36 1)), p2:(OR (EQ s16 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25018 reset in 402 ms.
Product exploration explored 100000 steps with 25142 reset in 491 ms.
Computed a total of 7 stabilizing places and 32 stable transitions
Computed a total of 7 stabilizing places and 32 stable transitions
Detected a total of 7/75 stabilizing places and 32/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 868 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 802 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 09:11:38] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:38] [INFO ] Invariant cache hit.
[2023-03-11 09:11:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 09:11:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 09:11:38] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 09:11:38] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-11 09:11:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 09:11:38] [INFO ] After 32ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-11 09:11:38] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 09:11:38] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 182/182 transitions.
Graph (complete) has 278 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 74 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 71 transition count 165
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 67 transition count 160
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 44 place count 67 transition count 144
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 67 transition count 142
Free-agglomeration rule applied 24 times with reduction of 5 identical transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 67 transition count 113
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 94 place count 43 transition count 113
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 99 place count 43 transition count 108
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 104 place count 43 transition count 108
Applied a total of 104 rules in 25 ms. Remains 43 /75 variables (removed 32) and now considering 108/182 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 43/75 places, 108/182 transitions.
Finished random walk after 9508 steps, including 730 resets, run visited all 2 properties in 81 ms. (steps per millisecond=117 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 18 factoid took 1253 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-11 09:11:40] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:40] [INFO ] Invariant cache hit.
[2023-03-11 09:11:40] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 09:11:40] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:40] [INFO ] Invariant cache hit.
[2023-03-11 09:11:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 09:11:40] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-11 09:11:40] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:40] [INFO ] Invariant cache hit.
[2023-03-11 09:11:41] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 75/75 places, 182/182 transitions.
Computed a total of 7 stabilizing places and 32 stable transitions
Computed a total of 7 stabilizing places and 32 stable transitions
Detected a total of 7/75 stabilizing places and 32/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X p1), true, (X (X p1)), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 796 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:11:41] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:41] [INFO ] Invariant cache hit.
[2023-03-11 09:11:41] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:11:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 09:11:41] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 09:11:41] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:11:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 09:11:41] [INFO ] After 15ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 09:11:41] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 09:11:41] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 182/182 transitions.
Graph (complete) has 278 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 74 transition count 166
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 24 place count 69 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 69 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 68 transition count 162
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 63 transition count 156
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 52 place count 63 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 62 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 62 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 153
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 151
Free-agglomeration rule applied 23 times with reduction of 5 identical transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 81 place count 61 transition count 123
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 104 place count 38 transition count 123
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 38 transition count 117
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 115 place count 38 transition count 117
Applied a total of 115 rules in 28 ms. Remains 38 /75 variables (removed 37) and now considering 117/182 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 38/75 places, 117/182 transitions.
Finished random walk after 265 steps, including 29 resets, run visited all 1 properties in 2 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND p1 p2), (X p1), true, (X (X p1)), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 416 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33355 reset in 413 ms.
Product exploration explored 100000 steps with 33303 reset in 350 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 182/182 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 75 transition count 184
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 75 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 74 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 74 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 74 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 73 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 73 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 32 place count 73 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 73 /75 variables (removed 2) and now considering 176/182 (removed 6) transitions.
[2023-03-11 09:11:43] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 09:11:43] [INFO ] Flow matrix only has 162 transitions (discarded 14 similar events)
// Phase 1: matrix 162 rows 73 cols
[2023-03-11 09:11:43] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 09:11:44] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/75 places, 176/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 73/75 places, 176/182 transitions.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-11 09:11:44] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
// Phase 1: matrix 172 rows 75 cols
[2023-03-11 09:11:44] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 09:11:44] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 09:11:44] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:44] [INFO ] Invariant cache hit.
[2023-03-11 09:11:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 09:11:44] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-11 09:11:44] [INFO ] Flow matrix only has 172 transitions (discarded 10 similar events)
[2023-03-11 09:11:44] [INFO ] Invariant cache hit.
[2023-03-11 09:11:44] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 75/75 places, 182/182 transitions.
Treatment of property HealthRecord-PT-17-LTLCardinality-09 finished in 9511 ms.
[2023-03-11 09:11:44] [INFO ] Flatten gal took : 31 ms
[2023-03-11 09:11:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 09:11:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 544 transitions and 1295 arcs took 6 ms.
Total runtime 50629 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-17
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA HealthRecord-PT-17-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678525906019

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-17-LTLCardinality-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-17-LTLCardinality-09
lola: result : false
lola: markings : 4905
lola: fired transitions : 8817
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-17-LTLCardinality-09: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-17, 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 r199-smll-167840345900363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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