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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 74K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717255718215

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:28:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:28:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:28:39] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 15:28:39] [INFO ] Transformed 315 places.
[2024-06-01 15:28:39] [INFO ] Transformed 287 transitions.
[2024-06-01 15:28:39] [INFO ] Found NUPN structural information;
[2024-06-01 15:28:39] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-004B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 280 transition count 252
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 280 transition count 252
Applied a total of 70 rules in 55 ms. Remains 280 /315 variables (removed 35) and now considering 252/287 (removed 35) transitions.
// Phase 1: matrix 252 rows 280 cols
[2024-06-01 15:28:39] [INFO ] Computed 45 invariants in 24 ms
[2024-06-01 15:28:40] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 15:28:40] [INFO ] Invariant cache hit.
[2024-06-01 15:28:40] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 15:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 13 ms to minimize.
[2024-06-01 15:28:42] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:28:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:28:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:28:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:28:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:28:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:28:45] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 252/532 variables, 280/358 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:28:53] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:28:53] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:54] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (OVERLAPS) 0/532 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 363 constraints, problems are : Problem set: 0 solved, 251 unsolved in 24738 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 38/83 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/532 variables, 280/363 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 251/614 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:29:09] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:29:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:29:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:29:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 12/626 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:29:20] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 6 ms to minimize.
[2024-06-01 15:29:21] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:29:25] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:29:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 15:29:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/637 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:29:32] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 638 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 62/62 constraints]
After SMT, in 54823ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 54842ms
Starting structural reductions in LTL mode, iteration 1 : 280/315 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55415 ms. Remains : 280/315 places, 252/287 transitions.
Support contains 42 out of 280 places after structural reductions.
[2024-06-01 15:29:35] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:29:35] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:29:35] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 40 out of 280 places (down from 42) after GAL structural reductions.
RANDOM walk for 10294 steps (0 resets) in 452 ms. (22 steps per ms) remains 0/34 properties
FORMULA ShieldPPPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 67 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 20 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 15:29:36] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:29:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 15:29:36] [INFO ] Invariant cache hit.
[2024-06-01 15:29:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:29:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:29:44] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17408 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 4 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:30:00] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:30:04] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:06] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:30:07] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:12] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:30:12] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47452ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47456ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47764 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 324 ms.
Product exploration explored 100000 steps with 1 reset in 393 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 148 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 392 ms. (101 steps per ms) remains 1/4 properties
BEST_FIRST walk for 35937 steps (7 resets) in 150 ms. (237 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 275 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
[2024-06-01 15:30:26] [INFO ] Invariant cache hit.
[2024-06-01 15:30:26] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-06-01 15:30:26] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-01 15:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:30:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-06-01 15:30:26] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2024-06-01 15:30:27] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 15:30:28] [INFO ] Added : 230 causal constraints over 47 iterations in 1180 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 15:30:28] [INFO ] Invariant cache hit.
[2024-06-01 15:30:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 15:30:28] [INFO ] Invariant cache hit.
[2024-06-01 15:30:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 16986 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:30:49] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:30:50] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:30:50] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:30:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:30:50] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:30:51] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:30:51] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:30:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:30:51] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:30:52] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:56] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:30:56] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:30:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:30:59] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47022ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47024ms
Finished structural reductions in LTL mode , in 1 iterations and 47316 ms. Remains : 269/269 places, 241/241 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/4 properties
BEST_FIRST walk for 32131 steps (7 resets) in 79 ms. (401 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
[2024-06-01 15:31:16] [INFO ] Invariant cache hit.
[2024-06-01 15:31:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-06-01 15:31:16] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-06-01 15:31:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:31:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-06-01 15:31:17] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-06-01 15:31:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:31:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:31:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:31:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2024-06-01 15:31:17] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 15:31:18] [INFO ] Added : 230 causal constraints over 47 iterations in 1167 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 1 reset in 250 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 269 transition count 241
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 56 place count 269 transition count 257
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 76 place count 269 transition count 257
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 269 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 269 transition count 256
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 180 place count 239 transition count 226
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 210 place count 239 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 239 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 237 transition count 224
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 237 transition count 224
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 230 place count 237 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 245 place count 222 transition count 257
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 260 place count 222 transition count 257
Deduced a syphon composed of 118 places in 1 ms
Applied a total of 260 rules in 90 ms. Remains 222 /269 variables (removed 47) and now considering 257/241 (removed -16) transitions.
[2024-06-01 15:31:19] [INFO ] Redundant transitions in 10 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 257 rows 222 cols
[2024-06-01 15:31:19] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 15:31:19] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 15:31:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/65 constraints. Problems are: Problem set: 118 solved, 138 unsolved
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 16/81 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/81 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 257/479 variables, 222/303 constraints. Problems are: Problem set: 171 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 28/331 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/331 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/331 constraints. Problems are: Problem set: 171 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 331 constraints, problems are : Problem set: 171 solved, 85 unsolved in 5392 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 222/222 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 171 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 119/222 variables, 45/45 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 36/81 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/81 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 257/479 variables, 222/303 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 28/331 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 85/416 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/416 constraints. Problems are: Problem set: 171 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/416 constraints. Problems are: Problem set: 171 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 416 constraints, problems are : Problem set: 171 solved, 85 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 222/222 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/256 constraints, Known Traps: 36/36 constraints]
After SMT, in 10592ms problems are : Problem set: 171 solved, 85 unsolved
Search for dead transitions found 171 dead transitions in 10600ms
Found 171 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 171 transitions
Dead transitions reduction (with SMT) removed 171 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 222/269 places, 86/241 transitions.
Graph (complete) has 290 edges and 222 vertex of which 104 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.5 ms
Discarding 118 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 104 /222 variables (removed 118) and now considering 86/86 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/269 places, 86/241 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10733 ms. Remains : 104/269 places, 86/241 transitions.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 15:31:30] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:31:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 15:31:30] [INFO ] Invariant cache hit.
[2024-06-01 15:31:30] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:31:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:31:38] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17374 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:51] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:31:51] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:31:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:31:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:31:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:31:54] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:31:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:32:03] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47413ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47416ms
Finished structural reductions in LTL mode , in 1 iterations and 47696 ms. Remains : 269/269 places, 241/241 transitions.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 162006 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(X(p0))) U G(p1)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 10 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-06-01 15:32:18] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:32:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 15:32:18] [INFO ] Invariant cache hit.
[2024-06-01 15:32:18] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:32:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:32:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/512 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:32:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/512 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 14 (OVERLAPS) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 351 constraints, problems are : Problem set: 0 solved, 241 unsolved in 25803 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/592 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:32:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:32:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:32:48] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:32:48] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:32:51] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:32:51] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 14/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:32:59] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/512 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 51/51 constraints]
After SMT, in 55839ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 55841ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56101 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-01 finished in 56455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 279 transition count 193
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 118 place count 221 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 220 transition count 191
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 119 place count 220 transition count 163
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 175 place count 192 transition count 163
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 183 place count 184 transition count 155
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 184 transition count 155
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 191 place count 184 transition count 150
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 201 place count 179 transition count 150
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
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 345 place count 107 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 347 place count 105 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 104 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 348 place count 104 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 102 transition count 85
Applied a total of 352 rules in 40 ms. Remains 102 /280 variables (removed 178) and now considering 85/252 (removed 167) transitions.
// Phase 1: matrix 85 rows 102 cols
[2024-06-01 15:33:14] [INFO ] Computed 44 invariants in 1 ms
[2024-06-01 15:33:14] [INFO ] Implicit Places using invariants in 71 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/280 places, 85/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 83
Applied a total of 4 rules in 10 ms. Remains 98 /100 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 98 cols
[2024-06-01 15:33:14] [INFO ] Computed 42 invariants in 12 ms
[2024-06-01 15:33:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 15:33:14] [INFO ] Invariant cache hit.
[2024-06-01 15:33:14] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/280 places, 83/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 98/280 places, 83/252 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-02
Product exploration explored 100000 steps with 516 reset in 201 ms.
Stack based approach found an accepted trace after 96 steps with 1 reset with depth 41 and stack size 35 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 593 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))&&(F(p1) U X((X((p3 U p4))||p2)))))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 14 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-06-01 15:33:15] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:33:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 15:33:15] [INFO ] Invariant cache hit.
[2024-06-01 15:33:15] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 15:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/514 variables, 271/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/514 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/514 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/514 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 352 constraints, problems are : Problem set: 0 solved, 242 unsolved in 29731 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/514 variables, 271/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 242/594 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 20/614 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:33:55] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:33:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/514 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 616 constraints, problems are : Problem set: 0 solved, 242 unsolved in 23886 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 58/58 constraints]
After SMT, in 53638ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 53640ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53905 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 54324 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(((p0&&X(X(G(p1)))) U G(p2)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 12 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-06-01 15:34:09] [INFO ] Computed 45 invariants in 6 ms
[2024-06-01 15:34:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 15:34:09] [INFO ] Invariant cache hit.
[2024-06-01 15:34:09] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 15:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:16] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/514 variables, 271/345 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:27] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:28] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:34:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 354 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25470 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 38/83 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/514 variables, 271/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 242/596 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 11/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:34:44] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/514 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 612 constraints, problems are : Problem set: 0 solved, 242 unsolved in 24388 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 54/54 constraints]
After SMT, in 49891ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 49895ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50185 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 279 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-04 finished in 50558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 220 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 219 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 217 transition count 188
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 125 place count 217 transition count 162
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 177 place count 191 transition count 162
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 184 place count 184 transition count 155
Iterating global reduction 4 with 7 rules applied. Total rules applied 191 place count 184 transition count 155
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 191 place count 184 transition count 150
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 201 place count 179 transition count 150
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
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 347 place count 106 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 104 transition count 86
Applied a total of 349 rules in 49 ms. Remains 104 /280 variables (removed 176) and now considering 86/252 (removed 166) transitions.
// Phase 1: matrix 86 rows 104 cols
[2024-06-01 15:35:00] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:35:00] [INFO ] Implicit Places using invariants in 114 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/280 places, 86/252 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 103 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 84
Applied a total of 4 rules in 3 ms. Remains 101 /103 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 101 cols
[2024-06-01 15:35:00] [INFO ] Computed 44 invariants in 0 ms
[2024-06-01 15:35:00] [INFO ] Implicit Places using invariants in 91 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/280 places, 84/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 82
Applied a total of 4 rules in 3 ms. Remains 97 /99 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 97 cols
[2024-06-01 15:35:00] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 15:35:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 15:35:00] [INFO ] Invariant cache hit.
[2024-06-01 15:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 15:35:00] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 97/280 places, 82/252 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 452 ms. Remains : 97/280 places, 82/252 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 197 ms.
Stack based approach found an accepted trace after 43 steps with 2 reset with depth 40 and stack size 39 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-05 finished in 755 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)&&X(G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 9 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 15:35:00] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 15:35:00] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 15:35:00] [INFO ] Invariant cache hit.
[2024-06-01 15:35:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:35:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:35:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:35:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17701 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:35:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:35:23] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:35:24] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:35:25] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:35:25] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:35:25] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:35:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:29] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:35:30] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:35:33] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:35:35] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47744ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47746ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48011 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-06 finished in 48170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 11 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-06-01 15:35:48] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:35:49] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 15:35:49] [INFO ] Invariant cache hit.
[2024-06-01 15:35:49] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:35:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:35:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:35:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:35:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:35:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:35:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:35:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (OVERLAPS) 0/512 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 348 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20385 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/78 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/589 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:13] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:36:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:36:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 15/604 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:29] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/512 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:36:38] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 608 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 52/52 constraints]
After SMT, in 50422ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 50424ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50702 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-08 finished in 50876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 7 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-06-01 15:36:39] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:36:39] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 15:36:39] [INFO ] Invariant cache hit.
[2024-06-01 15:36:40] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:36:51] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:36:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17347 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:01] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:37:01] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:37:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:37:01] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:37:01] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:37:02] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:37:02] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:37:02] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:37:02] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:07] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:37:08] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:37:11] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:37:12] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:16] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:37:16] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47405ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47408ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47671 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-09
Product exploration explored 100000 steps with 457 reset in 207 ms.
Stack based approach found an accepted trace after 334 steps with 1 reset with depth 141 and stack size 141 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-09 finished in 48030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 11 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
[2024-06-01 15:37:27] [INFO ] Invariant cache hit.
[2024-06-01 15:37:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 15:37:27] [INFO ] Invariant cache hit.
[2024-06-01 15:37:28] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 15:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:37:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:37:31] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:37:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17175 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:37:56] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:37:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:38:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 15:38:04] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:38:04] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47213ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47215ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47492 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 29 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-004B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLFireability-10 finished in 47962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)||X(p1))) U p2)||G(!p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 12 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-06-01 15:38:15] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:38:16] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 15:38:16] [INFO ] Invariant cache hit.
[2024-06-01 15:38:16] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/342 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:38:28] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:38:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/512 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/512 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 355 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/355 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/596 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 6/602 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:38:55] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:38:57] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:01] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 605 constraints, problems are : Problem set: 0 solved, 241 unsolved in 28796 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 49/49 constraints]
After SMT, in 58852ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 58854ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59522 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), false, false, false, (AND (NOT p1) (NOT p0)), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 81 steps with 20 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-11 finished in 59957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (p1&&G((!p2||X(X(G(p1)))))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 11 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-06-01 15:39:15] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 15:39:15] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 15:39:15] [INFO ] Invariant cache hit.
[2024-06-01 15:39:16] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:39:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/341 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:35] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 349 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24942 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/590 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 13/603 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:50] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:39:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:39:51] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:39:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:05] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/512 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 608 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 52/52 constraints]
After SMT, in 54978ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 54981ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55323 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 401 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 242 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 144 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/6 properties
BEST_FIRST walk for 10579 steps (1 resets) in 14 ms. (705 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 367 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 270 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 15:40:13] [INFO ] Invariant cache hit.
[2024-06-01 15:40:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 15:40:13] [INFO ] Invariant cache hit.
[2024-06-01 15:40:13] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/341 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 349 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24234 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/590 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:40:42] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:40:42] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:40:43] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:40:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:40:43] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:40:43] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:40:44] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:40:44] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:40:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 13/603 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:40:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/512 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 608 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 52/52 constraints]
After SMT, in 54263ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 54265ms
Finished structural reductions in LTL mode , in 1 iterations and 54536 ms. Remains : 270/270 places, 242/242 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 156 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/6 properties
BEST_FIRST walk for 13036 steps (1 resets) in 13 ms. (931 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 270 transition count 242
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 55 place count 270 transition count 257
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 74 place count 270 transition count 257
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 151 place count 270 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 270 transition count 257
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 182 place count 240 transition count 226
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 212 place count 240 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 240 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 238 transition count 224
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 238 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 231 place count 238 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 245 place count 224 transition count 255
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 259 place count 224 transition count 255
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 259 rules in 37 ms. Remains 224 /270 variables (removed 46) and now considering 255/242 (removed -13) transitions.
[2024-06-01 15:41:10] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
// Phase 1: matrix 255 rows 224 cols
[2024-06-01 15:41:10] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 15:41:10] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 15:41:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/65 constraints. Problems are: Problem set: 112 solved, 142 unsolved
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 16/81 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/81 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 255/479 variables, 224/305 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 27/332 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/332 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/332 constraints. Problems are: Problem set: 169 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 332 constraints, problems are : Problem set: 169 solved, 85 unsolved in 5384 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 224/224 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 169 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 121/224 variables, 45/45 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 36/81 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/81 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 255/479 variables, 224/305 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 27/332 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 85/417 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/417 constraints. Problems are: Problem set: 169 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/417 constraints. Problems are: Problem set: 169 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 417 constraints, problems are : Problem set: 169 solved, 85 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 224/224 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 85/254 constraints, Known Traps: 36/36 constraints]
After SMT, in 10290ms problems are : Problem set: 169 solved, 85 unsolved
Search for dead transitions found 169 dead transitions in 10294ms
Found 169 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 169 transitions
Dead transitions reduction (with SMT) removed 169 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 224/270 places, 86/242 transitions.
Graph (complete) has 290 edges and 224 vertex of which 104 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.3 ms
Discarding 120 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 104 /224 variables (removed 120) and now considering 86/86 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/270 places, 86/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10355 ms. Remains : 104/270 places, 86/242 transitions.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-06-01 15:41:20] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 15:41:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 15:41:20] [INFO ] Invariant cache hit.
[2024-06-01 15:41:21] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 15:41:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/341 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:32] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 349 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24384 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/590 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:48] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:41:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:41:49] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:41:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:41:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:41:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:41:50] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:41:51] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:41:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:41:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:41:51] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:41:51] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:41:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 13/603 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:42:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/512 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 608 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 52/52 constraints]
After SMT, in 54423ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 54429ms
Finished structural reductions in LTL mode , in 1 iterations and 54693 ms. Remains : 270/270 places, 242/242 transitions.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 179799 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&&(p1 U G(p2))))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 220 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 219 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 218 transition count 189
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 123 place count 218 transition count 163
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 175 place count 192 transition count 163
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 180 place count 187 transition count 158
Iterating global reduction 4 with 5 rules applied. Total rules applied 185 place count 187 transition count 158
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 185 place count 187 transition count 154
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 193 place count 183 transition count 154
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
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 345 place count 107 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 105 transition count 87
Applied a total of 347 rules in 21 ms. Remains 105 /280 variables (removed 175) and now considering 87/252 (removed 165) transitions.
// Phase 1: matrix 87 rows 105 cols
[2024-06-01 15:42:15] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 15:42:15] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 15:42:15] [INFO ] Invariant cache hit.
[2024-06-01 15:42:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 15:42:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 15:42:15] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-01 15:42:15] [INFO ] Invariant cache hit.
[2024-06-01 15:42:15] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 87/192 variables, 105/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 167 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 105/105 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 87/192 variables, 105/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 81/248 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 248 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2148 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 105/105 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
After SMT, in 3900ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3901ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/280 places, 87/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4335 ms. Remains : 105/280 places, 87/252 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 414 steps with 0 reset with depth 415 and stack size 415 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 4772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(!p1)&&F((p2&&X((p2 U (!p3||G(p2)))))))||X(G(!p1)))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 13 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-06-01 15:42:20] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 15:42:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 15:42:20] [INFO ] Invariant cache hit.
[2024-06-01 15:42:20] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-01 15:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 4 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 243/514 variables, 271/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:33] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:42:33] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:42:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/514 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/514 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:46] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/514 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 353 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 243/514 variables, 271/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 242/596 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:42:58] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 9/605 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:43:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:43:01] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:43:02] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:43:02] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:43:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:43:07] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:43:08] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 4/614 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:43:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/514 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 616 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 58/58 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60309 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2)), (AND (NOT p2) p1 p3), true, (NOT p2), (AND (NOT p2) p3)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/271 stabilizing places and 64/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 18 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-004B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLFireability-15 finished in 60922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-004B-LTLFireability-00
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 279 transition count 190
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 124 place count 218 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 217 transition count 188
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 125 place count 217 transition count 161
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 179 place count 190 transition count 161
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 186 place count 183 transition count 154
Iterating global reduction 3 with 7 rules applied. Total rules applied 193 place count 183 transition count 154
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 193 place count 183 transition count 149
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 178 transition count 149
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
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 349 place count 105 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 352 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 100 transition count 83
Applied a total of 356 rules in 25 ms. Remains 100 /280 variables (removed 180) and now considering 83/252 (removed 169) transitions.
// Phase 1: matrix 83 rows 100 cols
[2024-06-01 15:43:21] [INFO ] Computed 44 invariants in 1 ms
[2024-06-01 15:43:21] [INFO ] Implicit Places using invariants in 68 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/280 places, 83/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 81
Applied a total of 4 rules in 2 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-06-01 15:43:21] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 15:43:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 15:43:21] [INFO ] Invariant cache hit.
[2024-06-01 15:43:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 96/280 places, 81/252 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 235 ms. Remains : 96/280 places, 81/252 transitions.
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 1 reset in 280 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 276 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/4 properties
BEST_FIRST walk for 30330 steps (7 resets) in 28 ms. (1045 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 466 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 15:43:23] [INFO ] Invariant cache hit.
[2024-06-01 15:43:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 15:43:23] [INFO ] Invariant cache hit.
[2024-06-01 15:43:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-01 15:43:23] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 15:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 138 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 80/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 218 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2767 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/4 properties
BEST_FIRST walk for 13824 steps (3 resets) in 16 ms. (813 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 397 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 15:43:27] [INFO ] Invariant cache hit.
[2024-06-01 15:43:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 15:43:27] [INFO ] Invariant cache hit.
[2024-06-01 15:43:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-01 15:43:27] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 15:43:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 138 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/177 variables, 96/138 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 80/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 218 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2563ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2565ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2722 ms. Remains : 96/96 places, 81/81 transitions.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 9116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (p1&&G((!p2||X(X(G(p1)))))))))'
[2024-06-01 15:43:30] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:43:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 15:43:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 252 transitions and 648 arcs took 2 ms.
Total runtime 891199 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPt-PT-004B-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-004B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256733333

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPt-PT-004B-LTLFireability-00
ltl formula formula --ltl=/tmp/4702/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 252 transitions and 648 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4702/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4702/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4702/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4702/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 281 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 293 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~79 levels ~10000 states ~26184 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~20000 states ~55296 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~40000 states ~116768 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~80000 states ~246596 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~160000 states ~523288 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~320000 states ~1085636 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~640000 states ~2268096 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~1280000 states ~4790524 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~2560000 states ~10190432 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~5120000 states ~21567560 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~10240000 states ~44515832 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4950445
pnml2lts-mc( 0/ 4): unique states count: 12342913
pnml2lts-mc( 0/ 4): unique transitions count: 74975139
pnml2lts-mc( 0/ 4): - self-loop count: 10
pnml2lts-mc( 0/ 4): - claim dead count: 20994028
pnml2lts-mc( 0/ 4): - claim found count: 18677436
pnml2lts-mc( 0/ 4): - claim success count: 12342919
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5611398
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12342919 states 74975161 transitions, fanout: 6.074
pnml2lts-mc( 0/ 4): Total exploration time 64.930 sec (64.910 sec minimum, 64.918 sec on average)
pnml2lts-mc( 0/ 4): States per second: 190096, Transitions per second: 1154708
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 273.9MB, 8.6 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/27.0%
pnml2lts-mc( 0/ 4): Stored 255 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 273.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-004B-LTLFireability-13
ltl formula formula --ltl=/tmp/4702/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 252 transitions and 648 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4702/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4702/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4702/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4702/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 407 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2472 levels ~10000 states ~42636 transitions
pnml2lts-mc( 3/ 4): ~4912 levels ~20000 states ~88152 transitions
pnml2lts-mc( 3/ 4): ~9842 levels ~40000 states ~182920 transitions
pnml2lts-mc( 3/ 4): ~19641 levels ~80000 states ~379836 transitions
pnml2lts-mc( 3/ 4): ~39315 levels ~160000 states ~800988 transitions
pnml2lts-mc( 3/ 4): ~78565 levels ~320000 states ~1620088 transitions
pnml2lts-mc( 3/ 4): ~156986 levels ~640000 states ~3322108 transitions
pnml2lts-mc( 1/ 4): ~313781 levels ~1280000 states ~6862124 transitions
pnml2lts-mc( 1/ 4): ~435217 levels ~2560000 states ~13454580 transitions
pnml2lts-mc( 1/ 4): ~436039 levels ~5120000 states ~29183196 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 639655
pnml2lts-mc( 0/ 4): unique states count: 9621094
pnml2lts-mc( 0/ 4): unique transitions count: 61577542
pnml2lts-mc( 0/ 4): - self-loop count: 72
pnml2lts-mc( 0/ 4): - claim dead count: 4597574
pnml2lts-mc( 0/ 4): - claim found count: 20626905
pnml2lts-mc( 0/ 4): - claim success count: 9621110
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7461375
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9621114 states 61577626 transitions, fanout: 6.400
pnml2lts-mc( 0/ 4): Total exploration time 56.590 sec (56.540 sec minimum, 56.560 sec on average)
pnml2lts-mc( 0/ 4): States per second: 170014, Transitions per second: 1088136
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 278.7MB, 8.7 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/35.0%
pnml2lts-mc( 0/ 4): Stored 255 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 278.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;