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.r528-tall-171683761500635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K May 18 16:43 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 ShieldPPPt-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717257639167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:00:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:00:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:00:40] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-01 16:00:40] [INFO ] Transformed 1563 places.
[2024-06-01 16:00:40] [INFO ] Transformed 1423 transitions.
[2024-06-01 16:00:40] [INFO ] Found NUPN structural information;
[2024-06-01 16:00:40] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 721 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2024-06-01 16:00:41] [INFO ] Computed 221 invariants in 31 ms
[2024-06-01 16:00:42] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-06-01 16:00:42] [INFO ] Invariant cache hit.
[2024-06-01 16:00:43] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Running 1204 sub problems to find dead transitions.
[2024-06-01 16:00:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 30356ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Starting structural reductions in LTL mode, iteration 1 : 1345/1563 places, 1205/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32761 ms. Remains : 1345/1563 places, 1205/1423 transitions.
Support contains 21 out of 1345 places after structural reductions.
[2024-06-01 16:01:13] [INFO ] Flatten gal took : 100 ms
[2024-06-01 16:01:13] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:01:14] [INFO ] Input system was already deterministic with 1205 transitions.
Support contains 19 out of 1345 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1560 ms. (25 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
[2024-06-01 16:01:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1075/1082 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 263/1345 variables, 44/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1345 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1205/2550 variables, 1345/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2550 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2550 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2550/2550 variables, and 1566 constraints, problems are : Problem set: 0 solved, 4 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1345/1345 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1075/1082 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 30 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 17/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 263/1345 variables, 44/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:01:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1345 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1205/2550 variables, 1345/1586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2550 variables, 4/1590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:01:18] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 4 ms to minimize.
[2024-06-01 16:01:18] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 4 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:01:19] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:01:20] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:01:20] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:01:20] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:01:20] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 4 ms to minimize.
SMT process timed out in 6052ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1345 transition count 930
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 550 place count 1070 transition count 930
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 550 place count 1070 transition count 772
Deduced a syphon composed of 158 places in 4 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 866 place count 912 transition count 772
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 867 place count 911 transition count 771
Iterating global reduction 2 with 1 rules applied. Total rules applied 868 place count 911 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 868 place count 911 transition count 770
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 870 place count 910 transition count 770
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 2 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1552 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1553 place count 569 transition count 428
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1555 place count 568 transition count 427
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1669 place count 511 transition count 427
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1727 place count 511 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1728 place count 510 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1729 place count 509 transition count 426
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1729 place count 509 transition count 424
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1733 place count 507 transition count 424
Applied a total of 1733 rules in 383 ms. Remains 507 /1345 variables (removed 838) and now considering 424/1205 (removed 781) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 507/1345 places, 424/1205 transitions.
RANDOM walk for 40000 steps (8 resets) in 619 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 169322 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 169322 steps, saw 139228 distinct states, run finished after 3012 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 424 rows 507 cols
[2024-06-01 16:01:24] [INFO ] Computed 220 invariants in 5 ms
[2024-06-01 16:01:24] [INFO ] State equation strengthened by 115 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 405/412 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/437 variables, 11/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/805 variables, 437/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 113/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 13/818 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 19/837 variables, 8/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 2/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/839 variables, 2/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/839 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/843 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/843 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 21/864 variables, 15/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/864 variables, 5/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/864 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 19/883 variables, 8/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/883 variables, 2/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/883 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/883 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/885 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/885 variables, 2/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/885 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 4/889 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/889 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 18/907 variables, 14/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/907 variables, 5/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/907 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 13/920 variables, 6/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/920 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/920 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/920 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 1/921 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/921 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/921 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 1/922 variables, 1/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/922 variables, 1/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/922 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 9/931 variables, 6/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/931 variables, 3/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/931 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 0/931 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 931/931 variables, and 842 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 507/507 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 405/412 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/437 variables, 11/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/805 variables, 437/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 113/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 4/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/805 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 13/818 variables, 7/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 19/837 variables, 8/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/839 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/839 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/843 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/843 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 21/864 variables, 15/783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/864 variables, 5/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/864 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 19/883 variables, 8/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/883 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/883 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/883 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 2/885 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/885 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/885 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 4/889 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/889 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 18/907 variables, 14/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/907 variables, 5/824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/907 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 13/920 variables, 6/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/920 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/920 variables, 1/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/920 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/921 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/921 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/921 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 1/922 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/922 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/922 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 9/931 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/931 variables, 3/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/931 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/931 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 931/931 variables, and 846 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 507/507 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4192ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 747 steps, including 25 resets, run visited all 4 properties in 23 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 34 ms.
Computed a total of 318 stabilizing places and 318 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' '!(X((F(p0)||X(F(p1)))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1342 transition count 1202
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1342 transition count 1202
Applied a total of 6 rules in 177 ms. Remains 1342 /1345 variables (removed 3) and now considering 1202/1205 (removed 3) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-06-01 16:01:29] [INFO ] Computed 221 invariants in 8 ms
[2024-06-01 16:01:29] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 16:01:29] [INFO ] Invariant cache hit.
[2024-06-01 16:01:30] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2024-06-01 16:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 1342/1345 places, 1202/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31874 ms. Remains : 1342/1345 places, 1202/1205 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-00 finished in 33009 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((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1344 transition count 929
Reduce places removed 275 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 551 place count 1069 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 552 place count 1068 transition count 928
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 552 place count 1068 transition count 771
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 866 place count 911 transition count 771
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 868 place count 909 transition count 769
Iterating global reduction 3 with 2 rules applied. Total rules applied 870 place count 909 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 870 place count 909 transition count 767
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1550 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1551 place count 569 transition count 428
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1553 place count 568 transition count 427
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1667 place count 511 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1670 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1670 place count 508 transition count 423
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1674 place count 506 transition count 423
Applied a total of 1674 rules in 352 ms. Remains 506 /1345 variables (removed 839) and now considering 423/1205 (removed 782) transitions.
// Phase 1: matrix 423 rows 506 cols
[2024-06-01 16:02:02] [INFO ] Computed 220 invariants in 1 ms
[2024-06-01 16:02:02] [INFO ] Implicit Places using invariants in 563 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 566 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1345 places, 423/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 46 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2024-06-01 16:02:03] [INFO ] Computed 218 invariants in 5 ms
[2024-06-01 16:02:03] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 16:02:03] [INFO ] Invariant cache hit.
[2024-06-01 16:02:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:02:03] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/1345 places, 421/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1749 ms. Remains : 502/1345 places, 421/1205 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 458 ms.
Product exploration explored 100000 steps with 0 reset in 709 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
[2024-06-01 16:02:06] [INFO ] Invariant cache hit.
[2024-06-01 16:02:06] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 52/93 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 77/170 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 10/180 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 10/190 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 103/293 variables, 55/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/293 variables, 11/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/293 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 11/304 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 11/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 6/310 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/310 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 135/445 variables, 67/293 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/445 variables, 18/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/445 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/459 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/459 variables, 14/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/459 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 16/475 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/475 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 145/620 variables, 83/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/620 variables, 15/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/620 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 14/634 variables, 20/465 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/634 variables, 14/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/634 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 4/638 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/638 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 78/716 variables, 47/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/716 variables, 16/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/716 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 5/721 variables, 6/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/721 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/721 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 4/725 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/725 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 65/790 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/790 variables, 11/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/790 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 4/794 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/794 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/794 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 37/831 variables, 19/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/831 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/831 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 4/835 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/835 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/835 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 4/839 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/839 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (OVERLAPS) 44/883 variables, 25/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/883 variables, 5/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/883 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (OVERLAPS) 4/887 variables, 6/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/887 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/887 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (OVERLAPS) 24/911 variables, 13/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/911 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/911 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (OVERLAPS) 3/914 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/914 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/914 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (OVERLAPS) 2/916 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/916 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 7/923 variables, 6/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/923 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/923 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 0/923 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 722 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 52/93 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 77/170 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 10/180 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 10/190 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 103/293 variables, 55/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/293 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/293 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 11/304 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/304 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 6/310 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/310 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 135/445 variables, 67/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/445 variables, 18/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/445 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 14/459 variables, 14/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/459 variables, 14/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/459 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 16/475 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/475 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 145/620 variables, 83/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/620 variables, 15/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/620 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 14/634 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/634 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/634 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 4/638 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/638 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 78/716 variables, 47/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/716 variables, 16/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/716 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 5/721 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/721 variables, 5/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/721 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 4/725 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/725 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 65/790 variables, 37/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/790 variables, 11/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/790 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 4/794 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/794 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/794 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 37/831 variables, 19/641 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/831 variables, 6/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/831 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 4/835 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/835 variables, 4/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/835 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 4/839 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/839 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 44/883 variables, 25/682 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/883 variables, 5/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/883 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 4/887 variables, 6/693 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/887 variables, 4/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/887 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 24/911 variables, 13/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/911 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/911 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 3/914 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/914 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/914 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 2/916 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/916 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (OVERLAPS) 7/923 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/923 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/923 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (OVERLAPS) 0/923 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 923/923 variables, and 729 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3674ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 236 steps, including 1 resets, run visited all 5 properties in 5 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 361 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 476 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-01 16:02:11] [INFO ] Invariant cache hit.
[2024-06-01 16:02:11] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 16:02:11] [INFO ] Invariant cache hit.
[2024-06-01 16:02:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:02:12] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-06-01 16:02:12] [INFO ] Redundant transitions in 22 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-01 16:02:12] [INFO ] Invariant cache hit.
[2024-06-01 16:02:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 4/502 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 421/923 variables, 502/722 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 0/923 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 724 constraints, problems are : Problem set: 0 solved, 415 unsolved in 28814 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 4/502 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 421/923 variables, 502/722 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/923 variables, 415/1139 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1139 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 2/2 constraints]
After SMT, in 58902ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 58906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59642 ms. Remains : 502/502 places, 421/421 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 305 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
[2024-06-01 16:03:12] [INFO ] Invariant cache hit.
[2024-06-01 16:03:12] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 52/93 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 77/170 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 10/180 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 10/190 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 103/293 variables, 55/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/293 variables, 11/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/293 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 11/304 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/304 variables, 11/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/304 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 6/310 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/310 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 135/445 variables, 67/293 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/445 variables, 18/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/445 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/459 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/459 variables, 14/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/459 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 16/475 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/475 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 145/620 variables, 83/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/620 variables, 15/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/620 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 14/634 variables, 20/465 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/634 variables, 14/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/634 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 4/638 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/638 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 78/716 variables, 47/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/716 variables, 16/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/716 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 5/721 variables, 6/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/721 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/721 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 4/725 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/725 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 65/790 variables, 37/594 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/790 variables, 11/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/790 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 4/794 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/794 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/794 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 37/831 variables, 19/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/831 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/831 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 4/835 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/835 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/835 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 4/839 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/839 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (OVERLAPS) 44/883 variables, 25/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/883 variables, 5/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/883 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (OVERLAPS) 4/887 variables, 6/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/887 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/887 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (OVERLAPS) 24/911 variables, 13/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/911 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/911 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (OVERLAPS) 3/914 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/914 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/914 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (OVERLAPS) 2/916 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/916 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 7/923 variables, 6/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/923 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/923 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 0/923 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 722 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:03:13] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 52/93 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 77/170 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:03:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 10/180 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 10/190 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 103/293 variables, 55/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/293 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/293 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 11/304 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/304 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/304 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 6/310 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/310 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 135/445 variables, 67/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/445 variables, 18/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/445 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 14/459 variables, 14/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/459 variables, 14/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/459 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 16/475 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/475 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 145/620 variables, 83/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/620 variables, 15/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/620 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 14/634 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/634 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/634 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 4/638 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/638 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 78/716 variables, 47/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/716 variables, 16/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/716 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 5/721 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/721 variables, 5/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/721 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 4/725 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/725 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 65/790 variables, 37/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/790 variables, 11/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/790 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 4/794 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/794 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/794 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 37/831 variables, 19/641 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/831 variables, 6/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/831 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 4/835 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/835 variables, 4/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/835 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 4/839 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/839 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 44/883 variables, 25/682 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/883 variables, 5/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/883 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 4/887 variables, 6/693 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/887 variables, 4/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/887 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 24/911 variables, 13/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/911 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/911 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 3/914 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/914 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/914 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 2/916 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/916 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (OVERLAPS) 7/923 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/923 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/923 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (OVERLAPS) 0/923 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 923/923 variables, and 729 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2171 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3670ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 393 steps, including 2 resets, run visited all 5 properties in 6 ms. (steps per millisecond=65 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 354 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 10 factoid took 501 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 449 ms.
Product exploration explored 100000 steps with 0 reset in 582 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 11 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-01 16:03:18] [INFO ] Invariant cache hit.
[2024-06-01 16:03:18] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 16:03:18] [INFO ] Invariant cache hit.
[2024-06-01 16:03:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:03:19] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-06-01 16:03:19] [INFO ] Redundant transitions in 2 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-01 16:03:19] [INFO ] Invariant cache hit.
[2024-06-01 16:03:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 4/502 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 421/923 variables, 502/722 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 0/923 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 724 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27674 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 4/502 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 421/923 variables, 502/722 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/923 variables, 415/1139 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1139 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 502/502 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 2/2 constraints]
After SMT, in 57758ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 57763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58501 ms. Remains : 502/502 places, 421/421 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-02 finished in 135244 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(p1)||p0)))'
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1343 transition count 1203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1343 transition count 1203
Applied a total of 4 rules in 87 ms. Remains 1343 /1345 variables (removed 2) and now considering 1203/1205 (removed 2) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-06-01 16:04:17] [INFO ] Computed 221 invariants in 12 ms
[2024-06-01 16:04:17] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 16:04:17] [INFO ] Invariant cache hit.
[2024-06-01 16:04:18] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-06-01 16:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30212ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1345 places, 1203/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31679 ms. Remains : 1343/1345 places, 1203/1205 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-04 finished in 32617 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 1 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1344 transition count 926
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1066 transition count 926
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1066 transition count 767
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 907 transition count 767
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 877 place count 904 transition count 764
Iterating global reduction 2 with 3 rules applied. Total rules applied 880 place count 904 transition count 764
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 880 place count 904 transition count 761
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 886 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1562 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1563 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1565 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1690 place count 498 transition count 417
Applied a total of 1690 rules in 144 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2024-06-01 16:04:50] [INFO ] Computed 220 invariants in 1 ms
[2024-06-01 16:04:50] [INFO ] Implicit Places using invariants in 283 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 285 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 15 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2024-06-01 16:04:50] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 16:04:50] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 16:04:50] [INFO ] Invariant cache hit.
[2024-06-01 16:04:51] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1158 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 444 ms.
Stack based approach found an accepted trace after 639 steps with 0 reset with depth 640 and stack size 640 in 5 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-05 finished in 1678 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(F(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1344 transition count 928
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1068 transition count 928
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 552 place count 1068 transition count 770
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 868 place count 910 transition count 770
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 871 place count 907 transition count 767
Iterating global reduction 2 with 3 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 874 place count 907 transition count 764
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 880 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1560 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1563 place count 563 transition count 422
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1677 place count 506 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1679 place count 504 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1680 place count 503 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1680 place count 503 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1684 place count 501 transition count 418
Applied a total of 1684 rules in 119 ms. Remains 501 /1345 variables (removed 844) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 501 cols
[2024-06-01 16:04:51] [INFO ] Computed 220 invariants in 1 ms
[2024-06-01 16:04:51] [INFO ] Implicit Places using invariants in 251 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1345 places, 418/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 416
Applied a total of 4 rules in 12 ms. Remains 497 /499 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 497 cols
[2024-06-01 16:04:51] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 16:04:52] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 16:04:52] [INFO ] Invariant cache hit.
[2024-06-01 16:04:52] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1065 ms. Remains : 497/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-06
Product exploration explored 100000 steps with 7769 reset in 403 ms.
Product exploration explored 100000 steps with 7725 reset in 476 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 416/416 transitions.
Applied a total of 0 rules in 13 ms. Remains 497 /497 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 16:04:54] [INFO ] Invariant cache hit.
[2024-06-01 16:04:54] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 16:04:54] [INFO ] Invariant cache hit.
[2024-06-01 16:04:54] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-06-01 16:04:55] [INFO ] Redundant transitions in 2 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-01 16:04:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 2/497 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (OVERLAPS) 416/913 variables, 497/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/913 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 0/913 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 715 constraints, problems are : Problem set: 0 solved, 413 unsolved in 28101 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 2/497 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (OVERLAPS) 416/913 variables, 497/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/913 variables, 413/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 0/913 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 1128 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 0/0 constraints]
After SMT, in 58170ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 58175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59069 ms. Remains : 497/497 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7874 reset in 379 ms.
Product exploration explored 100000 steps with 7729 reset in 459 ms.
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 416/416 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 16:05:54] [INFO ] Invariant cache hit.
[2024-06-01 16:05:55] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 16:05:55] [INFO ] Invariant cache hit.
[2024-06-01 16:05:55] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-06-01 16:05:55] [INFO ] Redundant transitions in 2 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-01 16:05:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 2/497 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (OVERLAPS) 416/913 variables, 497/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/913 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 0/913 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 715 constraints, problems are : Problem set: 0 solved, 413 unsolved in 27265 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 2/497 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (OVERLAPS) 416/913 variables, 497/715 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/913 variables, 413/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 0/913 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 1128 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 0/0 constraints]
After SMT, in 57346ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 57351ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58023 ms. Remains : 497/497 places, 416/416 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-06 finished in 121233 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)||F(X(F(G(p0))))))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1341 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1341 transition count 1201
Applied a total of 8 rules in 85 ms. Remains 1341 /1345 variables (removed 4) and now considering 1201/1205 (removed 4) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-06-01 16:06:52] [INFO ] Computed 221 invariants in 12 ms
[2024-06-01 16:06:53] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 16:06:53] [INFO ] Invariant cache hit.
[2024-06-01 16:06:54] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 16:06:54] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30191ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1345 places, 1201/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31704 ms. Remains : 1341/1345 places, 1201/1205 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 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 10 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-07 finished in 32527 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(X(F(p0))))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1341 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1341 transition count 1201
Applied a total of 8 rules in 79 ms. Remains 1341 /1345 variables (removed 4) and now considering 1201/1205 (removed 4) transitions.
[2024-06-01 16:07:25] [INFO ] Invariant cache hit.
[2024-06-01 16:07:25] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-01 16:07:25] [INFO ] Invariant cache hit.
[2024-06-01 16:07:26] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 16:07:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1345 places, 1201/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31687 ms. Remains : 1341/1345 places, 1201/1205 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 265 ms.
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 32392 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((G((!p0 U ((p1 U p2)||F(p1)))) U 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(F(p0)))'
[2024-06-01 16:07:58] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:07:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 16:07:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1345 places, 1205 transitions and 3130 arcs took 10 ms.
Total runtime 437783 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldPPPt-PT-020B-LTLCardinality-02
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717258194146

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPt-PT-020B-LTLCardinality-02
ltl formula formula --ltl=/tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1345 places, 1205 transitions and 3130 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.040 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 1346 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1346, there are 1651 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2497 levels ~10000 states ~61924 transitions
pnml2lts-mc( 0/ 4): ~4991 levels ~20000 states ~109008 transitions
pnml2lts-mc( 0/ 4): ~9985 levels ~40000 states ~199408 transitions
pnml2lts-mc( 3/ 4): ~18204 levels ~80000 states ~414852 transitions
pnml2lts-mc( 3/ 4): ~32958 levels ~160000 states ~771368 transitions
pnml2lts-mc( 3/ 4): ~60059 levels ~320000 states ~1599944 transitions
pnml2lts-mc( 3/ 4): ~114211 levels ~640000 states ~3432912 transitions
pnml2lts-mc( 3/ 4): ~222870 levels ~1280000 states ~7112548 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 149153
pnml2lts-mc( 0/ 4): unique states count: 2073875
pnml2lts-mc( 0/ 4): unique transitions count: 12463868
pnml2lts-mc( 0/ 4): - self-loop count: 6
pnml2lts-mc( 0/ 4): - claim dead count: 640467
pnml2lts-mc( 0/ 4): - claim found count: 4506736
pnml2lts-mc( 0/ 4): - claim success count: 2073885
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1909260
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2073885 states 12463887 transitions, fanout: 6.010
pnml2lts-mc( 0/ 4): Total exploration time 113.950 sec (113.930 sec minimum, 113.942 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18200, Transitions per second: 109380
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 117.3MB, 17.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1235 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 117.3MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-020B-LTLCardinality-06
ltl formula formula --ltl=/tmp/1342/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1345 places, 1205 transitions and 3130 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1342/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1347 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1346, there are 1214 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~806!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1340
pnml2lts-mc( 0/ 4): unique states count: 3921
pnml2lts-mc( 0/ 4): unique transitions count: 34247
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1136
pnml2lts-mc( 0/ 4): - claim found count: 174
pnml2lts-mc( 0/ 4): - claim success count: 3930
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2609
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3930 states 34269 transitions, fanout: 8.720
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 12281, Transitions per second: 107091
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 23.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1235 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-020B, 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 r528-tall-171683761500635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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