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-171683761100427.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 ShieldPPPs-PT-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 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:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 86K 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 ShieldPPPs-PT-005B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-005B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717243088143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:58:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:58:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:58:09] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-01 11:58:09] [INFO ] Transformed 343 places.
[2024-06-01 11:58:09] [INFO ] Transformed 318 transitions.
[2024-06-01 11:58:09] [INFO ] Found NUPN structural information;
[2024-06-01 11:58:09] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 186 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 7 formulas.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 310 transition count 285
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 309 transition count 284
Applied a total of 68 rules in 73 ms. Remains 309 /343 variables (removed 34) and now considering 284/318 (removed 34) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-06-01 11:58:09] [INFO ] Computed 56 invariants in 22 ms
[2024-06-01 11:58:10] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 11:58:10] [INFO ] Invariant cache hit.
[2024-06-01 11:58:10] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-01 11:58:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 12 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:58:17] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:58:17] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:58:21] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:58:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:22] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 11/127 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:23] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:58:23] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:24] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:58:25] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:58:25] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:58:27] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:58:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:58:29] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:58:30] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:58:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 284/593 variables, 309/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:36] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:58:36] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:58:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:58:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:58:38] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 18/491 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 491 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 126/126 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 126/182 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:58:46] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:58:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 19/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 17/229 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:52] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:52] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:58:53] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:57] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:58:58] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:58:59] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:59] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:58:59] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:58:59] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 5/243 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:59:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 11:59:06] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 16 (OVERLAPS) 284/593 variables, 309/566 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 283/849 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 849 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 201/201 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 309/343 places, 284/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60772 ms. Remains : 309/343 places, 284/318 transitions.
Support contains 22 out of 309 places after structural reductions.
[2024-06-01 11:59:10] [INFO ] Flatten gal took : 44 ms
[2024-06-01 11:59:10] [INFO ] Flatten gal took : 19 ms
[2024-06-01 11:59:10] [INFO ] Input system was already deterministic with 284 transitions.
RANDOM walk for 2750 steps (1 resets) in 193 ms. (14 steps per ms) remains 0/10 properties
FORMULA ShieldPPPs-PT-005B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 60 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' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 309 transition count 249
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 274 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 273 transition count 248
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 72 place count 273 transition count 223
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 122 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 247 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 247 transition count 222
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 296 place count 161 transition count 136
Applied a total of 296 rules in 46 ms. Remains 161 /309 variables (removed 148) and now considering 136/284 (removed 148) transitions.
// Phase 1: matrix 136 rows 161 cols
[2024-06-01 11:59:10] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 11:59:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 11:59:11] [INFO ] Invariant cache hit.
[2024-06-01 11:59:11] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-01 11:59:11] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 11:59:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/297 variables, 161/224 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 231 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7569 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/297 variables, 161/231 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 135/366 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:21] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 11:59:23] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:59:23] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 369 constraints, problems are : Problem set: 0 solved, 135 unsolved in 13282 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 17/17 constraints]
After SMT, in 20875ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 20877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/309 places, 136/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21141 ms. Remains : 161/309 places, 136/284 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-01
Product exploration explored 100000 steps with 269 reset in 445 ms.
Product exploration explored 100000 steps with 267 reset in 336 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/161 stabilizing places and 6/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (106 resets) in 263 ms. (151 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
[2024-06-01 11:59:33] [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) 157/161 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/297 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/297 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 161/161 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
Problem apf0 is UNSAT
After SMT solving in domain Int declared 161/297 variables, and 56 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-01 finished in 22982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 307 transition count 282
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 307 transition count 282
Applied a total of 4 rules in 13 ms. Remains 307 /309 variables (removed 2) and now considering 282/284 (removed 2) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-06-01 11:59:33] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 11:59:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 11:59:33] [INFO ] Invariant cache hit.
[2024-06-01 11:59:34] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-01 11:59:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 3 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:39] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 4 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:47] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:48] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:51] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:59:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:59:53] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:57] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:59:57] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:59:57] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:59:57] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:59:58] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 11:59:59] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:59:59] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:00] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:00:01] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:01] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:00:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:00:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:00:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:00:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:00:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:00:09] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:11] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:11] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:00:11] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:00:11] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:16] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:00:17] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:00:17] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:00:20] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:00:21] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:00:31] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:00:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:00:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:00:34] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:00:34] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
SMT process timed out in 60127ms, After SMT, problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 307/309 places, 282/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60441 ms. Remains : 307/309 places, 282/284 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-03 finished in 60981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G(p2)&&p1))))'
Support contains 5 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 308 transition count 248
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 273 transition count 248
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 70 place count 273 transition count 223
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 120 place count 248 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 246 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 246 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 246 transition count 220
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 245 transition count 220
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 292 place count 162 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 160 transition count 135
Applied a total of 294 rules in 43 ms. Remains 160 /309 variables (removed 149) and now considering 135/284 (removed 149) transitions.
// Phase 1: matrix 135 rows 160 cols
[2024-06-01 12:00:34] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:00:34] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 12:00:34] [INFO ] Invariant cache hit.
[2024-06-01 12:00:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-01 12:00:35] [INFO ] Redundant transitions in 3 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 12:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:00:35] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 135/295 variables, 160/217 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:00:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:00:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:00:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/295 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/295 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 220 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6421 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 135/295 variables, 160/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 132/352 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 352 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5385 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints]
After SMT, in 11822ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/309 places, 135/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12089 ms. Remains : 160/309 places, 135/284 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-05
Stuttering criterion allowed to conclude after 400 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-05 finished in 12267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 307 transition count 282
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 307 transition count 282
Applied a total of 4 rules in 7 ms. Remains 307 /309 variables (removed 2) and now considering 282/284 (removed 2) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-06-01 12:00:47] [INFO ] Computed 56 invariants in 5 ms
[2024-06-01 12:00:47] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 12:00:47] [INFO ] Invariant cache hit.
[2024-06-01 12:00:47] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-01 12:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 5 ms to minimize.
[2024-06-01 12:00:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:00:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:00:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:00:53] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:00:55] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:00:55] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:58] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:00:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:00:58] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:00:58] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:00:59] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:00:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:01:01] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:09] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:01:09] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:01:09] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:01:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:01:10] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:01:10] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:12] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:01:12] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:01:13] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:01:13] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:01:15] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:01:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:01:15] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:01:15] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:01:20] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:01:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:01:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:01:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:01:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:01:21] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:01:21] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:01:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:01:22] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:01:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:01:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:01:23] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:01:23] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:01:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:01:31] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:01:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:01:31] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:44] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:01:44] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:01:44] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
[2024-06-01 12:01:47] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:01:47] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 790 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 146/146 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 307/309 places, 282/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 307/309 places, 282/284 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-08 finished in 60655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 308 transition count 246
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 271 transition count 246
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 271 transition count 221
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 245 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 245 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 126 place count 245 transition count 219
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 244 transition count 219
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 296 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 158 transition count 133
Applied a total of 298 rules in 31 ms. Remains 158 /309 variables (removed 151) and now considering 133/284 (removed 151) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-06-01 12:01:47] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:01:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:01:47] [INFO ] Invariant cache hit.
[2024-06-01 12:01:48] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-01 12:01:48] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 12:01:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:01:49] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:01:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:01:49] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:50] [INFO ] Deduced a trap composed of 57 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:01:51] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 228 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5560 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 130/358 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:01:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 359 constraints, problems are : Problem set: 0 solved, 130 unsolved in 11931 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
After SMT, in 17505ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 17506ms
Starting structural reductions in SI_LTL mode, iteration 1 : 158/309 places, 133/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17761 ms. Remains : 158/309 places, 133/284 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-10
Product exploration explored 100000 steps with 1068 reset in 289 ms.
Product exploration explored 100000 steps with 1152 reset in 364 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 12:02:06] [INFO ] Invariant cache hit.
[2024-06-01 12:02:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 12:02:06] [INFO ] Invariant cache hit.
[2024-06-01 12:02:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-01 12:02:07] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 12:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:08] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:02:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:02:08] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 71 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:02:09] [INFO ] Deduced a trap composed of 57 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:10] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 228 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5578 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 130/358 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 359 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12061 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
After SMT, in 17667ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 17669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17876 ms. Remains : 158/158 places, 133/133 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1233 reset in 232 ms.
Product exploration explored 100000 steps with 1113 reset in 264 ms.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-01 12:02:25] [INFO ] Invariant cache hit.
[2024-06-01 12:02:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 12:02:25] [INFO ] Invariant cache hit.
[2024-06-01 12:02:26] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-01 12:02:26] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 12:02:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:02:27] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:28] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:29] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 228 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5508 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 130/358 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 359 constraints, problems are : Problem set: 0 solved, 130 unsolved in 11912 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
After SMT, in 17441ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 17443ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17666 ms. Remains : 158/158 places, 133/133 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-10 finished in 55801 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(G(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 283
Applied a total of 2 rules in 5 ms. Remains 308 /309 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-06-01 12:02:43] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:02:43] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 12:02:43] [INFO ] Invariant cache hit.
[2024-06-01 12:02:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-01 12:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:02:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:02:47] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:02:48] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:02:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:51] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:02:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:02:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:56] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:56] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:02:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:02:59] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:01] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:03] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:06] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:03:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 13 (OVERLAPS) 283/591 variables, 308/434 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:12] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
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 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.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 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.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 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.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 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 77/133 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:03:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:03:16] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:03:16] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:03:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:03:17] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:03:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:03:18] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:03:25] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:03:25] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (OVERLAPS) 283/591 variables, 308/463 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 282/745 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:31] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:03:31] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:03:31] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:03:33] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:03:33] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:03:33] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:03:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:03:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:03:34] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:03:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:03:43] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 767 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 121/121 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 308/309 places, 283/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60368 ms. Remains : 308/309 places, 283/284 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 383 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-12 finished in 60481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 12:03:44] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:03:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 23 ms.
[2024-06-01 12:03:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 284 transitions and 808 arcs took 5 ms.
Total runtime 334975 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-005B-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243589576

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-005B-LTLCardinality-10
ltl formula formula --ltl=/tmp/2926/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 309 places, 284 transitions and 808 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2926/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2926/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2926/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2926/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 311 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 297 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): ~595 levels ~10000 states ~30244 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~20000 states ~55976 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~40000 states ~114908 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~80000 states ~225176 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~160000 states ~460360 transitions
pnml2lts-mc( 3/ 4): ~577 levels ~320000 states ~1029404 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~640000 states ~2023568 transitions
pnml2lts-mc( 3/ 4): ~582 levels ~1280000 states ~4399480 transitions
pnml2lts-mc( 0/ 4): ~595 levels ~2560000 states ~9372212 transitions
pnml2lts-mc( 3/ 4): ~582 levels ~5120000 states ~19750200 transitions
pnml2lts-mc( 3/ 4): ~582 levels ~10240000 states ~42406164 transitions
pnml2lts-mc( 3/ 4): ~582 levels ~20480000 states ~87637508 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33537631
pnml2lts-mc( 0/ 4): unique states count: 33540360
pnml2lts-mc( 0/ 4): unique transitions count: 171862159
pnml2lts-mc( 0/ 4): - self-loop count: 149
pnml2lts-mc( 0/ 4): - claim dead count: 138307481
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33540369
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2883
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33540369 states 171862178 transitions, fanout: 5.124
pnml2lts-mc( 0/ 4): Total exploration time 164.560 sec (164.550 sec minimum, 164.555 sec on average)
pnml2lts-mc( 0/ 4): States per second: 203818, Transitions per second: 1044374
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.9MB, 9.6 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/77.0%
pnml2lts-mc( 0/ 4): Stored 287 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.9MB (~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="ShieldPPPs-PT-005B"
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 ShieldPPPs-PT-005B, 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-171683761100427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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