Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 125K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201754149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:29:15] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 00:29:15] [INFO ] Transformed 453 places.
[2024-06-01 00:29:15] [INFO ] Transformed 594 transitions.
[2024-06-01 00:29:15] [INFO ] Found NUPN structural information;
[2024-06-01 00:29:15] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 375 transition count 503
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 375 transition count 503
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 188 place count 343 transition count 462
Iterating global reduction 0 with 32 rules applied. Total rules applied 220 place count 343 transition count 462
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 223 place count 343 transition count 459
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 239 place count 327 transition count 429
Iterating global reduction 1 with 16 rules applied. Total rules applied 255 place count 327 transition count 429
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 262 place count 320 transition count 417
Iterating global reduction 1 with 7 rules applied. Total rules applied 269 place count 320 transition count 417
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 270 place count 319 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 319 transition count 414
Applied a total of 271 rules in 105 ms. Remains 319 /453 variables (removed 134) and now considering 414/594 (removed 180) transitions.
// Phase 1: matrix 414 rows 319 cols
[2024-06-01 00:29:15] [INFO ] Computed 14 invariants in 20 ms
[2024-06-01 00:29:16] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 00:29:16] [INFO ] Invariant cache hit.
[2024-06-01 00:29:16] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-06-01 00:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 43 ms to minimize.
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 149 places in 125 ms of which 3 ms to minimize.
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 3 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 157 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 144 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 156 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:23] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:29:23] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:23] [INFO ] Deduced a trap composed of 136 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 135 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 127 places in 94 ms of which 3 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 3 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-06-01 00:29:31] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:29:31] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 414/733 variables, 319/361 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:29:39] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:29:39] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:29:40] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:29:40] [INFO ] Deduced a trap composed of 155 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 366 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/319 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:29:49] [INFO ] Deduced a trap composed of 150 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:29:49] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 414/733 variables, 319/368 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 413/781 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-01 00:30:04] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/733 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 782 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 36/36 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 319/453 places, 414/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61134 ms. Remains : 319/453 places, 414/594 transitions.
Support contains 32 out of 319 places after structural reductions.
[2024-06-01 00:30:16] [INFO ] Flatten gal took : 51 ms
[2024-06-01 00:30:17] [INFO ] Flatten gal took : 21 ms
[2024-06-01 00:30:17] [INFO ] Input system was already deterministic with 414 transitions.
Support contains 30 out of 319 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (325 resets) in 1833 ms. (21 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40004 steps (47 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (60 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 128 ms. (310 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (69 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (65 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (67 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (47 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
[2024-06-01 00:30:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 114/125 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 194/319 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 414/733 variables, 319/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:18] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/733 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 733/733 variables, and 337 constraints, problems are : Problem set: 0 solved, 6 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 114/125 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 194/319 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 414/733 variables, 319/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/733 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/733 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/733 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/733 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/733 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 733/733 variables, and 346 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 1772ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 161 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=53 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 1072 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 92 stabilizing places and 99 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 307 transition count 399
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 307 transition count 399
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 307 transition count 398
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 302 transition count 390
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 302 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 302 transition count 389
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 299 transition count 383
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 299 transition count 383
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 297 transition count 380
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 297 transition count 380
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 295 transition count 376
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 295 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 295 transition count 375
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 294 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 294 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 293 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 293 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 293 transition count 372
Applied a total of 56 rules in 40 ms. Remains 293 /319 variables (removed 26) and now considering 372/414 (removed 42) transitions.
// Phase 1: matrix 372 rows 293 cols
[2024-06-01 00:30:21] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 00:30:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 00:30:21] [INFO ] Invariant cache hit.
[2024-06-01 00:30:21] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-01 00:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 152 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 140 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:30:27] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:30:27] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:30:27] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:30:27] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:30:27] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:30:28] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:30:28] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/665 variables, 293/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 325 constraints, problems are : Problem set: 0 solved, 371 unsolved in 21802 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:30:45] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:30:45] [INFO ] Deduced a trap composed of 120 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:30:49] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:30:49] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:30:49] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 372/665 variables, 293/332 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 371/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 703 constraints, problems are : Problem set: 0 solved, 371 unsolved in 25478 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 25/25 constraints]
After SMT, in 47336ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 47340ms
Starting structural reductions in LTL mode, iteration 1 : 293/319 places, 372/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47644 ms. Remains : 293/319 places, 372/414 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 71 reset in 237 ms.
Product exploration explored 100000 steps with 125 reset in 143 ms.
Computed a total of 89 stabilizing places and 94 stable transitions
Computed a total of 89 stabilizing places and 94 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (277 resets) in 425 ms. (93 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (71 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (59 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
[2024-06-01 00:31:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 372/665 variables, 293/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:31:10] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:31:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 187/293 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 372/665 variables, 293/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/665 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 88 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 293 /293 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 00:31:10] [INFO ] Invariant cache hit.
[2024-06-01 00:31:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 00:31:10] [INFO ] Invariant cache hit.
[2024-06-01 00:31:11] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-01 00:31:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 152 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 138 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:31:16] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:31:16] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:31:17] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:31:17] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:31:17] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:31:17] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:31:17] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:31:18] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:31:18] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/665 variables, 293/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 325 constraints, problems are : Problem set: 0 solved, 371 unsolved in 21886 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:31:38] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:31:38] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:31:38] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:31:39] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:31:39] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 372/665 variables, 293/332 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 371/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 703 constraints, problems are : Problem set: 0 solved, 371 unsolved in 25246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 25/25 constraints]
After SMT, in 47191ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 47197ms
Finished structural reductions in LTL mode , in 1 iterations and 47439 ms. Remains : 293/293 places, 372/372 transitions.
Computed a total of 89 stabilizing places and 94 stable transitions
Computed a total of 89 stabilizing places and 94 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (215 resets) in 146 ms. (272 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (60 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (70 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2024-06-01 00:31:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 372/665 variables, 293/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:31:58] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:31:58] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 187/293 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 372/665 variables, 293/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/665 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 16 reset in 115 ms.
Product exploration explored 100000 steps with 35 reset in 181 ms.
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 372/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 293 /293 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-01 00:32:00] [INFO ] Invariant cache hit.
[2024-06-01 00:32:00] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 00:32:00] [INFO ] Invariant cache hit.
[2024-06-01 00:32:00] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-01 00:32:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 152 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 138 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 140 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:32:05] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:32:05] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/665 variables, 293/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 325 constraints, problems are : Problem set: 0 solved, 371 unsolved in 21321 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:32:23] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:32:23] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 372/665 variables, 293/332 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 371/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 703 constraints, problems are : Problem set: 0 solved, 371 unsolved in 24327 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 25/25 constraints]
After SMT, in 45694ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 45697ms
Finished structural reductions in LTL mode , in 1 iterations and 45932 ms. Remains : 293/293 places, 372/372 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-02 finished in 145072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 358 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 4 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 289 transition count 259
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 139 rules applied. Total rules applied 262 place count 167 transition count 242
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 271 place count 158 transition count 242
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 271 place count 158 transition count 237
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 281 place count 153 transition count 237
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 304 place count 130 transition count 199
Iterating global reduction 3 with 23 rules applied. Total rules applied 327 place count 130 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) 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 332 place count 130 transition count 194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 337 place count 125 transition count 194
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 346 place count 116 transition count 178
Iterating global reduction 5 with 9 rules applied. Total rules applied 355 place count 116 transition count 178
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 116 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 115 transition count 177
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 362 place count 110 transition count 169
Iterating global reduction 7 with 5 rules applied. Total rules applied 367 place count 110 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 369 place count 110 transition count 167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 370 place count 109 transition count 165
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 109 transition count 165
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 372 place count 108 transition count 163
Iterating global reduction 8 with 1 rules applied. Total rules applied 373 place count 108 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 374 place count 108 transition count 162
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 458 place count 66 transition count 116
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 460 place count 64 transition count 112
Iterating global reduction 9 with 2 rules applied. Total rules applied 462 place count 64 transition count 112
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 464 place count 62 transition count 104
Iterating global reduction 9 with 2 rules applied. Total rules applied 466 place count 62 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 467 place count 62 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
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 475 place count 58 transition count 132
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 476 place count 57 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 477 place count 57 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 492 place count 57 transition count 115
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 493 place count 56 transition count 112
Iterating global reduction 10 with 1 rules applied. Total rules applied 494 place count 56 transition count 112
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 495 place count 55 transition count 110
Iterating global reduction 10 with 1 rules applied. Total rules applied 496 place count 55 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 497 place count 55 transition count 109
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 498 place count 55 transition count 109
Applied a total of 498 rules in 69 ms. Remains 55 /319 variables (removed 264) and now considering 109/414 (removed 305) transitions.
[2024-06-01 00:32:46] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 55 cols
[2024-06-01 00:32:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:32:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 00:32:46] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2024-06-01 00:32:46] [INFO ] Invariant cache hit.
[2024-06-01 00:32:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:32:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-01 00:32:46] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 00:32:46] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2024-06-01 00:32:46] [INFO ] Invariant cache hit.
[2024-06-01 00:32:46] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 00:32:46] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:32:46] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 100/155 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 75 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:32:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 100/155 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 105/181 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/156 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 182 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints]
After SMT, in 5738ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5739ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/319 places, 109/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5923 ms. Remains : 55/319 places, 109/414 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-03 finished in 5984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F((p1||G(p2))))))'
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 349 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 2 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 289 transition count 266
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 128 rules applied. Total rules applied 244 place count 174 transition count 253
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 253 place count 167 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 165 transition count 251
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 255 place count 165 transition count 246
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 265 place count 160 transition count 246
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 288 place count 137 transition count 208
Iterating global reduction 4 with 23 rules applied. Total rules applied 311 place count 137 transition count 208
Drop transitions (Trivial Post-Agglo cleanup.) 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 316 place count 137 transition count 203
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 321 place count 132 transition count 203
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 329 place count 124 transition count 189
Iterating global reduction 6 with 8 rules applied. Total rules applied 337 place count 124 transition count 189
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 340 place count 121 transition count 184
Iterating global reduction 6 with 3 rules applied. Total rules applied 343 place count 121 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 121 transition count 183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 345 place count 120 transition count 181
Iterating global reduction 7 with 1 rules applied. Total rules applied 346 place count 120 transition count 181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 347 place count 119 transition count 179
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 119 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 349 place count 119 transition count 178
Performed 40 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 429 place count 79 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 430 place count 79 transition count 134
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 434 place count 75 transition count 126
Iterating global reduction 9 with 4 rules applied. Total rules applied 438 place count 75 transition count 126
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 441 place count 72 transition count 116
Iterating global reduction 9 with 3 rules applied. Total rules applied 444 place count 72 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 445 place count 72 transition count 115
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 446 place count 71 transition count 114
Iterating global reduction 10 with 1 rules applied. Total rules applied 447 place count 71 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 448 place count 71 transition count 113
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 460 place count 65 transition count 163
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 461 place count 64 transition count 161
Iterating global reduction 11 with 1 rules applied. Total rules applied 462 place count 64 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 11 with 24 rules applied. Total rules applied 486 place count 64 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 488 place count 63 transition count 145
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 489 place count 62 transition count 142
Iterating global reduction 11 with 1 rules applied. Total rules applied 490 place count 62 transition count 142
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 491 place count 61 transition count 140
Iterating global reduction 11 with 1 rules applied. Total rules applied 492 place count 61 transition count 140
Applied a total of 492 rules in 71 ms. Remains 61 /319 variables (removed 258) and now considering 140/414 (removed 274) transitions.
[2024-06-01 00:32:52] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
// Phase 1: matrix 132 rows 61 cols
[2024-06-01 00:32:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:32:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 00:32:52] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:32:52] [INFO ] Invariant cache hit.
[2024-06-01 00:32:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:32:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 00:32:52] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 00:32:52] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:32:52] [INFO ] Invariant cache hit.
[2024-06-01 00:32:52] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 131/192 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 83 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:32:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 131/192 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 128/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 1/193 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 212 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4707 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 5/5 constraints]
After SMT, in 7812ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7814ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/319 places, 140/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8031 ms. Remains : 61/319 places, 140/414 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-04 finished in 8181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G(!p1))||X(G(p0)))))'
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 307 transition count 399
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 307 transition count 399
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 307 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 301 transition count 388
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 301 transition count 388
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 301 transition count 387
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 297 transition count 379
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 297 transition count 379
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 295 transition count 377
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 295 transition count 377
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 293 transition count 373
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 291 transition count 371
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 291 transition count 371
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 289 transition count 369
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 289 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 289 transition count 368
Applied a total of 63 rules in 38 ms. Remains 289 /319 variables (removed 30) and now considering 368/414 (removed 46) transitions.
// Phase 1: matrix 368 rows 289 cols
[2024-06-01 00:33:00] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 00:33:00] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 00:33:00] [INFO ] Invariant cache hit.
[2024-06-01 00:33:00] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-06-01 00:33:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:03] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 138 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:33:04] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:33:05] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:33:05] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:33:05] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:33:06] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:33:06] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:33:06] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/657 variables, 289/321 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:13] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:22] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:33:22] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/657 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/657 variables, and 324 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:33] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:33:34] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:33:34] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:33:34] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:35] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:33:36] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:33:36] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:33:37] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/657 variables, 289/332 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 367/699 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:44] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:33:44] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:47] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:33:48] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 3 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 707 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 37/37 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 289/319 places, 368/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60355 ms. Remains : 289/319 places, 368/414 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (AND p1 (NOT p0)), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-05
Product exploration explored 100000 steps with 88 reset in 175 ms.
Product exploration explored 100000 steps with 109 reset in 150 ms.
Computed a total of 89 stabilizing places and 94 stable transitions
Computed a total of 89 stabilizing places and 94 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (304 resets) in 247 ms. (161 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (71 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (67 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (71 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
[2024-06-01 00:34:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 184/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 368/657 variables, 289/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/657 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:34:01] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 184/289 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 368/657 variables, 289/304 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 2/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/657 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 307 constraints, problems are : Problem set: 1 solved, 2 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 601ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 3022 steps, including 24 resets, run visited all 2 properties in 46 ms. (steps per millisecond=65 )
Parikh walk visited 2 properties in 45 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 12 factoid took 158 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLCardinality-05 finished in 62223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 356 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 289 transition count 260
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 135 rules applied. Total rules applied 257 place count 168 transition count 246
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 266 place count 161 transition count 244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 270 place count 159 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 271 place count 158 transition count 242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 271 place count 158 transition count 236
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 283 place count 152 transition count 236
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 306 place count 129 transition count 198
Iterating global reduction 5 with 23 rules applied. Total rules applied 329 place count 129 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 333 place count 129 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 337 place count 125 transition count 194
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 345 place count 117 transition count 180
Iterating global reduction 7 with 8 rules applied. Total rules applied 353 place count 117 transition count 180
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 354 place count 117 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 355 place count 116 transition count 179
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 360 place count 111 transition count 171
Iterating global reduction 9 with 5 rules applied. Total rules applied 365 place count 111 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 367 place count 111 transition count 169
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 368 place count 110 transition count 167
Iterating global reduction 10 with 1 rules applied. Total rules applied 369 place count 110 transition count 167
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 370 place count 109 transition count 165
Iterating global reduction 10 with 1 rules applied. Total rules applied 371 place count 109 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 372 place count 109 transition count 164
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 11 with 82 rules applied. Total rules applied 454 place count 68 transition count 119
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 457 place count 65 transition count 113
Iterating global reduction 11 with 3 rules applied. Total rules applied 460 place count 65 transition count 113
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 463 place count 62 transition count 103
Iterating global reduction 11 with 3 rules applied. Total rules applied 466 place count 62 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 467 place count 62 transition count 102
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 468 place count 61 transition count 101
Iterating global reduction 12 with 1 rules applied. Total rules applied 469 place count 61 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 470 place count 61 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 482 place count 55 transition count 141
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 483 place count 54 transition count 139
Iterating global reduction 13 with 1 rules applied. Total rules applied 484 place count 54 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 503 place count 54 transition count 120
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 504 place count 53 transition count 117
Iterating global reduction 13 with 1 rules applied. Total rules applied 505 place count 53 transition count 117
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 506 place count 52 transition count 115
Iterating global reduction 13 with 1 rules applied. Total rules applied 507 place count 52 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 509 place count 51 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 512 place count 51 transition count 129
Applied a total of 512 rules in 51 ms. Remains 51 /319 variables (removed 268) and now considering 129/414 (removed 285) transitions.
[2024-06-01 00:34:02] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
// Phase 1: matrix 118 rows 51 cols
[2024-06-01 00:34:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:34:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 00:34:02] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
[2024-06-01 00:34:02] [INFO ] Invariant cache hit.
[2024-06-01 00:34:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 00:34:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-01 00:34:02] [INFO ] Redundant transitions in 3 ms returned []
Running 117 sub problems to find dead transitions.
[2024-06-01 00:34:02] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
[2024-06-01 00:34:02] [INFO ] Invariant cache hit.
[2024-06-01 00:34:02] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 117/168 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 75 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2533 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 117/168 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 117/193 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/169 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 194 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 4/4 constraints]
After SMT, in 6822ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6825ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/319 places, 129/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6979 ms. Remains : 51/319 places, 129/414 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-09 finished in 7053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 358 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 289 transition count 257
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 141 rules applied. Total rules applied 266 place count 165 transition count 240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 275 place count 156 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 275 place count 156 transition count 235
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 285 place count 151 transition count 235
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 307 place count 129 transition count 199
Iterating global reduction 3 with 22 rules applied. Total rules applied 329 place count 129 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) 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 334 place count 129 transition count 194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 339 place count 124 transition count 194
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 347 place count 116 transition count 179
Iterating global reduction 5 with 8 rules applied. Total rules applied 355 place count 116 transition count 179
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 116 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 115 transition count 178
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 361 place count 111 transition count 172
Iterating global reduction 7 with 4 rules applied. Total rules applied 365 place count 111 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 367 place count 111 transition count 170
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 451 place count 69 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 452 place count 69 transition count 124
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 455 place count 66 transition count 118
Iterating global reduction 9 with 3 rules applied. Total rules applied 458 place count 66 transition count 118
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 460 place count 64 transition count 112
Iterating global reduction 9 with 2 rules applied. Total rules applied 462 place count 64 transition count 112
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 463 place count 63 transition count 111
Iterating global reduction 9 with 1 rules applied. Total rules applied 464 place count 63 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 465 place count 63 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
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 473 place count 59 transition count 142
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 475 place count 57 transition count 138
Iterating global reduction 10 with 2 rules applied. Total rules applied 477 place count 57 transition count 138
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 478 place count 56 transition count 134
Iterating global reduction 10 with 1 rules applied. Total rules applied 479 place count 56 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 56 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 496 place count 56 transition count 117
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 497 place count 55 transition count 114
Iterating global reduction 11 with 1 rules applied. Total rules applied 498 place count 55 transition count 114
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 499 place count 54 transition count 112
Iterating global reduction 11 with 1 rules applied. Total rules applied 500 place count 54 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 501 place count 54 transition count 111
Applied a total of 501 rules in 41 ms. Remains 54 /319 variables (removed 265) and now considering 111/414 (removed 303) transitions.
[2024-06-01 00:34:09] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 54 cols
[2024-06-01 00:34:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 00:34:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:34:09] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:09] [INFO ] Invariant cache hit.
[2024-06-01 00:34:09] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:34:09] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 00:34:09] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 00:34:09] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:09] [INFO ] Invariant cache hit.
[2024-06-01 00:34:09] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:34:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 74 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/156 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 107/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 182 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
After SMT, in 5726ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5727ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/319 places, 111/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5866 ms. Remains : 54/319 places, 111/414 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 4273 reset in 198 ms.
Product exploration explored 100000 steps with 5899 reset in 156 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3725 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (319 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 472227 steps, run visited all 1 properties in 409 ms. (steps per millisecond=1154 )
Probabilistic random walk after 472227 steps, saw 78177 distinct states, run finished after 412 ms. (steps per millisecond=1146 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 00:34:16] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:16] [INFO ] Invariant cache hit.
[2024-06-01 00:34:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:34:16] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:16] [INFO ] Invariant cache hit.
[2024-06-01 00:34:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:34:16] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-06-01 00:34:16] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 00:34:16] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:16] [INFO ] Invariant cache hit.
[2024-06-01 00:34:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:34:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 74 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:19] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/156 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 107/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 182 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
After SMT, in 5714ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5715ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5823 ms. Remains : 54/54 places, 111/111 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3712 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (319 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 472227 steps, run visited all 1 properties in 376 ms. (steps per millisecond=1255 )
Probabilistic random walk after 472227 steps, saw 78177 distinct states, run finished after 377 ms. (steps per millisecond=1252 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3813 reset in 97 ms.
Product exploration explored 100000 steps with 8353 reset in 146 ms.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 00:34:23] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:23] [INFO ] Invariant cache hit.
[2024-06-01 00:34:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:34:23] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:23] [INFO ] Invariant cache hit.
[2024-06-01 00:34:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:34:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-01 00:34:23] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 00:34:23] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:34:23] [INFO ] Invariant cache hit.
[2024-06-01 00:34:23] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 74 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:34:26] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/156 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 107/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 182 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
After SMT, in 5614ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5710 ms. Remains : 54/54 places, 111/111 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-12 finished in 19692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 305 transition count 395
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 305 transition count 395
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 305 transition count 394
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 299 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 299 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 299 transition count 383
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 294 transition count 373
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 294 transition count 373
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 291 transition count 369
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 291 transition count 369
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 288 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 288 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 288 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 286 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 286 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 285 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 285 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 285 transition count 358
Applied a total of 72 rules in 24 ms. Remains 285 /319 variables (removed 34) and now considering 358/414 (removed 56) transitions.
// Phase 1: matrix 358 rows 285 cols
[2024-06-01 00:34:29] [INFO ] Computed 14 invariants in 3 ms
[2024-06-01 00:34:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 00:34:29] [INFO ] Invariant cache hit.
[2024-06-01 00:34:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2024-06-01 00:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:34:32] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:34:32] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:34:33] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:34:33] [INFO ] Deduced a trap composed of 143 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:34:33] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:34:33] [INFO ] Deduced a trap composed of 136 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:34:33] [INFO ] Deduced a trap composed of 137 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:34:34] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:34:34] [INFO ] Deduced a trap composed of 134 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:34:35] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:34:35] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:34:35] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:34:37] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:34:39] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:34:39] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:34:40] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:34:41] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:34:41] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:34:41] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:34:43] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:34:45] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:34:45] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:34:48] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 358/643 variables, 285/333 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/643 variables, and 333 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 358/643 variables, 285/333 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 357/690 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:35:05] [INFO ] Deduced a trap composed of 134 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:35:18] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/643 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/643 variables, and 692 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 36/36 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 285/319 places, 358/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60304 ms. Remains : 285/319 places, 358/414 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLCardinality-13 finished in 60681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 352 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 289 transition count 258
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 140 rules applied. Total rules applied 264 place count 166 transition count 241
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 273 place count 157 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 273 place count 157 transition count 236
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 283 place count 152 transition count 236
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 306 place count 129 transition count 198
Iterating global reduction 3 with 23 rules applied. Total rules applied 329 place count 129 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) 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 334 place count 129 transition count 193
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 339 place count 124 transition count 193
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 346 place count 117 transition count 180
Iterating global reduction 5 with 7 rules applied. Total rules applied 353 place count 117 transition count 180
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 355 place count 115 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 357 place count 115 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 358 place count 115 transition count 176
Performed 42 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 442 place count 73 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 444 place count 73 transition count 130
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 447 place count 70 transition count 124
Iterating global reduction 7 with 3 rules applied. Total rules applied 450 place count 70 transition count 124
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 452 place count 68 transition count 118
Iterating global reduction 7 with 2 rules applied. Total rules applied 454 place count 68 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 464 place count 63 transition count 175
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 466 place count 61 transition count 171
Iterating global reduction 7 with 2 rules applied. Total rules applied 468 place count 61 transition count 171
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 469 place count 60 transition count 164
Iterating global reduction 7 with 1 rules applied. Total rules applied 470 place count 60 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 472 place count 60 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 494 place count 60 transition count 140
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 495 place count 59 transition count 135
Iterating global reduction 8 with 1 rules applied. Total rules applied 496 place count 59 transition count 135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 497 place count 58 transition count 133
Iterating global reduction 8 with 1 rules applied. Total rules applied 498 place count 58 transition count 133
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 8 with 2 rules applied. Total rules applied 500 place count 57 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 504 place count 57 transition count 140
Applied a total of 504 rules in 29 ms. Remains 57 /319 variables (removed 262) and now considering 140/414 (removed 274) transitions.
[2024-06-01 00:35:29] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
// Phase 1: matrix 132 rows 57 cols
[2024-06-01 00:35:29] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 00:35:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 00:35:30] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:30] [INFO ] Invariant cache hit.
[2024-06-01 00:35:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 00:35:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 00:35:30] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 00:35:30] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:30] [INFO ] Invariant cache hit.
[2024-06-01 00:35:30] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:35:30] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 131/188 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 83 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 128/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 4/4 constraints]
After SMT, in 8099ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/319 places, 140/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8236 ms. Remains : 57/319 places, 140/414 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-14
Product exploration explored 100000 steps with 6965 reset in 125 ms.
Product exploration explored 100000 steps with 319 reset in 42 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 35382 steps (3691 resets) in 124 ms. (283 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 00:35:38] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:38] [INFO ] Invariant cache hit.
[2024-06-01 00:35:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 00:35:38] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:38] [INFO ] Invariant cache hit.
[2024-06-01 00:35:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 00:35:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-01 00:35:39] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 00:35:39] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:39] [INFO ] Invariant cache hit.
[2024-06-01 00:35:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:39] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:35:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 131/188 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 83 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:42] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 128/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4984 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 4/4 constraints]
After SMT, in 8242ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8448 ms. Remains : 57/57 places, 140/140 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 34521 steps (3601 resets) in 86 ms. (396 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4977 reset in 95 ms.
Product exploration explored 100000 steps with 5464 reset in 106 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 140/140 transitions.
Applied a total of 0 rules in 15 ms. Remains 57 /57 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-01 00:35:48] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:48] [INFO ] Invariant cache hit.
[2024-06-01 00:35:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 00:35:48] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:48] [INFO ] Invariant cache hit.
[2024-06-01 00:35:48] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 00:35:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 00:35:48] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 00:35:48] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-06-01 00:35:48] [INFO ] Invariant cache hit.
[2024-06-01 00:35:48] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:48] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:35:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 131/188 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 83 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3110 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 128/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 213 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 4/4 constraints]
After SMT, in 8020ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8021ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8147 ms. Remains : 57/57 places, 140/140 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-14 finished in 26374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 304 transition count 394
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 304 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 304 transition count 393
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 298 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 298 transition count 383
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 298 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 293 transition count 372
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 293 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 290 transition count 368
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 290 transition count 368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 287 transition count 362
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 287 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 287 transition count 361
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 285 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 285 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 283 transition count 357
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 283 transition count 356
Applied a total of 76 rules in 24 ms. Remains 283 /319 variables (removed 36) and now considering 356/414 (removed 58) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-06-01 00:35:56] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 00:35:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 00:35:56] [INFO ] Invariant cache hit.
[2024-06-01 00:35:56] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-06-01 00:35:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 3 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 134 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:36:02] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:36:02] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 144 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:36:05] [INFO ] Deduced a trap composed of 133 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:36:06] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:06] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:36:07] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:36:08] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 317 constraints, problems are : Problem set: 0 solved, 355 unsolved in 25607 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 157 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 135 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:27] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:36:27] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/322 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 677 constraints, problems are : Problem set: 0 solved, 355 unsolved in 23231 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 25/25 constraints]
After SMT, in 48882ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 48885ms
Starting structural reductions in LTL mode, iteration 1 : 283/319 places, 356/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49125 ms. Remains : 283/319 places, 356/414 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Detected a total of 88/283 stabilizing places and 92/356 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLCardinality-15 finished in 49496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Found a Lengthening insensitive property : HealthRecord-PT-16-LTLCardinality-02
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 319/319 places, 414/414 transitions.
Graph (trivial) has 353 edges and 319 vertex of which 46 / 319 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 289 transition count 260
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 138 rules applied. Total rules applied 260 place count 168 transition count 243
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 269 place count 159 transition count 243
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 269 place count 159 transition count 238
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 279 place count 154 transition count 238
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 300 place count 133 transition count 204
Iterating global reduction 3 with 21 rules applied. Total rules applied 321 place count 133 transition count 204
Drop transitions (Trivial Post-Agglo cleanup.) 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 326 place count 133 transition count 199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 331 place count 128 transition count 199
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 338 place count 121 transition count 187
Iterating global reduction 5 with 7 rules applied. Total rules applied 345 place count 121 transition count 187
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 347 place count 119 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 119 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 350 place count 118 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 351 place count 118 transition count 181
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 352 place count 117 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 353 place count 117 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 354 place count 117 transition count 178
Performed 41 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 436 place count 76 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 437 place count 76 transition count 133
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 440 place count 73 transition count 127
Iterating global reduction 7 with 3 rules applied. Total rules applied 443 place count 73 transition count 127
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 446 place count 70 transition count 117
Iterating global reduction 7 with 3 rules applied. Total rules applied 449 place count 70 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 450 place count 70 transition count 116
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 451 place count 69 transition count 115
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 69 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 453 place count 69 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 463 place count 64 transition count 160
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 464 place count 63 transition count 158
Iterating global reduction 9 with 1 rules applied. Total rules applied 465 place count 63 transition count 158
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 466 place count 63 transition count 158
Applied a total of 466 rules in 23 ms. Remains 63 /319 variables (removed 256) and now considering 158/414 (removed 256) transitions.
[2024-06-01 00:36:45] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
// Phase 1: matrix 150 rows 63 cols
[2024-06-01 00:36:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:36:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 00:36:46] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2024-06-01 00:36:46] [INFO ] Invariant cache hit.
[2024-06-01 00:36:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 00:36:46] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-06-01 00:36:46] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2024-06-01 00:36:46] [INFO ] Invariant cache hit.
[2024-06-01 00:36:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 00:36:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:36:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:36:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 149/212 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/213 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 83 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 00:36:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 149/212 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 138/221 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/213 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 222 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
After SMT, in 8614ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 8616ms
Starting structural reductions in LI_LTL mode, iteration 1 : 63/319 places, 158/414 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8749 ms. Remains : 63/319 places, 158/414 transitions.
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 5970 steps with 572 reset in 15 ms.
Treatment of property HealthRecord-PT-16-LTLCardinality-02 finished in 8929 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
[2024-06-01 00:36:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 00:36:54] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 00:36:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 319 places, 414 transitions and 963 arcs took 3 ms.
Total runtime 459679 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HealthRecord-PT-16-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-16-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-16-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717202660031

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HealthRecord-PT-16-LTLCardinality-02
ltl formula formula --ltl=/tmp/2027/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 319 places, 414 transitions and 963 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2027/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2027/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2027/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2027/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 321 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 320, there are 437 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~107 levels ~10000 states ~30592 transitions
pnml2lts-mc( 2/ 4): ~107 levels ~20000 states ~61772 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~40000 states ~140964 transitions
pnml2lts-mc( 0/ 4): ~111 levels ~80000 states ~323088 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~160000 states ~637724 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~320000 states ~1304908 transitions
pnml2lts-mc( 2/ 4): ~129 levels ~640000 states ~2628932 transitions
pnml2lts-mc( 2/ 4): ~129 levels ~1280000 states ~5514024 transitions
pnml2lts-mc( 2/ 4): ~130 levels ~2560000 states ~11583124 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~5120000 states ~25427292 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~10240000 states ~52962860 transitions
pnml2lts-mc( 2/ 4): ~186 levels ~20480000 states ~106120372 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13441777
pnml2lts-mc( 0/ 4): unique states count: 33461461
pnml2lts-mc( 0/ 4): unique transitions count: 193796543
pnml2lts-mc( 0/ 4): - self-loop count: 10797
pnml2lts-mc( 0/ 4): - claim dead count: 110278995
pnml2lts-mc( 0/ 4): - claim found count: 49640840
pnml2lts-mc( 0/ 4): - claim success count: 33461485
pnml2lts-mc( 0/ 4): - cum. max stack depth: 647829
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33461485 states 193796586 transitions, fanout: 5.792
pnml2lts-mc( 0/ 4): Total exploration time 225.890 sec (225.880 sec minimum, 225.885 sec on average)
pnml2lts-mc( 0/ 4): States per second: 148132, Transitions per second: 857925
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.9MB, 8.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.9MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-16-LTLCardinality-12
ltl formula formula --ltl=/tmp/2027/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 319 places, 414 transitions and 963 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2027/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2027/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2027/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2027/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 320 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 320, there are 426 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~116 levels ~10000 states ~29552 transitions
pnml2lts-mc( 2/ 4): ~116 levels ~20000 states ~60588 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~40000 states ~121288 transitions
pnml2lts-mc( 2/ 4): ~121 levels ~80000 states ~262812 transitions
pnml2lts-mc( 2/ 4): ~121 levels ~160000 states ~606068 transitions
pnml2lts-mc( 2/ 4): ~151 levels ~320000 states ~1312356 transitions
pnml2lts-mc( 2/ 4): ~152 levels ~640000 states ~2625152 transitions
pnml2lts-mc( 2/ 4): ~153 levels ~1280000 states ~5577696 transitions
pnml2lts-mc( 2/ 4): ~153 levels ~2560000 states ~12660896 transitions
pnml2lts-mc( 2/ 4): ~209 levels ~5120000 states ~26446840 transitions
pnml2lts-mc( 2/ 4): ~209 levels ~10240000 states ~52895596 transitions
pnml2lts-mc( 2/ 4): ~209 levels ~20480000 states ~111459876 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 24574720
pnml2lts-mc( 0/ 4): unique states count: 33553429
pnml2lts-mc( 0/ 4): unique transitions count: 189653098
pnml2lts-mc( 0/ 4): - self-loop count: 8383
pnml2lts-mc( 0/ 4): - claim dead count: 146028262
pnml2lts-mc( 0/ 4): - claim found count: 10061965
pnml2lts-mc( 0/ 4): - claim success count: 33553454
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1103
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553454 states 189653144 transitions, fanout: 5.652
pnml2lts-mc( 0/ 4): Total exploration time 215.910 sec (215.900 sec minimum, 215.902 sec on average)
pnml2lts-mc( 0/ 4): States per second: 155405, Transitions per second: 878390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.8MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.8MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-16-LTLCardinality-14
ltl formula formula --ltl=/tmp/2027/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 319 places, 414 transitions and 963 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2027/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2027/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2027/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2027/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 320 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 320, there are 452 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~112 levels ~10000 states ~29380 transitions
pnml2lts-mc( 3/ 4): ~112 levels ~20000 states ~61568 transitions
pnml2lts-mc( 3/ 4): ~112 levels ~40000 states ~142068 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~80000 states ~276016 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~160000 states ~629372 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~829!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 157507
pnml2lts-mc( 0/ 4): unique states count: 215807
pnml2lts-mc( 0/ 4): unique transitions count: 1054259
pnml2lts-mc( 0/ 4): - self-loop count: 1556
pnml2lts-mc( 0/ 4): - claim dead count: 724225
pnml2lts-mc( 0/ 4): - claim found count: 110123
pnml2lts-mc( 0/ 4): - claim success count: 215829
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2151
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 215829 states 1054295 transitions, fanout: 4.885
pnml2lts-mc( 0/ 4): Total exploration time 1.760 sec (1.760 sec minimum, 1.760 sec on average)
pnml2lts-mc( 0/ 4): States per second: 122630, Transitions per second: 599031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.8MB, 13.3 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604300819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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