Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 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 167K 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 ShieldIIPt-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717236565062

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:09:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:09:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:09:26] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 10:09:26] [INFO ] Transformed 703 places.
[2024-06-01 10:09:26] [INFO ] Transformed 653 transitions.
[2024-06-01 10:09:26] [INFO ] Found NUPN structural information;
[2024-06-01 10:09:26] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 105 place count 598 transition count 548
Iterating global reduction 0 with 105 rules applied. Total rules applied 210 place count 598 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 597 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 597 transition count 547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 213 place count 596 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 214 place count 596 transition count 546
Applied a total of 214 rules in 163 ms. Remains 596 /703 variables (removed 107) and now considering 546/653 (removed 107) transitions.
// Phase 1: matrix 546 rows 596 cols
[2024-06-01 10:09:26] [INFO ] Computed 91 invariants in 26 ms
[2024-06-01 10:09:27] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 10:09:27] [INFO ] Invariant cache hit.
[2024-06-01 10:09:27] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 545 sub problems to find dead transitions.
[2024-06-01 10:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 10 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 4 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 10:09:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 5 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-06-01 10:09:42] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-01 10:09:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:42] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:09:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:09:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:09:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 4 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:09:50] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:51] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:09:51] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:09:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:09:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:09:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
[2024-06-01 10:09:53] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1142 variables, and 171 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:10:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:10:07] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:07] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:10:12] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:10:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:10:16] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:10:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:10:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 10:10:22] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:10:23] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/1142 variables, and 191 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 0/545 constraints, Known Traps: 100/100 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 596/703 places, 546/653 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61217 ms. Remains : 596/703 places, 546/653 transitions.
Support contains 22 out of 596 places after structural reductions.
[2024-06-01 10:10:27] [INFO ] Flatten gal took : 59 ms
[2024-06-01 10:10:28] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:10:28] [INFO ] Input system was already deterministic with 546 transitions.
RANDOM walk for 40000 steps (8 resets) in 1075 ms. (37 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2024-06-01 10:10:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 564/596 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 546/1142 variables, 596/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1142 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1142 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 564/596 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:10:28] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-01 10:10:28] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 546/1142 variables, 596/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:10:29] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:10:30] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 5/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1142 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1142 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 1623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 164 ms.
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 546/546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 596 transition count 424
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 474 transition count 424
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 244 place count 474 transition count 346
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 400 place count 396 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 392 transition count 342
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 392 transition count 342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 408 place count 392 transition count 339
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 389 transition count 339
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 2 with 334 rules applied. Total rules applied 748 place count 222 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 749 place count 222 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 751 place count 221 transition count 170
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 809 place count 192 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 192 transition count 188
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 820 place count 192 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 821 place count 191 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 823 place count 189 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 823 place count 189 transition count 186
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 825 place count 188 transition count 186
Applied a total of 825 rules in 107 ms. Remains 188 /596 variables (removed 408) and now considering 186/546 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 188/596 places, 186/546 transitions.
RANDOM walk for 6319 steps (1 resets) in 228 ms. (27 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-010B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 161 stabilizing places and 161 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(F(p0)))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 595 transition count 425
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 475 transition count 425
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 240 place count 475 transition count 348
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 394 place count 398 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 398 place count 394 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 402 place count 394 transition count 344
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 402 place count 394 transition count 341
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 408 place count 391 transition count 341
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 734 place count 228 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 735 place count 228 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 737 place count 227 transition count 176
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 793 place count 199 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 197 transition count 192
Applied a total of 795 rules in 82 ms. Remains 197 /596 variables (removed 399) and now considering 192/546 (removed 354) transitions.
// Phase 1: matrix 192 rows 197 cols
[2024-06-01 10:10:30] [INFO ] Computed 91 invariants in 1 ms
[2024-06-01 10:10:30] [INFO ] Implicit Places using invariants in 104 ms returned [190]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/596 places, 192/546 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 196 transition count 191
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 195 transition count 191
Applied a total of 2 rules in 9 ms. Remains 195 /196 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 195 cols
[2024-06-01 10:10:30] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 10:10:30] [INFO ] Implicit Places using invariants in 100 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/596 places, 191/546 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 193 transition count 190
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 190/191 (removed 1) transitions.
// Phase 1: matrix 190 rows 193 cols
[2024-06-01 10:10:31] [INFO ] Computed 89 invariants in 1 ms
[2024-06-01 10:10:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 10:10:31] [INFO ] Invariant cache hit.
[2024-06-01 10:10:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 10:10:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 193/596 places, 190/546 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 585 ms. Remains : 193/596 places, 190/546 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-01 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&G(p1))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 591 transition count 541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 591 transition count 541
Applied a total of 10 rules in 23 ms. Remains 591 /596 variables (removed 5) and now considering 541/546 (removed 5) transitions.
// Phase 1: matrix 541 rows 591 cols
[2024-06-01 10:10:31] [INFO ] Computed 91 invariants in 5 ms
[2024-06-01 10:10:31] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 10:10:31] [INFO ] Invariant cache hit.
[2024-06-01 10:10:32] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 10:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:10:41] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-06-01 10:10:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-06-01 10:10:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:10:42] [INFO ] Deduced a trap composed of 12 places in 752 ms of which 18 ms to minimize.
[2024-06-01 10:10:42] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-06-01 10:10:42] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:10:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:10:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:10:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:10:45] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:10:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:10:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:10:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-06-01 10:10:47] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:10:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:10:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:10:54] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:10:54] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:10:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:10:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:10:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:10:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:10:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:10:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:10:56] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 3 ms to minimize.
[2024-06-01 10:10:56] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:10:57] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:10:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-06-01 10:10:58] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-06-01 10:10:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:10:59] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:11:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:11:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:11:01] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:11:01] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:11:01] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/1132 variables, and 171 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/591 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:07] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:11:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:11:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:11:09] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:11:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:11:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:11:10] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:11:10] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-01 10:11:10] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:11:11] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 541/1132 variables, 591/777 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 540/1317 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:22] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:11:22] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:11:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:11:22] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2024-06-01 10:11:23] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-01 10:11:23] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-06-01 10:11:24] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 4 ms to minimize.
[2024-06-01 10:11:24] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-06-01 10:11:25] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 3 ms to minimize.
[2024-06-01 10:11:25] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 4 ms to minimize.
[2024-06-01 10:11:25] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 4 ms to minimize.
[2024-06-01 10:11:26] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-01 10:11:26] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-06-01 10:11:27] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2024-06-01 10:11:28] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2024-06-01 10:11:28] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-06-01 10:11:28] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-06-01 10:11:29] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-01 10:11:29] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-06-01 10:11:29] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1132/1132 variables, and 1337 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 115/115 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 591/596 places, 541/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60656 ms. Remains : 591/596 places, 541/546 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-02
Product exploration explored 100000 steps with 65 reset in 456 ms.
Stack based approach found an accepted trace after 20000 steps with 19 reset with depth 1950 and stack size 1935 in 70 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-02 finished in 61335 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||(p1&&X(p1))) U (G((!p0||(p1&&X(p1))))||((!p0||(p1&&X(p1)))&&G(p2)))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 591 transition count 541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 591 transition count 541
Applied a total of 10 rules in 19 ms. Remains 591 /596 variables (removed 5) and now considering 541/546 (removed 5) transitions.
[2024-06-01 10:11:32] [INFO ] Invariant cache hit.
[2024-06-01 10:11:33] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 10:11:33] [INFO ] Invariant cache hit.
[2024-06-01 10:11:33] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-06-01 10:11:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:11:42] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:11:43] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-01 10:11:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:11:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:11:44] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-06-01 10:11:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:11:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-01 10:11:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:11:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:11:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:11:47] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:11:47] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:52] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:11:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:11:54] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:11:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:11:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:11:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:11:58] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:11:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:11:58] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:11:59] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:12:00] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/1132 variables, and 171 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/591 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:12:08] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:12:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:12:09] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:12:10] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:12:11] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:12:11] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:12:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:12:11] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:12:12] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 541/1132 variables, 591/777 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 540/1317 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-06-01 10:12:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:12:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:12:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:12:23] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 4 ms to minimize.
[2024-06-01 10:12:23] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-06-01 10:12:24] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 4 ms to minimize.
[2024-06-01 10:12:25] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 4 ms to minimize.
[2024-06-01 10:12:25] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-06-01 10:12:25] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
[2024-06-01 10:12:25] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
[2024-06-01 10:12:26] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2024-06-01 10:12:27] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 4 ms to minimize.
[2024-06-01 10:12:27] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 4 ms to minimize.
[2024-06-01 10:12:28] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-06-01 10:12:28] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-06-01 10:12:28] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-06-01 10:12:29] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 10:12:29] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-06-01 10:12:29] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-06-01 10:12:30] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1132/1132 variables, and 1337 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 115/115 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 591/596 places, 541/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 591/596 places, 541/546 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND p0 (NOT p1)), true, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-04
Product exploration explored 100000 steps with 33350 reset in 215 ms.
Product exploration explored 100000 steps with 33387 reset in 197 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p2 p0 (NOT p1)))), (X p1), (X (AND p2 p0 p1)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 136 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), true, (NOT p1), (AND p0 (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
[2024-06-01 10:12:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 541/591 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 541/1132 variables, 591/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1132 variables, and 682 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 541/591 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 541/1132 variables, 591/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:12:35] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:12:36] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:12:36] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:12:36] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:12:36] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:12:36] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1132 variables, 6/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1132 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1132 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1132 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 1650ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 541/541 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 591 transition count 425
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 475 transition count 425
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 232 place count 475 transition count 344
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 394 place count 394 transition count 344
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 732 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 733 place count 225 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 735 place count 224 transition count 173
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 791 place count 196 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 792 place count 196 transition count 189
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 801 place count 196 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 195 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 804 place count 193 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 804 place count 193 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 806 place count 192 transition count 187
Applied a total of 806 rules in 47 ms. Remains 192 /591 variables (removed 399) and now considering 187/541 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 192/591 places, 187/541 transitions.
RANDOM walk for 13984 steps (2 resets) in 72 ms. (191 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p2 p0 (NOT p1)))), (X p1), (X (AND p2 p0 p1)), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (F (NOT (AND (OR p0 p2) (OR p2 (NOT p1))))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p2 p1)))
Knowledge based reduction with 25 factoid took 290 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-04 finished in 64079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1)))||G(p0)))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 595 transition count 427
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 477 transition count 427
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 236 place count 477 transition count 351
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 388 place count 401 transition count 351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 391 place count 398 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 394 place count 398 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 394 place count 398 transition count 346
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 398 place count 396 transition count 346
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 736 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 737 place count 227 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 739 place count 226 transition count 175
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 793 place count 199 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 197 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 196 transition count 189
Applied a total of 796 rules in 55 ms. Remains 196 /596 variables (removed 400) and now considering 189/546 (removed 357) transitions.
// Phase 1: matrix 189 rows 196 cols
[2024-06-01 10:12:36] [INFO ] Computed 90 invariants in 3 ms
[2024-06-01 10:12:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 10:12:37] [INFO ] Invariant cache hit.
[2024-06-01 10:12:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:12:37] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-01 10:12:37] [INFO ] Redundant transitions in 5 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-01 10:12:37] [INFO ] Invariant cache hit.
[2024-06-01 10:12:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 2/196 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 10:12:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:12:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 291 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5311 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 185/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 476 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5898 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
After SMT, in 11242ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 11244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/596 places, 189/546 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11591 ms. Remains : 196/596 places, 189/546 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 442 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 479 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 3347 steps (1 resets) in 14 ms. (223 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 747 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 189/189 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-06-01 10:12:51] [INFO ] Invariant cache hit.
[2024-06-01 10:12:51] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 10:12:51] [INFO ] Invariant cache hit.
[2024-06-01 10:12:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:12:51] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-01 10:12:51] [INFO ] Redundant transitions in 6 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-01 10:12:51] [INFO ] Invariant cache hit.
[2024-06-01 10:12:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 2/196 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 10:12:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:12:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 291 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 185/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 476 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6226 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
After SMT, in 11642ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 11645ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11956 ms. Remains : 196/196 places, 189/189 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 519 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 13349 steps (4 resets) in 62 ms. (211 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 631 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 319 ms.
Product exploration explored 100000 steps with 0 reset in 495 ms.
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-06-01 10:13:05] [INFO ] Invariant cache hit.
[2024-06-01 10:13:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 10:13:05] [INFO ] Invariant cache hit.
[2024-06-01 10:13:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:13:05] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-01 10:13:05] [INFO ] Redundant transitions in 7 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-01 10:13:05] [INFO ] Invariant cache hit.
[2024-06-01 10:13:05] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 2/196 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 10:13:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:13:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 291 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 189/385 variables, 196/288 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 185/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 476 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6114 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 196/196 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints]
After SMT, in 11548ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 11552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11858 ms. Remains : 196/196 places, 189/189 transitions.
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-07 finished in 40559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))&&p0))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 593 transition count 543
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 593 transition count 543
Applied a total of 6 rules in 24 ms. Remains 593 /596 variables (removed 3) and now considering 543/546 (removed 3) transitions.
// Phase 1: matrix 543 rows 593 cols
[2024-06-01 10:13:17] [INFO ] Computed 91 invariants in 2 ms
[2024-06-01 10:13:17] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 10:13:17] [INFO ] Invariant cache hit.
[2024-06-01 10:13:18] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-06-01 10:13:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:13:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 3 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:13:28] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:13:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:13:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-01 10:13:31] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-01 10:13:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:13:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:13:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:13:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:13:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:13:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:13:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:13:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:13:41] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:13:41] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:13:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:13:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:13:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:13:43] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:13:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:13:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:13:44] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:13:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:13:45] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:13:46] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:13:46] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:13:46] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:13:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:13:46] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1136 variables, and 172 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:13:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:13:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:13:56] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:13:57] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 9/181 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:14:02] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:14:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (OVERLAPS) 543/1136 variables, 593/776 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1136 variables, 542/1318 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-06-01 10:14:11] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-06-01 10:14:12] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:14:12] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-06-01 10:14:13] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:14:13] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:14:14] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-06-01 10:14:15] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 4 ms to minimize.
[2024-06-01 10:14:15] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:14:16] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-06-01 10:14:16] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-06-01 10:14:18] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-06-01 10:14:18] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 4 ms to minimize.
[2024-06-01 10:14:18] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/1136 variables, and 1331 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 105/105 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 593/596 places, 543/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61034 ms. Remains : 593/596 places, 543/546 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-08
Product exploration explored 100000 steps with 15 reset in 262 ms.
Stack based approach found an accepted trace after 380 steps with 0 reset with depth 381 and stack size 381 in 1 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-08 finished in 61474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 592 transition count 542
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 592 transition count 542
Applied a total of 8 rules in 22 ms. Remains 592 /596 variables (removed 4) and now considering 542/546 (removed 4) transitions.
// Phase 1: matrix 542 rows 592 cols
[2024-06-01 10:14:18] [INFO ] Computed 91 invariants in 4 ms
[2024-06-01 10:14:19] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 10:14:19] [INFO ] Invariant cache hit.
[2024-06-01 10:14:19] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-06-01 10:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:14:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:14:29] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 3 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:14:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:31] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:14:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:14:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:14:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:33] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:14:41] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:14:42] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:44] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:14:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:14:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:14:46] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:14:47] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1134 variables, and 172 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:14:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:14:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:14:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:14:57] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:14:57] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:14:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:14:58] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1134 variables, 592/777 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 541/1318 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-01 10:15:08] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 4 ms to minimize.
[2024-06-01 10:15:09] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 4 ms to minimize.
[2024-06-01 10:15:09] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-06-01 10:15:10] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-06-01 10:15:10] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-06-01 10:15:11] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-06-01 10:15:11] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 3 ms to minimize.
[2024-06-01 10:15:12] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 3 ms to minimize.
[2024-06-01 10:15:12] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 4 ms to minimize.
[2024-06-01 10:15:13] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-01 10:15:13] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-06-01 10:15:14] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 4 ms to minimize.
[2024-06-01 10:15:14] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-06-01 10:15:14] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-06-01 10:15:16] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-06-01 10:15:17] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 4 ms to minimize.
[2024-06-01 10:15:17] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-06-01 10:15:18] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
[2024-06-01 10:15:18] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 4 ms to minimize.
[2024-06-01 10:15:19] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 20/1338 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 1338 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 114/114 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 592/596 places, 542/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60664 ms. Remains : 592/596 places, 542/546 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-010B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-14 finished in 61154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1)))||G(p0)))'
[2024-06-01 10:15:20] [INFO ] Flatten gal took : 28 ms
[2024-06-01 10:15:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 10:15:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 546 transitions and 1412 arcs took 9 ms.
Total runtime 354164 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldIIPt-PT-010B-LTLCardinality-07

BK_STOP 1717236954323

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPt-PT-010B-LTLCardinality-07
ltl formula formula --ltl=/tmp/2859/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 596 places, 546 transitions and 1412 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 597 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 597, there are 652 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2273 levels ~10000 states ~71076 transitions
pnml2lts-mc( 0/ 4): ~4335 levels ~20000 states ~145560 transitions
pnml2lts-mc( 2/ 4): ~9016 levels ~40000 states ~345624 transitions
pnml2lts-mc( 2/ 4): ~18028 levels ~80000 states ~723888 transitions
pnml2lts-mc( 2/ 4): ~36098 levels ~160000 states ~1555204 transitions
pnml2lts-mc( 2/ 4): ~72608 levels ~320000 states ~3135308 transitions
pnml2lts-mc( 2/ 4): ~144375 levels ~640000 states ~6415372 transitions
pnml2lts-mc( 2/ 4): ~289142 levels ~1280000 states ~13321664 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2138869
pnml2lts-mc( 0/ 4): unique transitions count: 20909972
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 7830890
pnml2lts-mc( 0/ 4): - claim success count: 2138881
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2026916
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2138884 states 20910010 transitions, fanout: 9.776
pnml2lts-mc( 0/ 4): Total exploration time 33.070 sec (33.040 sec minimum, 33.055 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64677, Transitions per second: 632295
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.0MB, 16.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 125.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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