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.r179-tall-171640602400819.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 greatspnxred
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 r179-tall-171640602400819
=====================================================================

--------------------
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 1716491402972

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:10:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:10:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:10:04] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-23 19:10:04] [INFO ] Transformed 453 places.
[2024-05-23 19:10:04] [INFO ] Transformed 594 transitions.
[2024-05-23 19:10:04] [INFO ] Found NUPN structural information;
[2024-05-23 19:10:04] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 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 124 ms. Remains 319 /453 variables (removed 134) and now considering 414/594 (removed 180) transitions.
// Phase 1: matrix 414 rows 319 cols
[2024-05-23 19:10:04] [INFO ] Computed 14 invariants in 21 ms
[2024-05-23 19:10:05] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-23 19:10:05] [INFO ] Invariant cache hit.
[2024-05-23 19:10:05] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-23 19:10:05] [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-05-23 19:10:09] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 23 ms to minimize.
[2024-05-23 19:10:10] [INFO ] Deduced a trap composed of 149 places in 241 ms of which 15 ms to minimize.
[2024-05-23 19:10:10] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-05-23 19:10:10] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 7 ms to minimize.
[2024-05-23 19:10:11] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-05-23 19:10:11] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 13 ms to minimize.
[2024-05-23 19:10:11] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-23 19:10:11] [INFO ] Deduced a trap composed of 157 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:10:11] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:10:12] [INFO ] Deduced a trap composed of 156 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:10:12] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:10:12] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 123 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 135 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:10:13] [INFO ] Deduced a trap composed of 127 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:10:14] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:10:14] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-23 19:10:16] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:10:16] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:10:16] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:10:18] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:10:19] [INFO ] Deduced a trap composed of 61 places in 61 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-05-23 19:10:19] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:10:20] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:10:20] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 2 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-05-23 19:10:28] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-05-23 19:10:28] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:10:29] [INFO ] Deduced a trap composed of 166 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:10:29] [INFO ] Deduced a trap composed of 155 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:10:31] [INFO ] Deduced a trap composed of 67 places in 67 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30041 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-05-23 19:10:38] [INFO ] Deduced a trap composed of 150 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:10:38] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 3 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-05-23 19:10:53] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 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 30012 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 60186ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 319/453 places, 414/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61052 ms. Remains : 319/453 places, 414/594 transitions.
Support contains 32 out of 319 places after structural reductions.
[2024-05-23 19:11:05] [INFO ] Flatten gal took : 49 ms
[2024-05-23 19:11:05] [INFO ] Flatten gal took : 21 ms
[2024-05-23 19:11:05] [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 (302 resets) in 1617 ms. (24 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40004 steps (62 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (61 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (68 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (69 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (68 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
[2024-05-23 19:11:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 113/128 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 191/319 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 414/733 variables, 319/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/733 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 733/733 variables, and 333 constraints, problems are : Problem set: 0 solved, 8 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 113/128 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 19:11:07] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:11:07] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 191/319 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 414/733 variables, 319/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 19:11:07] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/733 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 19:11:08] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/733 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/733 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/733 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 733/733 variables, and 345 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 7 properties in 442 ms.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 3 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 574 edges and 290 vertex of which 257 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 257 transition count 164
Reduce places removed 126 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 143 rules applied. Total rules applied 329 place count 131 transition count 147
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 338 place count 122 transition count 147
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 338 place count 122 transition count 126
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 380 place count 101 transition count 126
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 404 place count 77 transition count 102
Iterating global reduction 3 with 24 rules applied. Total rules applied 428 place count 77 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 428 place count 77 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 440 place count 71 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 443 place count 68 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 446 place count 68 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 448 place count 66 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 450 place count 66 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 452 place count 66 transition count 89
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 492 place count 46 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 493 place count 46 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 496 place count 43 transition count 63
Iterating global reduction 5 with 3 rules applied. Total rules applied 499 place count 43 transition count 63
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 501 place count 41 transition count 60
Iterating global reduction 5 with 2 rules applied. Total rules applied 503 place count 41 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 504 place count 41 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 506 place count 40 transition count 58
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 507 place count 39 transition count 57
Iterating global reduction 6 with 1 rules applied. Total rules applied 508 place count 39 transition count 57
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 509 place count 38 transition count 55
Iterating global reduction 6 with 1 rules applied. Total rules applied 510 place count 38 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 38 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 515 place count 36 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 516 place count 36 transition count 67
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 517 place count 35 transition count 66
Iterating global reduction 7 with 1 rules applied. Total rules applied 518 place count 35 transition count 66
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 519 place count 34 transition count 65
Iterating global reduction 7 with 1 rules applied. Total rules applied 520 place count 34 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 521 place count 34 transition count 64
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 532 place count 34 transition count 53
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 544 place count 23 transition count 52
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 546 place count 21 transition count 46
Iterating global reduction 8 with 2 rules applied. Total rules applied 548 place count 21 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 549 place count 21 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 550 place count 21 transition count 45
Applied a total of 550 rules in 62 ms. Remains 21 /319 variables (removed 298) and now considering 45/414 (removed 369) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 21/319 places, 45/414 transitions.
RANDOM walk for 312 steps (45 resets) in 10 ms. (28 steps per ms) remains 0/1 properties
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 58 ms. Remains 293 /319 variables (removed 26) and now considering 372/414 (removed 42) transitions.
// Phase 1: matrix 372 rows 293 cols
[2024-05-23 19:11:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 19:11:09] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-23 19:11:09] [INFO ] Invariant cache hit.
[2024-05-23 19:11:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-05-23 19:11:09] [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-05-23 19:11:13] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 152 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 138 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 140 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:11:13] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:11:14] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:11:14] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:11:14] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:11:14] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:11:15] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:11:15] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-23 19:11:15] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:11:16] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:11:16] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:11:16] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 5 ms to minimize.
[2024-05-23 19:11:16] [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 21413 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-05-23 19:11:33] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:11:33] [INFO ] Deduced a trap composed of 120 places in 81 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-05-23 19:11:36] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:11:36] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2024-05-23 19:11:36] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:11:37] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:11:37] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 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 25504 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 46967ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 46972ms
Starting structural reductions in LTL mode, iteration 1 : 293/319 places, 372/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47314 ms. Remains : 293/319 places, 372/414 transitions.
Stuttering acceptance computed with spot in 193 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 110 reset in 196 ms.
Product exploration explored 100000 steps with 28 reset in 142 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 110 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 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (238 resets) in 311 ms. (128 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (69 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (69 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-05-23 19:11:57] [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 162 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-05-23 19:11:57] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:11:57] [INFO ] Deduced a trap composed of 44 places in 40 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 316 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 483ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 56 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 7 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 209 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 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 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 3 ms. Remains 293 /293 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-23 19:11:58] [INFO ] Invariant cache hit.
[2024-05-23 19:12:00] [INFO ] Implicit Places using invariants in 1754 ms returned []
[2024-05-23 19:12:00] [INFO ] Invariant cache hit.
[2024-05-23 19:12:00] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-05-23 19:12: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-05-23 19:12:04] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 5 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 2 ms to minimize.
[2024-05-23 19:12:04] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 2 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2024-05-23 19:12:05] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:12:06] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-05-23 19:12:06] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:12:07] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:12:07] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:12:07] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:12:07] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:12:07] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 3 ms to minimize.
[2024-05-23 19:12:08] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:12:08] [INFO ] Deduced a trap composed of 50 places in 69 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 22534 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-05-23 19:12:25] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:12:25] [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-05-23 19:12:28] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:12:28] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:12:28] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:12:29] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:12:29] [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 25277 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 47893ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 47900ms
Finished structural reductions in LTL mode , in 1 iterations and 49860 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 114 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 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (291 resets) in 125 ms. (317 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (70 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-05-23 19:12:48] [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 163 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-05-23 19:12:49] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:12:49] [INFO ] Deduced a trap composed of 44 places in 40 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 329 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 498ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 56 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 2 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 218 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 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 105 reset in 120 ms.
Product exploration explored 100000 steps with 50 reset in 236 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 7 ms. Remains 293 /293 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-05-23 19:12:50] [INFO ] Invariant cache hit.
[2024-05-23 19:12:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 19:12:50] [INFO ] Invariant cache hit.
[2024-05-23 19:12:50] [INFO ] Implicit Places using invariants and state equation in 159 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-05-23 19:12:50] [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-05-23 19:12:54] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 152 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 138 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 140 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:12:54] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:12:55] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:12:55] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:12:55] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-23 19:12:55] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:12:56] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:12:56] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:12:56] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:12:57] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:12:57] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:12:57] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:12:57] [INFO ] Deduced a trap composed of 50 places in 69 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 21390 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-05-23 19:13:13] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:13:14] [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-05-23 19:13:17] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:13:17] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:13:17] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:13:17] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:13:18] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 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 24966 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 46407ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 46413ms
Finished structural reductions in LTL mode , in 1 iterations and 46650 ms. Remains : 293/293 places, 372/372 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-02 finished in 147777 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 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 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 52 ms. Remains 55 /319 variables (removed 264) and now considering 109/414 (removed 305) transitions.
[2024-05-23 19:13:37] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 55 cols
[2024-05-23 19:13:37] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 19:13:37] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 19:13:37] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2024-05-23 19:13:37] [INFO ] Invariant cache hit.
[2024-05-23 19:13:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 19:13:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-23 19:13:37] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-23 19:13:37] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2024-05-23 19:13:37] [INFO ] Invariant cache hit.
[2024-05-23 19:13:37] [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-05-23 19:13:37] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:13:37] [INFO ] Deduced a trap composed of 14 places in 23 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 2366 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-05-23 19:13:39] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:13:39] [INFO ] Deduced a trap composed of 10 places in 35 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 3356 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 5775ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5776ms
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 5974 ms. Remains : 55/319 places, 109/414 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 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 6026 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 48 ms. Remains 61 /319 variables (removed 258) and now considering 140/414 (removed 274) transitions.
[2024-05-23 19:13:43] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
// Phase 1: matrix 132 rows 61 cols
[2024-05-23 19:13:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 19:13:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:13:43] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:13:43] [INFO ] Invariant cache hit.
[2024-05-23 19:13:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 19:13:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-23 19:13:43] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 19:13:43] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:13:43] [INFO ] Invariant cache hit.
[2024-05-23 19:13:43] [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-05-23 19:13:43] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-23 19:13:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:13:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:13:43] [INFO ] Deduced a trap composed of 12 places in 33 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 3099 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-05-23 19:13:46] [INFO ] Deduced a trap composed of 12 places in 35 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 4596 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 7747ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7749ms
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 7899 ms. Remains : 61/319 places, 140/414 transitions.
Stuttering acceptance computed with spot in 117 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 7 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-04 finished in 8038 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 22 ms. Remains 289 /319 variables (removed 30) and now considering 368/414 (removed 46) transitions.
// Phase 1: matrix 368 rows 289 cols
[2024-05-23 19:13:51] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 19:13:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 19:13:51] [INFO ] Invariant cache hit.
[2024-05-23 19:13:51] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-23 19:13:51] [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-05-23 19:13:54] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:13:54] [INFO ] Deduced a trap composed of 138 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 136 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:13:55] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:13:56] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:13:56] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:13:56] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:13:57] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:13:57] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:13:57] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:13:57] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:13:58] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:13:58] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:13:58] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 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-05-23 19:14:04] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 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-05-23 19:14:13] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-23 19:14:14] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 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: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 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-05-23 19:14:23] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:14:25] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:14:25] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-23 19:14:25] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 19:14:26] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:14:27] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:14:27] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:14:27] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 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-05-23 19:14:34] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-23 19:14:35] [INFO ] Deduced a trap composed of 76 places in 78 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-05-23 19:14:38] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:14:39] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:14:43] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:14:43] [INFO ] Deduced a trap composed of 54 places in 56 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-05-23 19:14:50] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-05-23 19:14:50] [INFO ] Deduced a trap composed of 69 places in 46 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 30013 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 60082ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 289/319 places, 368/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60342 ms. Remains : 289/319 places, 368/414 transitions.
Stuttering acceptance computed with spot in 195 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 537 reset in 156 ms.
Product exploration explored 100000 steps with 11 reset in 167 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 111 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 217 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (383 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (51 resets) in 178 ms. (223 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (68 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
[2024-05-23 19:14:52] [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 201 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-05-23 19:14:52] [INFO ] Deduced a trap composed of 46 places in 33 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-05-23 19:14:53] [INFO ] Deduced a trap composed of 51 places in 87 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 381 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 588ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8341 steps, including 69 resets, run visited all 2 properties in 89 ms. (steps per millisecond=93 )
Parikh walk visited 2 properties in 89 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 303 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 62418 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 45 ms. Remains 51 /319 variables (removed 268) and now considering 129/414 (removed 285) transitions.
[2024-05-23 19:14:53] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
// Phase 1: matrix 118 rows 51 cols
[2024-05-23 19:14:53] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 19:14:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 19:14:53] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
[2024-05-23 19:14:53] [INFO ] Invariant cache hit.
[2024-05-23 19:14:53] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 19:14:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-23 19:14:53] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-23 19:14:53] [INFO ] Flow matrix only has 118 transitions (discarded 11 similar events)
[2024-05-23 19:14:53] [INFO ] Invariant cache hit.
[2024-05-23 19:14:53] [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-05-23 19:14:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-23 19:14:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 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 2509 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-05-23 19:14:56] [INFO ] Deduced a trap composed of 7 places in 28 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-05-23 19:14:56] [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 4293 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 6858ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6859ms
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 7042 ms. Remains : 51/319 places, 129/414 transitions.
Stuttering acceptance computed with spot in 59 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 0 ms.
FORMULA HealthRecord-PT-16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLCardinality-09 finished in 7138 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 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 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 40 ms. Remains 54 /319 variables (removed 265) and now considering 111/414 (removed 303) transitions.
[2024-05-23 19:15:00] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 54 cols
[2024-05-23 19:15:00] [INFO ] Computed 7 invariants in 2 ms
[2024-05-23 19:15:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 19:15:00] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:00] [INFO ] Invariant cache hit.
[2024-05-23 19:15:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 19:15:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-23 19:15:00] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-23 19:15:00] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:00] [INFO ] Invariant cache hit.
[2024-05-23 19:15:00] [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-05-23 19:15:01] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-23 19:15:01] [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 2364 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-05-23 19:15:03] [INFO ] Deduced a trap composed of 11 places in 29 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 3389 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 5794ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5796ms
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 5965 ms. Remains : 54/319 places, 111/414 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 8381 reset in 257 ms.
Product exploration explored 100000 steps with 3658 reset in 92 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 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3716 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (318 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 472227 steps, run visited all 1 properties in 421 ms. (steps per millisecond=1121 )
Probabilistic random walk after 472227 steps, saw 78177 distinct states, run finished after 424 ms. (steps per millisecond=1113 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 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 3 ms. Remains 54 /54 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-23 19:15:07] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:07] [INFO ] Invariant cache hit.
[2024-05-23 19:15:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:15:07] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:07] [INFO ] Invariant cache hit.
[2024-05-23 19:15:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 19:15:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-23 19:15:07] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-23 19:15:07] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:07] [INFO ] Invariant cache hit.
[2024-05-23 19:15:07] [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-05-23 19:15:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-23 19:15:08] [INFO ] Deduced a trap composed of 15 places in 30 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 2354 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-05-23 19:15:10] [INFO ] Deduced a trap composed of 11 places in 27 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 3365 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 5759ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5761ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5861 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 67 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 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3725 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (322 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 472227 steps, run visited all 1 properties in 386 ms. (steps per millisecond=1223 )
Probabilistic random walk after 472227 steps, saw 78177 distinct states, run finished after 386 ms. (steps per millisecond=1223 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2465 reset in 76 ms.
Product exploration explored 100000 steps with 4470 reset in 106 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-05-23 19:15:14] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:14] [INFO ] Invariant cache hit.
[2024-05-23 19:15:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 19:15:14] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:14] [INFO ] Invariant cache hit.
[2024-05-23 19:15:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-23 19:15:14] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-23 19:15:14] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-23 19:15:14] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-23 19:15:14] [INFO ] Invariant cache hit.
[2024-05-23 19:15:14] [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-05-23 19:15:15] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-23 19:15:15] [INFO ] Deduced a trap composed of 15 places in 28 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 2341 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-05-23 19:15:17] [INFO ] Deduced a trap composed of 11 places in 28 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 3249 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 5627ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5628ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5750 ms. Remains : 54/54 places, 111/111 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-12 finished in 19738 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 19 ms. Remains 285 /319 variables (removed 34) and now considering 358/414 (removed 56) transitions.
// Phase 1: matrix 358 rows 285 cols
[2024-05-23 19:15:20] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 19:15:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 19:15:20] [INFO ] Invariant cache hit.
[2024-05-23 19:15:20] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2024-05-23 19:15:20] [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-05-23 19:15:23] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 136 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 143 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 136 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:15:24] [INFO ] Deduced a trap composed of 137 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:15:25] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:15:25] [INFO ] Deduced a trap composed of 134 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:15:26] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:15:26] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:15:26] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-23 19:15:28] [INFO ] Deduced a trap composed of 49 places in 88 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-05-23 19:15:30] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:15:30] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:15:31] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:15:32] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:15:32] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:15:32] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:15:34] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:15:35] [INFO ] Deduced a trap composed of 112 places in 68 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-05-23 19:15:39] [INFO ] Deduced a trap composed of 117 places in 79 ms of which 1 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-05-23 19:15:56] [INFO ] Deduced a trap composed of 134 places in 81 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-05-23 19:16:09] [INFO ] Deduced a trap composed of 71 places in 70 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 30011 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 60060ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 285/319 places, 358/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60299 ms. Remains : 285/319 places, 358/414 transitions.
Stuttering acceptance computed with spot in 78 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 125 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 14 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 60654 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 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 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-05-23 19:16:21] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
// Phase 1: matrix 132 rows 57 cols
[2024-05-23 19:16:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 19:16:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-23 19:16:21] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:21] [INFO ] Invariant cache hit.
[2024-05-23 19:16:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 19:16:21] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-23 19:16:21] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 19:16:21] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:21] [INFO ] Invariant cache hit.
[2024-05-23 19:16:21] [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-05-23 19:16:21] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:16:21] [INFO ] Deduced a trap composed of 15 places in 26 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 3163 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-05-23 19:16:24] [INFO ] Deduced a trap composed of 11 places in 32 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-05-23 19:16:25] [INFO ] Deduced a trap composed of 13 places in 32 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 4835 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 8053ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8054ms
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 8281 ms. Remains : 57/319 places, 140/414 transitions.
Stuttering acceptance computed with spot in 74 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 9316 reset in 156 ms.
Product exploration explored 100000 steps with 1235 reset in 55 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 72 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 40000 steps (4173 resets) in 92 ms. (430 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (358 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-23 19:16:29] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:29] [INFO ] Invariant cache hit.
[2024-05-23 19:16:29] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/57 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/188 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:16:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-23 19:16:29] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/57 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 140/140 transitions.
Graph (complete) has 186 edges and 57 vertex of which 39 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 39 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 37 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 37 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 37 transition count 86
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 37 transition count 71
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 69 place count 22 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 19 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 19 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 19 transition count 57
Applied a total of 76 rules in 15 ms. Remains 19 /57 variables (removed 38) and now considering 57/140 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 19/57 places, 57/140 transitions.
RANDOM walk for 6303 steps (1576 resets) in 109 ms. (57 steps per ms) remains 0/1 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 102 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 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 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 6 ms. Remains 57 /57 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-23 19:16:30] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:30] [INFO ] Invariant cache hit.
[2024-05-23 19:16:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 19:16:30] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:30] [INFO ] Invariant cache hit.
[2024-05-23 19:16:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 19:16:30] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-23 19:16:30] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 19:16:30] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:30] [INFO ] Invariant cache hit.
[2024-05-23 19:16: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-05-23 19:16:30] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-23 19:16:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 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 3146 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-05-23 19:16:33] [INFO ] Deduced a trap composed of 11 places in 32 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-05-23 19:16:34] [INFO ] Deduced a trap composed of 13 places in 28 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 5082 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 8291ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8414 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 79 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 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (4168 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (356 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-23 19:16:38] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:38] [INFO ] Invariant cache hit.
[2024-05-23 19:16:38] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/57 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/188 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:16:39] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-23 19:16:39] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/57 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 140/140 transitions.
Graph (complete) has 186 edges and 57 vertex of which 39 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 39 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 37 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 37 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 37 transition count 86
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 37 transition count 71
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 69 place count 22 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 19 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 19 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 19 transition count 57
Applied a total of 76 rules in 6 ms. Remains 19 /57 variables (removed 38) and now considering 57/140 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 19/57 places, 57/140 transitions.
RANDOM walk for 15050 steps (3812 resets) in 36 ms. (406 steps per ms) remains 0/1 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 101 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)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4531 reset in 98 ms.
Product exploration explored 100000 steps with 4493 reset in 96 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 2 ms. Remains 57 /57 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-23 19:16:39] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:39] [INFO ] Invariant cache hit.
[2024-05-23 19:16:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 19:16:39] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:39] [INFO ] Invariant cache hit.
[2024-05-23 19:16:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 19:16:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-23 19:16:39] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 19:16:39] [INFO ] Flow matrix only has 132 transitions (discarded 8 similar events)
[2024-05-23 19:16:39] [INFO ] Invariant cache hit.
[2024-05-23 19:16: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-05-23 19:16:40] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-23 19:16:40] [INFO ] Deduced a trap composed of 15 places in 26 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 3173 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-05-23 19:16:43] [INFO ] Deduced a trap composed of 11 places in 33 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-05-23 19:16:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 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 5059 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 8291ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8292ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8426 ms. Remains : 57/57 places, 140/140 transitions.
Treatment of property HealthRecord-PT-16-LTLCardinality-14 finished in 27029 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 28 ms. Remains 283 /319 variables (removed 36) and now considering 356/414 (removed 58) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-05-23 19:16:48] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 19:16:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 19:16:48] [INFO ] Invariant cache hit.
[2024-05-23 19:16:48] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-23 19:16:48] [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-05-23 19:16:51] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:16:51] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:16:51] [INFO ] Deduced a trap composed of 116 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:16:52] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:16:52] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:16:52] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:16:52] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:16:52] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:53] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-23 19:16:53] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:16:54] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:16:54] [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-05-23 19:16:56] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:16:56] [INFO ] Deduced a trap composed of 144 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:16:56] [INFO ] Deduced a trap composed of 136 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-23 19:16:59] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:16:59] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 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 26875 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-05-23 19:17:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:17:17] [INFO ] Deduced a trap composed of 157 places in 79 ms of which 1 ms to minimize.
[2024-05-23 19:17:18] [INFO ] Deduced a trap composed of 135 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-23 19:17:21] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 6 ms to minimize.
[2024-05-23 19:17:21] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 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 24729 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 51641ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 51644ms
Starting structural reductions in LTL mode, iteration 1 : 283/319 places, 356/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51894 ms. Remains : 283/319 places, 356/414 transitions.
Stuttering acceptance computed with spot in 70 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 103 ms.
Product exploration explored 100000 steps with 50000 reset in 103 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 16 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 52212 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 87 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 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 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 0 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 32 ms. Remains 63 /319 variables (removed 256) and now considering 158/414 (removed 256) transitions.
[2024-05-23 19:17:40] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
// Phase 1: matrix 150 rows 63 cols
[2024-05-23 19:17:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 19:17:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 19:17:40] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2024-05-23 19:17:40] [INFO ] Invariant cache hit.
[2024-05-23 19:17:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 19:17:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-23 19:17:40] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2024-05-23 19:17:40] [INFO ] Invariant cache hit.
[2024-05-23 19:17:40] [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-05-23 19:17:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:17:41] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:17:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 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 3718 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-05-23 19:17:44] [INFO ] Deduced a trap composed of 10 places in 34 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 5562 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 9353ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 9354ms
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 9505 ms. Remains : 63/319 places, 158/414 transitions.
Running random walk in product with property : HealthRecord-PT-16-LTLCardinality-02
Stuttering criterion allowed to conclude after 3058 steps with 294 reset in 9 ms.
Treatment of property HealthRecord-PT-16-LTLCardinality-02 finished in 9710 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-05-23 19:17:50] [INFO ] Flatten gal took : 21 ms
[2024-05-23 19:17:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-23 19:17:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 319 places, 414 transitions and 963 arcs took 4 ms.
Total runtime 466154 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 319
TRANSITIONS: 414
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2077
MODEL NAME: /home/mcc/execution/415/model
319 places, 414 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-16-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-16-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-16-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716492124651

--------------------
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

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="greatspnxred"
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 greatspnxred"
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 r179-tall-171640602400819"
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 ;