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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 14:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 11 14:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 84K 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 ShieldIIPs-PT-010A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-010A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716887673072

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:14:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:14:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:14:34] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-28 09:14:34] [INFO ] Transformed 253 places.
[2024-05-28 09:14:34] [INFO ] Transformed 243 transitions.
[2024-05-28 09:14:34] [INFO ] Found NUPN structural information;
[2024-05-28 09:14:34] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 21 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:14:34] [INFO ] Computed 91 invariants in 11 ms
[2024-05-28 09:14:34] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-28 09:14:34] [INFO ] Invariant cache hit.
[2024-05-28 09:14:35] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 9 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:39] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:46] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:14:47] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:14:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:14:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21589 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25572 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 47276ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47292ms
Finished structural reductions in LTL mode , in 1 iterations and 47964 ms. Remains : 253/253 places, 243/243 transitions.
Support contains 35 out of 253 places after structural reductions.
[2024-05-28 09:15:22] [INFO ] Flatten gal took : 54 ms
[2024-05-28 09:15:22] [INFO ] Flatten gal took : 26 ms
[2024-05-28 09:15:22] [INFO ] Input system was already deterministic with 243 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 2352 steps (1 resets) in 87 ms. (26 steps per ms) remains 0/20 properties
FORMULA ShieldIIPs-PT-010A-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Applied a total of 2 rules in 37 ms. Remains 252 /253 variables (removed 1) and now considering 242/243 (removed 1) transitions.
// Phase 1: matrix 242 rows 252 cols
[2024-05-28 09:15:23] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 09:15:23] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 09:15:23] [INFO ] Invariant cache hit.
[2024-05-28 09:15:23] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-28 09:15:23] [INFO ] Redundant transitions in 41 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 09:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:15:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-28 09:15:28] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/494 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:15:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 9/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:15:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:15:38] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/494 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 622 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21292 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 27/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/494 variables, 252/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 241/863 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:15:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:16:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 866 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30019 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 30/30 constraints]
After SMT, in 51366ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 51369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/253 places, 242/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51807 ms. Remains : 252/253 places, 242/243 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-00 finished in 52074 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((F(p1)||p0))||G(p2))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
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 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 28 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 09:16:15] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 09:16:15] [INFO ] Implicit Places using invariants in 134 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-03
Product exploration explored 100000 steps with 234 reset in 512 ms.
Stuttering criterion allowed to conclude after 48040 steps with 115 reset in 213 ms.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-03 finished in 993 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(F(p0))&&(p0 U (G(p1) U X(p2))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:16:16] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 09:16:16] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 09:16:16] [INFO ] Invariant cache hit.
[2024-05-28 09:16:16] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:16:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:16:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:16:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:16:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:16:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:16:28] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:16:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21849 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25225 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 47120ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47123ms
Finished structural reductions in LTL mode , in 1 iterations and 47489 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-04
Product exploration explored 100000 steps with 845 reset in 331 ms.
Product exploration explored 100000 steps with 842 reset in 469 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
RANDOM walk for 1698 steps (2 resets) in 20 ms. (80 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Support contains 3 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
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 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 21 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 09:17:06] [INFO ] Computed 91 invariants in 3 ms
[2024-05-28 09:17:06] [INFO ] Implicit Places using invariants in 132 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 250/253 places, 241/243 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
RANDOM walk for 2337 steps (3 resets) in 25 ms. (89 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 1707 reset in 325 ms.
Product exploration explored 100000 steps with 1757 reset in 364 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 250 cols
[2024-05-28 09:17:09] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 09:17:09] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 09:17:09] [INFO ] Invariant cache hit.
[2024-05-28 09:17:10] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-28 09:17:10] [INFO ] Redundant transitions in 40 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 250 cols
[2024-05-28 09:17:10] [INFO ] Computed 90 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/615 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:21] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:17:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:17:22] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 618 constraints, problems are : Problem set: 0 solved, 239 unsolved in 17757 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 240/490 variables, 250/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 239/858 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:17:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:17:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 860 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30020 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 31/31 constraints]
After SMT, in 47826ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 47828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 240/241 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48249 ms. Remains : 250/250 places, 240/241 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-04 finished in 101818 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((G(F(p0)) U (!p0||X(!p1)))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:17:58] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:17:58] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 09:17:58] [INFO ] Invariant cache hit.
[2024-05-28 09:17:58] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:17:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:18:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:18:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:18:02] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:03] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:18:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:18:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:18:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:08] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
[2024-05-28 09:18:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:18:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:10] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:18:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21504 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25306 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 46854ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 46857ms
Finished structural reductions in LTL mode , in 1 iterations and 47200 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-05
Product exploration explored 100000 steps with 1967 reset in 304 ms.
Product exploration explored 100000 steps with 1993 reset in 339 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
RANDOM walk for 298 steps (0 resets) in 9 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
[2024-05-28 09:18:46] [INFO ] Invariant cache hit.
[2024-05-28 09:18:47] [INFO ] [Real]Absence check using 91 positive place invariants in 20 ms returned sat
[2024-05-28 09:18:47] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-28 09:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:18:47] [INFO ] [Nat]Absence check using 91 positive place invariants in 27 ms returned sat
[2024-05-28 09:18:47] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-28 09:18:47] [INFO ] Computed and/alt/rep : 224/783/224 causal constraints (skipped 18 transitions) in 18 ms.
[2024-05-28 09:18:48] [INFO ] Added : 194 causal constraints over 39 iterations in 1100 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
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 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 13 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2024-05-28 09:18:48] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 09:18:48] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 09:18:48] [INFO ] Invariant cache hit.
[2024-05-28 09:18:49] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-28 09:18:49] [INFO ] Redundant transitions in 32 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2024-05-28 09:18:49] [INFO ] Computed 90 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:18:50] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:18:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:18:59] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:19:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:19:11] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:19:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:19:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:19:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:19:14] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 timeout
0.0)
(s190 0.0)
(s191 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 633 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30021 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 45/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:19:36] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 872 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30020 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 46/46 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60505 ms. Remains : 249/253 places, 239/243 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 : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
RANDOM walk for 193 steps (0 resets) in 11 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
[2024-05-28 09:19:50] [INFO ] Invariant cache hit.
[2024-05-28 09:19:50] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-05-28 09:19:50] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-28 09:19:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:19:50] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 09:19:50] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-28 09:19:50] [INFO ] Computed and/alt/rep : 238/587/238 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-28 09:19:52] [INFO ] Added : 205 causal constraints over 41 iterations in 1287 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 148 ms :[(AND p0 p1), p1, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2133 reset in 279 ms.
Stuttering criterion allowed to conclude after 29820 steps with 632 reset in 108 ms.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-05 finished in 114490 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(G(p0))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:19:52] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:19:52] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 09:19:52] [INFO ] Invariant cache hit.
[2024-05-28 09:19:52] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:20:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20881 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24183 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45102ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45108ms
Finished structural reductions in LTL mode , in 1 iterations and 45471 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 339 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-07 finished in 45623 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' '!(((p0 U (G(p1)||X(F(!p2)))) U (X(p2)&&G(p0))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:20:38] [INFO ] Invariant cache hit.
[2024-05-28 09:20:38] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 09:20:38] [INFO ] Invariant cache hit.
[2024-05-28 09:20:38] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:20:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
[2024-05-28 09:20:50] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:20:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20995 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24186 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45225ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45228ms
Finished structural reductions in LTL mode , in 1 iterations and 45586 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p2)), p2, (AND p2 (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-09
Stuttering criterion allowed to conclude after 5712 steps with 30 reset in 24 ms.
FORMULA ShieldIIPs-PT-010A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-09 finished in 45850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1&&X(F(p2)))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:21:24] [INFO ] Invariant cache hit.
[2024-05-28 09:21:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 09:21:24] [INFO ] Invariant cache hit.
[2024-05-28 09:21:24] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:21:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-28 09:21:28] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:21:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:21:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:21:35] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:21:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21031 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24788 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45854ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45857ms
Finished structural reductions in LTL mode , in 1 iterations and 46218 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-11
Product exploration explored 100000 steps with 8352 reset in 287 ms.
Product exploration explored 100000 steps with 8364 reset in 320 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
RANDOM walk for 1405 steps (0 resets) in 15 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
[2024-05-28 09:22:11] [INFO ] Invariant cache hit.
[2024-05-28 09:22:11] [INFO ] [Real]Absence check using 91 positive place invariants in 19 ms returned sat
[2024-05-28 09:22:12] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-28 09:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:22:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 17 ms returned sat
[2024-05-28 09:22:12] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-28 09:22:12] [INFO ] Computed and/alt/rep : 224/783/224 causal constraints (skipped 18 transitions) in 15 ms.
[2024-05-28 09:22:13] [INFO ] Added : 195 causal constraints over 39 iterations in 1173 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:22:13] [INFO ] Invariant cache hit.
[2024-05-28 09:22:13] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 09:22:13] [INFO ] Invariant cache hit.
[2024-05-28 09:22:13] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:22:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:22:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:22:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:22:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:22:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21150 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24665 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 45860ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 45862ms
Finished structural reductions in LTL mode , in 1 iterations and 46218 ms. Remains : 253/253 places, 243/243 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
RANDOM walk for 1372 steps (0 resets) in 15 ms. (85 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
[2024-05-28 09:23:00] [INFO ] Invariant cache hit.
[2024-05-28 09:23:00] [INFO ] [Real]Absence check using 91 positive place invariants in 18 ms returned sat
[2024-05-28 09:23:00] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-28 09:23:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 17 ms returned sat
[2024-05-28 09:23:01] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-28 09:23:01] [INFO ] Computed and/alt/rep : 224/783/224 causal constraints (skipped 18 transitions) in 15 ms.
[2024-05-28 09:23:02] [INFO ] Added : 195 causal constraints over 39 iterations in 1164 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 8376 reset in 272 ms.
Product exploration explored 100000 steps with 8347 reset in 310 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 253 transition count 243
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 28 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-28 09:23:03] [INFO ] Redundant transitions in 30 ms returned [235]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 242 rows 253 cols
[2024-05-28 09:23:03] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:23:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 12/356 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/357 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 242/495 variables, 253/610 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 3/613 constraints. Problems are: Problem set: 2 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/613 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 0/495 variables, 0/613 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 613 constraints, problems are : Problem set: 2 solved, 239 unsolved in 14253 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 3/253 variables, 91/341 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 3/344 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 13/357 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 242/495 variables, 253/610 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 3/613 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 239/852 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-28 09:23:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:23:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:23:23] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 3/855 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:23:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 2/857 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 857 constraints, problems are : Problem set: 2 solved, 239 unsolved in 30015 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 18/18 constraints]
After SMT, in 44313ms problems are : Problem set: 2 solved, 239 unsolved
Search for dead transitions found 2 dead transitions in 44315ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 253/253 places, 240/243 transitions.
Graph (complete) has 879 edges and 253 vertex of which 251 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 251 /253 variables (removed 2) and now considering 240/240 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 251/253 places, 240/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44391 ms. Remains : 251/253 places, 240/243 transitions.
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 09:23:47] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:23:48] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 09:23:48] [INFO ] Invariant cache hit.
[2024-05-28 09:23:48] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-28 09:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:23:52] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:23:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/496 variables, 253/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:23:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:23:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:23:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 626 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20915 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/626 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 23510 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 29/29 constraints]
After SMT, in 44467ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 44469ms
Finished structural reductions in LTL mode , in 1 iterations and 44828 ms. Remains : 253/253 places, 243/243 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-11 finished in 188772 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||G(p1)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
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 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 18 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2024-05-28 09:24:32] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 09:24:32] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 09:24:32] [INFO ] Invariant cache hit.
[2024-05-28 09:24:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-28 09:24:33] [INFO ] Redundant transitions in 30 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2024-05-28 09:24:33] [INFO ] Computed 90 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:24:34] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:24:35] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:37] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:24:37] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:24:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:24:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:24:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:24:38] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:24:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:39] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:24:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:24:39] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:24:39] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:24:39] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:24:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:24:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:44] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:24:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:24:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:45] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:24:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:49] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:24:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:24:52] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:24:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:24:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:24:55] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:24:55] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:24:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:24:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:24:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/488 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 634 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30010 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 46/385 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/634 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/872 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:25:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 874 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30017 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 48/48 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60454 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-12
Product exploration explored 100000 steps with 219 reset in 349 ms.
Product exploration explored 100000 steps with 218 reset in 391 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7335 steps (11 resets) in 52 ms. (138 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 239/239 transitions.
Applied a total of 0 rules in 8 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 09:25:34] [INFO ] Invariant cache hit.
[2024-05-28 09:25:34] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 09:25:34] [INFO ] Invariant cache hit.
[2024-05-28 09:25:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-28 09:25:35] [INFO ] Redundant transitions in 27 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 09:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:25:36] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:25:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 12/610 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:42] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:25:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:25:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:25:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 624 constraints, problems are : Problem set: 0 solved, 238 unsolved in 24869 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 36/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 865 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 39/39 constraints]
After SMT, in 54919ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 54921ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55308 ms. Remains : 249/249 places, 239/239 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 : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5547 steps (7 resets) in 43 ms. (126 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 222 reset in 329 ms.
Product exploration explored 100000 steps with 222 reset in 367 ms.
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 239/239 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-28 09:26:31] [INFO ] Invariant cache hit.
[2024-05-28 09:26:31] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 09:26:31] [INFO ] Invariant cache hit.
[2024-05-28 09:26:31] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-28 09:26:31] [INFO ] Redundant transitions in 29 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-28 09:26:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:26:34] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 12/610 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:26:38] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:26:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/488 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 624 constraints, problems are : Problem set: 0 solved, 238 unsolved in 24693 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 36/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:27:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-28 09:27:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:27:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 865 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30017 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 39/39 constraints]
After SMT, in 54744ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 54746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55111 ms. Remains : 249/249 places, 239/239 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-12 finished in 173674 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((X(F(p1))||p0))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Applied a total of 2 rules in 9 ms. Remains 252 /253 variables (removed 1) and now considering 242/243 (removed 1) transitions.
// Phase 1: matrix 242 rows 252 cols
[2024-05-28 09:27:26] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:27:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 09:27:26] [INFO ] Invariant cache hit.
[2024-05-28 09:27:26] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-28 09:27:26] [INFO ] Redundant transitions in 29 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 09:27:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:27:31] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/494 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 9/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:27:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:27:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/494 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 622 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20963 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 27/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/494 variables, 252/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 241/863 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:27:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 866 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30015 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 30/30 constraints]
After SMT, in 51014ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 51018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/253 places, 242/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51402 ms. Remains : 252/253 places, 242/243 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-15
Product exploration explored 100000 steps with 1431 reset in 305 ms.
Product exploration explored 100000 steps with 1467 reset in 338 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (73 resets) in 192 ms. (207 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
[2024-05-28 09:28:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 245/252 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 245/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/494 variables, 252/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/494 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/494 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 2/252 constraints, Positive P Invariants (semi-flows): 0/91 constraints, State Equation: 0/252 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-28 09:28:19] [INFO ] Invariant cache hit.
[2024-05-28 09:28:19] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 09:28:19] [INFO ] Invariant cache hit.
[2024-05-28 09:28:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-28 09:28:19] [INFO ] Redundant transitions in 28 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 09:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:28:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:28:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:28:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:28:24] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/494 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:28:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:28:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:28:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 9/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/494 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 622 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20358 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 27/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/494 variables, 252/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 241/863 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 866 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30017 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 30/30 constraints]
After SMT, in 50412ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 50415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50817 ms. Remains : 252/252 places, 242/242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 72 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 205 steps (0 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 118 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 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1454 reset in 300 ms.
Product exploration explored 100000 steps with 1455 reset in 333 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-28 09:29:11] [INFO ] Invariant cache hit.
[2024-05-28 09:29:11] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 09:29:11] [INFO ] Invariant cache hit.
[2024-05-28 09:29:11] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-28 09:29:11] [INFO ] Redundant transitions in 28 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-28 09:29:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/494 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 9/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:29:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:29:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/494 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 0/494 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 622 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20847 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 91/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 27/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/494 variables, 252/622 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 241/863 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:29:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 866 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30012 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 30/30 constraints]
After SMT, in 50895ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 50898ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51279 ms. Remains : 252/252 places, 242/242 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-15 finished in 156247 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(F(p0))&&(p0 U (G(p1) U X(p2))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010A-LTLCardinality-04
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 3 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
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 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 12 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 09:30:03] [INFO ] Computed 91 invariants in 3 ms
[2024-05-28 09:30:03] [INFO ] Implicit Places using invariants in 132 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 150 ms. Remains : 250/253 places, 241/243 transitions.
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-04
Product exploration explored 100000 steps with 897 reset in 301 ms.
Product exploration explored 100000 steps with 899 reset in 341 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
RANDOM walk for 984 steps (1 resets) in 10 ms. (89 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Support contains 3 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 250 cols
[2024-05-28 09:30:05] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 09:30:05] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 09:30:05] [INFO ] Invariant cache hit.
[2024-05-28 09:30:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-28 09:30:05] [INFO ] Redundant transitions in 29 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 250 cols
[2024-05-28 09:30:05] [INFO ] Computed 90 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:30:08] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/615 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 618 constraints, problems are : Problem set: 0 solved, 239 unsolved in 17803 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 240/490 variables, 250/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 239/858 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 860 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30011 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 31/31 constraints]
After SMT, in 47850ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 47853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 240/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48261 ms. Remains : 250/250 places, 240/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
RANDOM walk for 851 steps (0 resets) in 13 ms. (60 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 13 factoid took 367 ms. Reduced automaton from 11 states, 28 edges and 2 AP (stutter insensitive) to 11 states, 28 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2), (AND p0 (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 1768 reset in 321 ms.
Product exploration explored 100000 steps with 1762 reset in 353 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-28 09:30:56] [INFO ] Invariant cache hit.
[2024-05-28 09:30:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 09:30:57] [INFO ] Invariant cache hit.
[2024-05-28 09:30:57] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-28 09:30:57] [INFO ] Redundant transitions in 27 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-28 09:30:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:31:01] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:31:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:31:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:31:13] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/490 variables, 4/614 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/490 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:31:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:31:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:31:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:31:24] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:31:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:31:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:31:26] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 7/626 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:26] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:31:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:31:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:31:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 630 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30010 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 40/380 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/630 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 239/869 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:31] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:31:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/871 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:31:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 872 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 43/43 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60455 ms. Remains : 250/250 places, 240/240 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-04 finished in 114662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1&&X(F(p2)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010A-LTLCardinality-11
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
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 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 11 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 09:31:57] [INFO ] Computed 91 invariants in 1 ms
[2024-05-28 09:31:57] [INFO ] Implicit Places using invariants in 130 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 146 ms. Remains : 250/253 places, 241/243 transitions.
Running random walk in product with property : ShieldIIPs-PT-010A-LTLCardinality-11
Product exploration explored 100000 steps with 9734 reset in 292 ms.
Product exploration explored 100000 steps with 9833 reset in 327 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
RANDOM walk for 1566 steps (0 resets) in 20 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
// Phase 1: matrix 241 rows 250 cols
[2024-05-28 09:31:59] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 09:31:59] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-05-28 09:31:59] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-28 09:31:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:31:59] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-05-28 09:31:59] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-28 09:31:59] [INFO ] Computed and/alt/rep : 222/781/222 causal constraints (skipped 18 transitions) in 17 ms.
[2024-05-28 09:32:00] [INFO ] Added : 150 causal constraints over 30 iterations in 856 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 09:32:00] [INFO ] Invariant cache hit.
[2024-05-28 09:32:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 09:32:00] [INFO ] Invariant cache hit.
[2024-05-28 09:32:01] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-28 09:32:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:32:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/491 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:32:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:32:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:32:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:32:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:32:23] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:32:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 7/626 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/491 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 628 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 38/378 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 241/491 variables, 250/630 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 240/870 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 871 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30015 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 41/41 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 250/250 places, 241/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
RANDOM walk for 1188 steps (0 resets) in 13 ms. (84 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
[2024-05-28 09:33:01] [INFO ] Invariant cache hit.
[2024-05-28 09:33:01] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2024-05-28 09:33:02] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-28 09:33:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:33:02] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-05-28 09:33:02] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-28 09:33:02] [INFO ] Computed and/alt/rep : 222/781/222 causal constraints (skipped 18 transitions) in 16 ms.
[2024-05-28 09:33:03] [INFO ] Added : 219 causal constraints over 44 iterations in 1118 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 9830 reset in 287 ms.
Product exploration explored 100000 steps with 9878 reset in 318 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 09:33:04] [INFO ] Redundant transitions in 32 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 250 cols
[2024-05-28 09:33:04] [INFO ] Computed 90 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:33:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:33:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:33:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:33:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:33:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:33:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/615 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:15] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:33:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:33:16] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 618 constraints, problems are : Problem set: 0 solved, 239 unsolved in 17349 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 240/490 variables, 250/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 239/858 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-28 09:33:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:33:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 860 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30007 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 31/31 constraints]
After SMT, in 47398ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 47400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 240/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47450 ms. Remains : 250/250 places, 240/241 transitions.
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 1 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 250 cols
[2024-05-28 09:33:51] [INFO ] Computed 90 invariants in 2 ms
[2024-05-28 09:33:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 09:33:52] [INFO ] Invariant cache hit.
[2024-05-28 09:33:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-28 09:33:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/491 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:33:59] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:34:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:34:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34:01] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:34:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:34:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:02] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:34:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:34:12] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:34:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:34:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:34:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:34:14] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 7/626 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/491 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:21] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 628 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30013 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 38/378 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 241/491 variables, 250/630 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 240/870 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 09:34:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 871 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30015 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 41/41 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 250/250 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010A-LTLCardinality-11 finished in 175025 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||G(p1)))))'
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((X(F(p1))||p0))))'
[2024-05-28 09:34:52] [INFO ] Flatten gal took : 21 ms
[2024-05-28 09:34:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 09:34:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 243 transitions and 1086 arcs took 6 ms.
Total runtime 1218463 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-010A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 253
TRANSITIONS: 243
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]


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


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

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

Process ID: 4822
MODEL NAME: /home/mcc/execution/413/model
253 places, 243 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-010A, 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 r355-tall-171683758000083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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