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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 20:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-004B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717235876080

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:57:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:57:57] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 09:57:57] [INFO ] Transformed 283 places.
[2024-06-01 09:57:57] [INFO ] Transformed 263 transitions.
[2024-06-01 09:57:57] [INFO ] Found NUPN structural information;
[2024-06-01 09:57:57] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-004B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 244 transition count 224
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 244 transition count 224
Applied a total of 78 rules in 65 ms. Remains 244 /283 variables (removed 39) and now considering 224/263 (removed 39) transitions.
// Phase 1: matrix 224 rows 244 cols
[2024-06-01 09:57:57] [INFO ] Computed 37 invariants in 25 ms
[2024-06-01 09:57:58] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-06-01 09:57:58] [INFO ] Invariant cache hit.
[2024-06-01 09:57:58] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-01 09:57:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 12 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:58:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 10 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:58:01] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 3 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:58:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:58:04] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:58:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:05] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:58:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:58:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:06] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/468 variables, 244/330 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:58:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-06-01 09:58:09] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:58:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:58:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/468 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 337 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22750 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/468 variables, 244/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 223/560 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 3 ms to minimize.
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 09:58:24] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 09:58:25] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:58:25] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:58:26] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
[2024-06-01 09:58:26] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:58:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 10/570 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 09:58:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:58:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:58:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:36] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 09:58:37] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:58:37] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 09:58:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/468 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 09:58:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 09:58:41] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-01 09:58:41] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 581 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 77/77 constraints]
After SMT, in 52823ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 52840ms
Starting structural reductions in LTL mode, iteration 1 : 244/283 places, 224/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53549 ms. Remains : 244/283 places, 224/263 transitions.
Support contains 28 out of 244 places after structural reductions.
[2024-06-01 09:58:51] [INFO ] Flatten gal took : 57 ms
[2024-06-01 09:58:51] [INFO ] Flatten gal took : 17 ms
[2024-06-01 09:58:51] [INFO ] Input system was already deterministic with 224 transitions.
RANDOM walk for 40000 steps (8 resets) in 842 ms. (47 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2024-06-01 09:58:51] [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) 135/139 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/244 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/468 variables, 244/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 244/244 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 AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 139/468 variables, and 21 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 21/37 constraints, State Equation: 0/244 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 65 stabilizing places and 65 stable transitions
FORMULA ShieldIIPt-PT-004B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 244 transition count 178
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 198 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 196 transition count 175
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 97 place count 196 transition count 143
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 161 place count 164 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 161 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 161 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 167 place count 161 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 159 transition count 138
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 307 place count 91 transition count 70
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 329 place count 80 transition count 77
Applied a total of 329 rules in 43 ms. Remains 80 /244 variables (removed 164) and now considering 77/224 (removed 147) transitions.
// Phase 1: matrix 77 rows 80 cols
[2024-06-01 09:58:52] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 09:58:52] [INFO ] Implicit Places using invariants in 68 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/244 places, 77/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 79/244 places, 77/224 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/79 stabilizing places and 4/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-00 finished in 701 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) U X(p1))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 239 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 237 transition count 217
Applied a total of 14 rules in 20 ms. Remains 237 /244 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-06-01 09:58:52] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 09:58:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 09:58:52] [INFO ] Invariant cache hit.
[2024-06-01 09:58:52] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-01 09:58:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:58:54] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:58:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:58:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:58:58] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:01] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:59:01] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 307 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14333 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:08] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:59:08] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:59:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:10] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:59:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:59:12] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 09:59:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:59:12] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:59:12] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:59:12] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:59:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-06-01 09:59:13] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:59:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:59:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:59:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 18/544 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:16] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:59:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:59:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 09:59:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:59:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 09:59:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:59:23] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 552 constraints, problems are : Problem set: 0 solved, 216 unsolved in 29059 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 62/62 constraints]
After SMT, in 43416ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 43420ms
Starting structural reductions in LTL mode, iteration 1 : 237/244 places, 217/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43671 ms. Remains : 237/244 places, 217/224 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-01 finished in 44157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0 U p1))||(X(p2) U p2)))))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 241 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 240 transition count 220
Applied a total of 8 rules in 11 ms. Remains 240 /244 variables (removed 4) and now considering 220/224 (removed 4) transitions.
// Phase 1: matrix 220 rows 240 cols
[2024-06-01 09:59:36] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 09:59:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 09:59:36] [INFO ] Invariant cache hit.
[2024-06-01 09:59:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-01 09:59:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:59:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:59:39] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:59:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:59:41] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:42] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 220/460 variables, 240/310 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:59:46] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:47] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:59:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:59:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:59:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:59:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:59:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:59:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:52] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 322 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21086 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 45/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 09:59:59] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:59:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:00:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/460 variables, 240/326 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 219/545 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:03] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:00:03] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:00:03] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:00:03] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:00:04] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:00:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:00:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:00:04] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:00:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 9/554 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:00:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:00:07] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:15] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:00:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/460 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:18] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:00:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 10:00:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 562 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 66/66 constraints]
After SMT, in 51117ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 51119ms
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 220/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51325 ms. Remains : 240/244 places, 220/224 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 15 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-02 finished in 51692 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))&&F(p1)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 243 transition count 179
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 199 transition count 176
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 197 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 196 transition count 175
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 95 place count 196 transition count 143
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 159 place count 164 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 162 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 162 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 163 place count 162 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 161 transition count 140
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 299 place count 94 transition count 73
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 321 place count 83 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 82 transition count 78
Applied a total of 322 rules in 35 ms. Remains 82 /244 variables (removed 162) and now considering 78/224 (removed 146) transitions.
// Phase 1: matrix 78 rows 82 cols
[2024-06-01 10:00:28] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 10:00:28] [INFO ] Implicit Places using invariants in 49 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/244 places, 78/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 81/244 places, 78/224 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-09
Stuttering criterion allowed to conclude after 18599 steps with 22 reset in 40 ms.
FORMULA ShieldIIPt-PT-004B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-09 finished in 271 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&&(G(!p1)||(!p1&&F(!p2)))))))'
Support contains 3 out of 244 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 239 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 237 transition count 217
Applied a total of 14 rules in 20 ms. Remains 237 /244 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-06-01 10:00:28] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 10:00:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 10:00:28] [INFO ] Invariant cache hit.
[2024-06-01 10:00:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-01 10:00:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:00:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:00:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:00:37] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 307 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14240 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:00:46] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:00:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:00:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:00:49] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 18/544 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:00:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:55] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:00:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-01 10:00:58] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:00:59] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:00:59] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-06-01 10:00:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 552 constraints, problems are : Problem set: 0 solved, 216 unsolved in 29037 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 62/62 constraints]
After SMT, in 43310ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 43313ms
Starting structural reductions in LTL mode, iteration 1 : 237/244 places, 217/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43553 ms. Remains : 237/244 places, 217/224 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-12 finished in 43650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))&&p0)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 224/224 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 240 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 239 transition count 219
Applied a total of 10 rules in 11 ms. Remains 239 /244 variables (removed 5) and now considering 219/224 (removed 5) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-06-01 10:01:12] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 10:01:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
[2024-06-01 10:01:12] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:01:14] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:01:15] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:01:16] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:01:18] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:01:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/458 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:23] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:01:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/458 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 313 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15267 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:30] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/315 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 218/533 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:32] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:01:32] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:01:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:01:32] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:01:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:01:33] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:01:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:01:33] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:01:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:01:34] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:01:34] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:01:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:01:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 13/546 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:36] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:01:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:01:38] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:01:38] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:01:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:44] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:01:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:01:45] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 10:01:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:01:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:01:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 558 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 64/64 constraints]
After SMT, in 45297ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 45299ms
Starting structural reductions in LTL mode, iteration 1 : 239/244 places, 219/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45518 ms. Remains : 239/244 places, 219/224 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLCardinality-13 finished in 45660 ms.
All properties solved by simple procedures.
Total runtime 240922 ms.
ITS solved all properties within timeout

BK_STOP 1717236118212

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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