About the Execution of ITS-Tools for ShieldPPPt-PT-004B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16201.676 | 3600000.00 | 4897591.00 | 8083.70 | ?FFFFFFFFFTFT?FT | normal |
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.r356-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 itstools
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 r356-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 1717005325198
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 17:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:55:26] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-29 17:55:26] [INFO ] Transformed 315 places.
[2024-05-29 17:55:26] [INFO ] Transformed 287 transitions.
[2024-05-29 17:55:26] [INFO ] Found NUPN structural information;
[2024-05-29 17:55:26] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 172 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 53 ms. Remains 280 /315 variables (removed 35) and now considering 252/287 (removed 35) transitions.
// Phase 1: matrix 252 rows 280 cols
[2024-05-29 17:55:26] [INFO ] Computed 45 invariants in 18 ms
[2024-05-29 17:55:26] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 17:55:26] [INFO ] Invariant cache hit.
[2024-05-29 17:55:27] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-29 17:55:27] [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-05-29 17:55:29] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 15 ms to minimize.
[2024-05-29 17:55:29] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 2 ms to minimize.
[2024-05-29 17:55:30] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 12 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:55:31] [INFO ] Deduced a trap composed of 14 places in 29 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-05-29 17:55:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:55:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:55:33] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:55:33] [INFO ] Deduced a trap composed of 25 places in 28 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-05-29 17:55:34] [INFO ] Deduced a trap composed of 18 places in 23 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-05-29 17:55:36] [INFO ] Deduced a trap composed of 23 places in 26 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-05-29 17:55:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:55:40] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 6 ms to minimize.
[2024-05-29 17:55:40] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 17:55:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 17:55:45] [INFO ] Deduced a trap composed of 19 places in 25 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 24992 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-05-29 17:55:56] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:55:58] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:55:58] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:55:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:55:58] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 12/626 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 17:56:01] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:56:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-29 17:56:02] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:56:02] [INFO ] Deduced a trap composed of 20 places in 48 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-05-29 17:56:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 5 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/637 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-29 17:56:18] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 251 unsolved
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 30023 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 55076ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 55091ms
Starting structural reductions in LTL mode, iteration 1 : 280/315 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55671 ms. Remains : 280/315 places, 252/287 transitions.
Support contains 42 out of 280 places after structural reductions.
[2024-05-29 17:56:22] [INFO ] Flatten gal took : 43 ms
[2024-05-29 17:56:22] [INFO ] Flatten gal took : 19 ms
[2024-05-29 17:56:22] [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 8955 steps (1 resets) in 378 ms. (23 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-05-29 17:56:23] [INFO ] Computed 45 invariants in 6 ms
[2024-05-29 17:56:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 17:56:23] [INFO ] Invariant cache hit.
[2024-05-29 17:56:23] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 17:56:23] [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-05-29 17:56:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 22 places in 26 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-05-29 17:56:27] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [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-05-29 17:56:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:56:31] [INFO ] Deduced a trap composed of 20 places in 27 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-05-29 17:56:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:56:34] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:56:35] [INFO ] Deduced a trap composed of 22 places in 27 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 16740 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-05-29 17:56:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:56:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-29 17:56:45] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-29 17:56:45] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:56:45] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:56:45] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:56:46] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:56:46] [INFO ] Deduced a trap composed of 18 places in 53 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-05-29 17:56:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:56:50] [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-05-29 17:56:52] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:56:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-29 17:56:54] [INFO ] Deduced a trap composed of 20 places in 54 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-05-29 17:56:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:56:58] [INFO ] Deduced a trap composed of 19 places in 62 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
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 30011 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 46779ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46782ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47066 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 328 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 353 ms.
Product exploration explored 100000 steps with 2 reset in 290 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 145 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 176 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 278 ms. (143 steps per ms) remains 1/4 properties
BEST_FIRST walk for 14620 steps (2 resets) in 44 ms. (324 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 300 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 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
[2024-05-29 17:57:12] [INFO ] Invariant cache hit.
[2024-05-29 17:57:12] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 17:57:12] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-29 17:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:57:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-29 17:57:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:57:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2024-05-29 17:57:13] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 17:57:14] [INFO ] Added : 230 causal constraints over 47 iterations in 1223 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 12 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-29 17:57:14] [INFO ] Invariant cache hit.
[2024-05-29 17:57:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 17:57:14] [INFO ] Invariant cache hit.
[2024-05-29 17:57:14] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 17:57:14] [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-05-29 17:57:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:57:18] [INFO ] Deduced a trap composed of 22 places in 29 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-05-29 17:57:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:57:19] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 2 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-05-29 17:57:22] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:57:22] [INFO ] Deduced a trap composed of 20 places in 25 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-05-29 17:57:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:57:26] [INFO ] Deduced a trap composed of 22 places in 28 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 17391 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-05-29 17:57:35] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:57:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:57:36] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:57:37] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:57:38] [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-05-29 17:57:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:57:42] [INFO ] Deduced a trap composed of 19 places in 58 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-05-29 17:57:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:57:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:57:46] [INFO ] Deduced a trap composed of 20 places in 57 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-05-29 17:57:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:57:50] [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
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 30016 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 47429ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47431ms
Finished structural reductions in LTL mode , in 1 iterations and 47687 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 123 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 182 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 167 ms. (238 steps per ms) remains 1/4 properties
BEST_FIRST walk for 17961 steps (3 resets) in 22 ms. (780 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 243 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 233 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0)]
[2024-05-29 17:58:03] [INFO ] Invariant cache hit.
[2024-05-29 17:58:03] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 17:58:03] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-29 17:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:58:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 17:58:03] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-29 17:58:03] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:58:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:58:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:58:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 132 ms
[2024-05-29 17:58:03] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 17:58:04] [INFO ] Added : 230 causal constraints over 47 iterations in 1111 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 201 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 176 ms.
Product exploration explored 100000 steps with 0 reset in 279 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 193 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 0 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 1 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 1 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 0 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 0 ms
Applied a total of 260 rules in 70 ms. Remains 222 /269 variables (removed 47) and now considering 257/241 (removed -16) transitions.
[2024-05-29 17:58:05] [INFO ] Redundant transitions in 10 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 257 rows 222 cols
[2024-05-29 17:58:05] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 17:58:05] [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-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 17:58:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 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-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 2 places in 18 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-05-29 17:58:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:58:08] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 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 5011 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 5091 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 10157ms problems are : Problem set: 171 solved, 85 unsolved
Search for dead transitions found 171 dead transitions in 10161ms
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.2 ms
Discarding 118 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 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 10264 ms. Remains : 104/269 places, 86/241 transitions.
Built C files in :
/tmp/ltsmin9299235288775985540
[2024-05-29 17:58:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9299235288775985540
Running compilation step : cd /tmp/ltsmin9299235288775985540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 524 ms.
Running link step : cd /tmp/ltsmin9299235288775985540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9299235288775985540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15442966796248514808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 6 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 17:58:31] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 17:58:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 17:58:31] [INFO ] Invariant cache hit.
[2024-05-29 17:58:31] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 17:58:31] [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-05-29 17:58:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:58:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:58:34] [INFO ] Deduced a trap composed of 22 places in 26 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-05-29 17:58:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:58:35] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:58:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:58:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:58:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:58: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-05-29 17:58:38] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:58:39] [INFO ] Deduced a trap composed of 20 places in 28 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-05-29 17:58:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 22 places in 32 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 16622 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-05-29 17:58:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 17:58:51] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-29 17:58:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:58:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:58:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:58:52] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 17:58:52] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:58:52] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:58:52] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 18 places in 53 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-05-29 17:58:57] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:58:58] [INFO ] Deduced a trap composed of 19 places in 54 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-05-29 17:59:00] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:59:01] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-29 17:59:03] [INFO ] Deduced a trap composed of 20 places in 58 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-05-29 17:59:06] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:59:06] [INFO ] Deduced a trap composed of 19 places in 63 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
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 30016 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 46656ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46659ms
Finished structural reductions in LTL mode , in 1 iterations and 46903 ms. Remains : 269/269 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin1530176995192956499
[2024-05-29 17:59:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1530176995192956499
Running compilation step : cd /tmp/ltsmin1530176995192956499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin1530176995192956499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1530176995192956499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15465314451949823486.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:59:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:59:33] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:59:33] [INFO ] Time to serialize gal into /tmp/LTL16641739644729340601.gal : 4 ms
[2024-05-29 17:59:33] [INFO ] Time to serialize properties into /tmp/LTL4492644554019004610.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16641739644729340601.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10163374721387960011.hoa' '-atoms' '/tmp/LTL4492644554019004610.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4492644554019004610.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10163374721387960011.hoa
Detected timeout of ITS tools.
[2024-05-29 17:59:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:59:48] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:59:48] [INFO ] Time to serialize gal into /tmp/LTL12629448937283437060.gal : 12 ms
[2024-05-29 17:59:48] [INFO ] Time to serialize properties into /tmp/LTL8138813075321586990.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12629448937283437060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8138813075321586990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G((F("(p244==1)"))&&(X("(p16!=1)"))))||((X((F("(p244==1)"))&&(X("(p16!=1)"))))&&(G(("(p16!=1)")||(F("(p244!=1)"))))))))
Formula 0 simplified : G(F(G!"(p244==1)" | X!"(p16!=1)") & (X(G!"(p244==1)" | X!"(p16!=1)") | F(!"(p16!=1)" & G!"(p244!=1)")))
Detected timeout of ITS tools.
[2024-05-29 18:00:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:00:03] [INFO ] Applying decomposition
[2024-05-29 18:00:03] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13423266503753991100.txt' '-o' '/tmp/graph13423266503753991100.bin' '-w' '/tmp/graph13423266503753991100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13423266503753991100.bin' '-l' '-1' '-v' '-w' '/tmp/graph13423266503753991100.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:00:03] [INFO ] Decomposing Gal with order
[2024-05-29 18:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:00:03] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 18:00:03] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:00:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 18:00:03] [INFO ] Time to serialize gal into /tmp/LTL12712911689190427812.gal : 6 ms
[2024-05-29 18:00:03] [INFO ] Time to serialize properties into /tmp/LTL4738208818883720262.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12712911689190427812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4738208818883720262.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G((F("(i13.i1.u73.p244==1)"))&&(X("(i2.i1.u6.p16!=1)"))))||((X((F("(i13.i1.u73.p244==1)"))&&(X("(i2.i1.u6.p16!=1)"))))&&(G(("(i2...206
Formula 0 simplified : G(F(G!"(i13.i1.u73.p244==1)" | X!"(i2.i1.u6.p16!=1)") & (X(G!"(i13.i1.u73.p244==1)" | X!"(i2.i1.u6.p16!=1)") | F(!"(i2.i1.u6.p16!=1)...186
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t148, t151, t198, t201, t226, t231, t235, t244, i0.t102, i0.i1.u52.t105, ...949
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 235544 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 16 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:00:18] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:00:18] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 18:00:18] [INFO ] Invariant cache hit.
[2024-05-29 18:00:18] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:00: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-05-29 18:00:21] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:00:21] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:00:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:00:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:00:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:00:22] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:00:22] [INFO ] Deduced a trap composed of 20 places in 33 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-05-29 18:00:22] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 24 places in 28 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-05-29 18:00:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:26] [INFO ] Deduced a trap composed of 21 places in 18 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-05-29 18:00:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:00:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:00:30] [INFO ] Deduced a trap composed of 18 places in 28 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-05-29 18:00:31] [INFO ] Deduced a trap composed of 12 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
[2024-05-29 18:00:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:00:35] [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, 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-05-29 18:00:37] [INFO ] Deduced a trap composed of 18 places in 37 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 24966 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-05-29 18:00:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 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-05-29 18:00:58] [INFO ] Deduced a trap composed of 17 places in 72 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 30010 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 54999ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 55001ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55312 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 395 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 5 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 55737 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 0 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 36 ms. Remains 102 /280 variables (removed 178) and now considering 85/252 (removed 167) transitions.
// Phase 1: matrix 85 rows 102 cols
[2024-05-29 18:01:14] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 18:01:14] [INFO ] Implicit Places using invariants in 60 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 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 8 ms. Remains 98 /100 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 98 cols
[2024-05-29 18:01:14] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 18:01:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 18:01:14] [INFO ] Invariant cache hit.
[2024-05-29 18:01:14] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 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 236 ms. Remains : 98/280 places, 83/252 transitions.
Stuttering acceptance computed with spot in 67 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 530 reset in 226 ms.
Stack based approach found an accepted trace after 144 steps with 0 reset with depth 145 and stack size 145 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 544 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 7 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 18:01:14] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:01:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:01:15] [INFO ] Invariant cache hit.
[2024-05-29 18:01:15] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-29 18:01: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-05-29 18:01:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 20 places in 25 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-05-29 18:01:19] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 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-05-29 18:01:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:01:28] [INFO ] Deduced a trap composed of 19 places in 25 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-05-29 18:01:31] [INFO ] Deduced a trap composed of 18 places in 28 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-05-29 18:01:34] [INFO ] Deduced a trap composed of 18 places in 35 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-05-29 18:01:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 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 28874 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-05-29 18:01:47] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:01:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:01:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:01:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:01:50] [INFO ] Deduced a trap composed of 20 places in 46 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-05-29 18:01:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:01:54] [INFO ] Deduced a trap composed of 15 places in 48 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 22903 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 51803ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 51805ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52046 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 361 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 52431 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-05-29 18:02:07] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:02:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 18:02:07] [INFO ] Invariant cache hit.
[2024-05-29 18:02:07] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-29 18:02:07] [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-05-29 18:02:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:02:09] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:02:10] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:02:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 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-05-29 18:02:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:02:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:02:18] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:02:18] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:02:19] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:02:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 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-05-29 18:02:24] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:02:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:02:26] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 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 24941 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-05-29 18:02:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:02:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:02:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:02:36] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:02:37] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:02:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 11/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:02:42] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:02:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:02:42] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:02:43] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:02:43] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 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 23378 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 48340ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 48342ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48623 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 349 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 282 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 48997 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 26 ms. Remains 104 /280 variables (removed 176) and now considering 86/252 (removed 166) transitions.
// Phase 1: matrix 86 rows 104 cols
[2024-05-29 18:02:56] [INFO ] Computed 45 invariants in 0 ms
[2024-05-29 18:02:56] [INFO ] Implicit Places using invariants in 54 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 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-05-29 18:02:56] [INFO ] Computed 44 invariants in 0 ms
[2024-05-29 18:02:56] [INFO ] Implicit Places using invariants in 63 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 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-05-29 18:02:56] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 18:02:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 18:02:56] [INFO ] Invariant cache hit.
[2024-05-29 18:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:02:56] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 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 280 ms. Remains : 97/280 places, 82/252 transitions.
Stuttering acceptance computed with spot in 72 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 186 ms.
Stack based approach found an accepted trace after 310 steps with 0 reset with depth 311 and stack size 311 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-05 finished in 551 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 10 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 18:02:56] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:02:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 18:02:57] [INFO ] Invariant cache hit.
[2024-05-29 18:02:57] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 18:02:57] [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-05-29 18:02:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:02:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:03:00] [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-05-29 18:03:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:03:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:03:01] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:03:01] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:03:01] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:03:01] [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-05-29 18:03:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:03:05] [INFO ] Deduced a trap composed of 20 places in 25 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-05-29 18:03:07] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:03:08] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:03:09] [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 17015 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-05-29 18:03:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:03:18] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:03:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:03:20] [INFO ] Deduced a trap composed of 18 places in 53 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-05-29 18:03:24] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:03:24] [INFO ] Deduced a trap composed of 19 places in 51 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-05-29 18:03:26] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:03:27] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:03:29] [INFO ] Deduced a trap composed of 20 places in 53 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-05-29 18:03:32] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:03:32] [INFO ] Deduced a trap composed of 19 places in 61 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
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 30011 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 47048ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47050ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47309 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 102 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 45 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 47431 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 12 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:03:44] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:03:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:03:44] [INFO ] Invariant cache hit.
[2024-05-29 18:03:44] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:03:44] [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-05-29 18:03:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:03:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:03:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:03:46] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:03:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:03:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:03:47] [INFO ] Deduced a trap composed of 22 places in 25 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-05-29 18:03:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:03:48] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:03:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:03:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:03:48] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:03:49] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:03:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:03:49] [INFO ] Deduced a trap composed of 24 places in 32 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-05-29 18:03:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:03:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:03:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 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-05-29 18:03:57] [INFO ] Deduced a trap composed of 18 places in 34 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-05-29 18:03:59] [INFO ] Deduced a trap composed of 20 places in 25 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
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 20393 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-05-29 18:04:08] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:04:08] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:04:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:04:09] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 11 ms to minimize.
[2024-05-29 18:04:09] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-29 18:04:09] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:04:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:04:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:04:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:04:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 15/604 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:04:14] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:04:15] [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-05-29 18:04:23] [INFO ] Deduced a trap composed of 20 places in 66 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-05-29 18:04:32] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (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 30018 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 50428ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 50431ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50676 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 120 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 50808 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 13 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 18:04:35] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:04:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 18:04:35] [INFO ] Invariant cache hit.
[2024-05-29 18:04:35] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 18:04:35] [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-05-29 18:04:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 22 places in 27 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-05-29 18:04:39] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:04:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:04:39] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:04:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:04:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:04:39] [INFO ] Deduced a trap composed of 24 places in 29 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-05-29 18:04:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:04:43] [INFO ] Deduced a trap composed of 20 places in 23 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-05-29 18:04:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:04:46] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:04:47] [INFO ] Deduced a trap composed of 22 places in 32 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 16728 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-05-29 18:04:55] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:04:55] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:04:58] [INFO ] Deduced a trap composed of 18 places in 52 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-05-29 18:05:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 19 places in 52 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-05-29 18:05:04] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 20 places in 53 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-05-29 18:05:10] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:05:10] [INFO ] Deduced a trap composed of 19 places in 56 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
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 30010 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 46756ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46758ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47007 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 102 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 456 reset in 146 ms.
Stack based approach found an accepted trace after 190 steps with 0 reset with depth 191 and stack size 191 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-09 finished in 47271 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 9 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
[2024-05-29 18:05:22] [INFO ] Invariant cache hit.
[2024-05-29 18:05:22] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 18:05:22] [INFO ] Invariant cache hit.
[2024-05-29 18:05:22] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 18:05:22] [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-05-29 18:05:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:05:24] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:05:25] [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-05-29 18:05:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:05:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:05:27] [INFO ] Deduced a trap composed of 24 places in 33 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-05-29 18:05:29] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:05:30] [INFO ] Deduced a trap composed of 20 places in 26 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-05-29 18:05:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:05:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:05:34] [INFO ] Deduced a trap composed of 22 places in 23 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 16647 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-05-29 18:05:42] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:05:43] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:05:44] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:05:44] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:05:45] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:05:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:05:45] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:05:45] [INFO ] Deduced a trap composed of 18 places in 53 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-05-29 18:05:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:05:49] [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-05-29 18:05:51] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:05:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:05:54] [INFO ] Deduced a trap composed of 20 places in 55 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-05-29 18:05:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:05:58] [INFO ] Deduced a trap composed of 19 places in 60 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
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 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 46688ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 46691ms
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46930 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 140 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 83 ms.
Product exploration explored 100000 steps with 33333 reset in 92 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 18 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 47286 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 11 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:06:09] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 18:06:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 18:06:09] [INFO ] Invariant cache hit.
[2024-05-29 18:06:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:06:09] [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-05-29 18:06:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:06:12] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:06:13] [INFO ] Deduced a trap composed of 23 places in 20 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-05-29 18:06:13] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:06:14] [INFO ] Deduced a trap composed of 25 places in 38 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-05-29 18:06:17] [INFO ] Deduced a trap composed of 18 places in 29 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-05-29 18:06:21] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 22 places in 20 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-05-29 18:06:22] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:06:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 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-05-29 18:06:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:06:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/512 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:30] [INFO ] Deduced a trap composed of 17 places in 23 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-05-29 18:06:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:06:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:06:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/512 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 356 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 41/41 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, 41/86 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/597 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:43] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:06:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:06:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:06:45] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:06:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 18:06:45] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:06:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 7/604 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 21 places in 43 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
[2024-05-29 18:06:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 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
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 28792 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 58820ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 58822ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59074 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 378 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 62 steps with 16 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-11 finished in 59473 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-05-29 18:07:09] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 18:07:09] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 18:07:09] [INFO ] Invariant cache hit.
[2024-05-29 18:07:09] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:07:09] [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-05-29 18:07:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 22 places in 22 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-05-29 18:07:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 24 places in 31 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-05-29 18:07:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 22 places in 24 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-05-29 18:07:20] [INFO ] Deduced a trap composed of 18 places in 31 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-05-29 18:07:21] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:07:23] [INFO ] Deduced a trap composed of 12 places in 26 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-05-29 18:07:27] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 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 23512 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-05-29 18:07:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:07:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:07:36] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:07:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:07:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:07:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:07:37] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:07:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:07:38] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:07:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:07:38] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:07:38] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-29 18:07:39] [INFO ] Deduced a trap composed of 15 places in 54 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-05-29 18:07:42] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:07:42] [INFO ] Deduced a trap composed of 19 places in 56 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-05-29 18:07:48] [INFO ] Deduced a trap composed of 19 places in 17 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-05-29 18:07:56] [INFO ] Deduced a trap composed of 20 places in 61 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 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 53544ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 53546ms
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53782 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 324 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 171 ms.
Product exploration explored 100000 steps with 1 reset in 220 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 156 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 254 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 186 ms. (213 steps per ms) remains 1/6 properties
BEST_FIRST walk for 15456 steps (2 resets) in 16 ms. (909 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 308 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 245 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 231 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 5 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 18:08:05] [INFO ] Invariant cache hit.
[2024-05-29 18:08:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 18:08:05] [INFO ] Invariant cache hit.
[2024-05-29 18:08:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:08:05] [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-05-29 18:08:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:08:08] [INFO ] Deduced a trap composed of 22 places in 22 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-05-29 18:08:09] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:08:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:08:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:08:09] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:08:09] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:08:09] [INFO ] Deduced a trap composed of 24 places in 24 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-05-29 18:08:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:08:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:08:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:08:13] [INFO ] Deduced a trap composed of 22 places in 29 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-05-29 18:08:15] [INFO ] Deduced a trap composed of 18 places in 30 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-05-29 18:08:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 12 places in 26 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-05-29 18:08:22] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 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 23411 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-05-29 18:08:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:08:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:08:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:08:32] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:08:32] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:08:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:08:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:08:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 15 places in 54 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-05-29 18:08:37] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:08:38] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:08:38] [INFO ] Deduced a trap composed of 19 places in 53 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-05-29 18:08:44] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 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-05-29 18:08:52] [INFO ] Deduced a trap composed of 20 places in 52 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 30017 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 53445ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 53447ms
Finished structural reductions in LTL mode , in 1 iterations and 53676 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 121 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 289 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 126 ms. (314 steps per ms) remains 1/6 properties
BEST_FIRST walk for 21005 steps (3 resets) in 27 ms. (750 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 437 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 262 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 251 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 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)]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 1 reset in 252 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 228 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 0 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 42 ms. Remains 224 /270 variables (removed 46) and now considering 255/242 (removed -13) transitions.
[2024-05-29 18:09:01] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
// Phase 1: matrix 255 rows 224 cols
[2024-05-29 18:09:01] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:09:01] [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-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-29 18:09:03] [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-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-29 18:09:03] [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-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 19 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-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-29 18:09:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 3 places in 20 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-05-29 18:09:04] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-29 18:09:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 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 5388 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 4652 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 10087ms problems are : Problem set: 169 solved, 85 unsolved
Search for dead transitions found 169 dead transitions in 10090ms
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.1 ms
Discarding 120 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 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 10148 ms. Remains : 104/270 places, 86/242 transitions.
Built C files in :
/tmp/ltsmin2620001922317519905
[2024-05-29 18:09:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2620001922317519905
Running compilation step : cd /tmp/ltsmin2620001922317519905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 400 ms.
Running link step : cd /tmp/ltsmin2620001922317519905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2620001922317519905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8846168758587533056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 5 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:09:26] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:09:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 18:09:26] [INFO ] Invariant cache hit.
[2024-05-29 18:09:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:09:26] [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-05-29 18:09:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:09:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:09:28] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:09:28] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:09:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:09:30] [INFO ] Deduced a trap composed of 22 places in 27 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-05-29 18:09:30] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:09:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:09:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:09:30] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:09:31] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:09:31] [INFO ] Deduced a trap composed of 24 places in 33 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-05-29 18:09:34] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:09:34] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:09:34] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:09:34] [INFO ] Deduced a trap composed of 22 places in 24 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-05-29 18:09:37] [INFO ] Deduced a trap composed of 18 places in 33 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-05-29 18:09:38] [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, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:09:40] [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-05-29 18:09:44] [INFO ] Deduced a trap composed of 18 places in 19 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 23625 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-05-29 18:09:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:09:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:09:53] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:09:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:09:54] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:09:55] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:09:55] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:09:55] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:09:55] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:09:55] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:09:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:09:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:09:56] [INFO ] Deduced a trap composed of 15 places in 54 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-05-29 18:09:59] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:09:59] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:09:59] [INFO ] Deduced a trap composed of 19 places in 51 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-05-29 18:10:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 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-05-29 18:10:12] [INFO ] Deduced a trap composed of 20 places in 67 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 30014 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 53660ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 53662ms
Finished structural reductions in LTL mode , in 1 iterations and 53894 ms. Remains : 270/270 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin13242347517782218491
[2024-05-29 18:10:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13242347517782218491
Running compilation step : cd /tmp/ltsmin13242347517782218491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin13242347517782218491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13242347517782218491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5281930234154100704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:10:35] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:10:35] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:10:35] [INFO ] Time to serialize gal into /tmp/LTL11317224622834210572.gal : 2 ms
[2024-05-29 18:10:35] [INFO ] Time to serialize properties into /tmp/LTL14258616367834622556.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11317224622834210572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9084663951305320229.hoa' '-atoms' '/tmp/LTL14258616367834622556.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14258616367834622556.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9084663951305320229.hoa
Detected timeout of ITS tools.
[2024-05-29 18:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:10:50] [INFO ] Time to serialize gal into /tmp/LTL864688977096672990.gal : 2 ms
[2024-05-29 18:10:50] [INFO ] Time to serialize properties into /tmp/LTL3931748364502136447.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL864688977096672990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3931748364502136447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((X("((p172==1)&&(p208==1))"))||(("(p126!=1)")U(("(p126!=1)")&&(G((!("((p94==1)&&(p135==1))"))||(X(X(G("(p126!=1)"))))))))))
Formula 0 simplified : X!"((p172==1)&&(p208==1))" & (F("((p94==1)&&(p135==1))" & XXF!"(p126!=1)") W !"(p126!=1)")
Detected timeout of ITS tools.
[2024-05-29 18:11:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:11:05] [INFO ] Applying decomposition
[2024-05-29 18:11:05] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4596945707905748401.txt' '-o' '/tmp/graph4596945707905748401.bin' '-w' '/tmp/graph4596945707905748401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4596945707905748401.bin' '-l' '-1' '-v' '-w' '/tmp/graph4596945707905748401.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:11:05] [INFO ] Decomposing Gal with order
[2024-05-29 18:11:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:11:05] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 18:11:05] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:11:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 18:11:05] [INFO ] Time to serialize gal into /tmp/LTL14580277736198839243.gal : 4 ms
[2024-05-29 18:11:05] [INFO ] Time to serialize properties into /tmp/LTL10344461151490402870.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14580277736198839243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10344461151490402870.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("((i9.i1.u56.p172==1)&&(i9.i2.u66.p208==1))"))||(("(i6.u39.p126!=1)")U(("(i6.u39.p126!=1)")&&(G((!("((i5.i1.u29.p94==1)&&(i7.i1....208
Formula 0 simplified : X!"((i9.i1.u56.p172==1)&&(i9.i2.u66.p208==1))" & (F("((i5.i1.u29.p94==1)&&(i7.i1.u44.p135==1))" & XXF!"(i6.u39.p126!=1)") W !"(i6.u3...167
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t154, t195, t198, t226, t235, t249, i0.t119, i0.u47.t124, i1.t201, i1.i0....967
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 251541 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 27 ms. Remains 105 /280 variables (removed 175) and now considering 87/252 (removed 165) transitions.
// Phase 1: matrix 87 rows 105 cols
[2024-05-29 18:11:20] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:11:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 18:11:20] [INFO ] Invariant cache hit.
[2024-05-29 18:11:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:11:20] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-29 18:11:20] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-29 18:11:20] [INFO ] Invariant cache hit.
[2024-05-29 18:11:20] [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-05-29 18:11:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:11:21] [INFO ] Deduced a trap composed of 4 places in 17 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 1575 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 1985 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 3580ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3580ms
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 3804 ms. Remains : 105/280 places, 87/252 transitions.
Stuttering acceptance computed with spot in 147 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 215 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 4192 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 9 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 18:11:24] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:11:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 18:11:25] [INFO ] Invariant cache hit.
[2024-05-29 18:11:25] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-29 18:11:25] [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-05-29 18:11:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 14 places in 20 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-05-29 18:11:29] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 24 places in 28 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-05-29 18:11:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:11:35] [INFO ] Deduced a trap composed of 19 places in 27 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-05-29 18:11:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:11:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:11:37] [INFO ] Deduced a trap composed of 17 places in 25 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-05-29 18:11:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 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-05-29 18:11:45] [INFO ] Deduced a trap composed of 20 places in 26 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-05-29 18:11:49] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 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-05-29 18:11:53] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 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 30010 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-05-29 18:11:56] [INFO ] Deduced a trap composed of 20 places in 41 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-05-29 18:11:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:11:59] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:12:02] [INFO ] Deduced a trap composed of 17 places in 46 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-05-29 18:12:04] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:12:05] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 19 places in 48 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-05-29 18:12:10] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:12:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:12:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:12:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 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-05-29 18:12:18] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:12:19] [INFO ] Deduced a trap composed of 20 places in 59 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
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/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 30011 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 60043ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60298 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 293 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 92 ms.
Product exploration explored 100000 steps with 50000 reset in 101 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 17 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 60829 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 206 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 22 ms. Remains 100 /280 variables (removed 180) and now considering 83/252 (removed 169) transitions.
// Phase 1: matrix 83 rows 100 cols
[2024-05-29 18:12:26] [INFO ] Computed 44 invariants in 0 ms
[2024-05-29 18:12:26] [INFO ] Implicit Places using invariants in 58 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 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-05-29 18:12:26] [INFO ] Computed 42 invariants in 0 ms
[2024-05-29 18:12:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 18:12:26] [INFO ] Invariant cache hit.
[2024-05-29 18:12:26] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 163 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 264 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 1 reset in 184 ms.
Product exploration explored 100000 steps with 0 reset in 250 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 263 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 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/4 properties
BEST_FIRST walk for 14894 steps (4 resets) in 14 ms. (992 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 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 102 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 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 18:12:27] [INFO ] Invariant cache hit.
[2024-05-29 18:12:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 18:12:27] [INFO ] Invariant cache hit.
[2024-05-29 18:12:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 18:12:27] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-29 18:12: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 1271 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 1220 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 2505ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2505ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2637 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 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/4 properties
BEST_FIRST walk for 23647 steps (5 resets) in 22 ms. (1028 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 342 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 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 184 ms.
Product exploration explored 100000 steps with 2 reset in 262 ms.
Built C files in :
/tmp/ltsmin18043960048792805230
[2024-05-29 18:12:31] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 18:12:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:31] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 18:12:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:31] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 18:12:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18043960048792805230
Running compilation step : cd /tmp/ltsmin18043960048792805230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin18043960048792805230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18043960048792805230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13681273036266383239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 18:12:46] [INFO ] Invariant cache hit.
[2024-05-29 18:12:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 18:12:46] [INFO ] Invariant cache hit.
[2024-05-29 18:12:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 18:12:46] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-29 18:12:46] [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 1234 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 1258 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 2501ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2502ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2650 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin7804617403758748341
[2024-05-29 18:12:49] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 18:12:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:49] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 18:12:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:49] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 18:12:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7804617403758748341
Running compilation step : cd /tmp/ltsmin7804617403758748341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin7804617403758748341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7804617403758748341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4004683009409564442.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:13:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:13:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:04] [INFO ] Time to serialize gal into /tmp/LTL11483199753442420516.gal : 1 ms
[2024-05-29 18:13:04] [INFO ] Time to serialize properties into /tmp/LTL7429687000660454078.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11483199753442420516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut591566188259299428.hoa' '-atoms' '/tmp/LTL7429687000660454078.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7429687000660454078.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut591566188259299428.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t203, t1.t200, t2.t197, t3.t156, t4.t153, t5.t150, t6.t104, t7.t101, t8.t98, t204, t238.t1...318
Computing Next relation with stutter on 369558 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.41361,31840,1,0,212,95076,202,113,3006,127839,305
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 39333 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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-05-29 18:13:05] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17556113973762816462
[2024-05-29 18:13:05] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-29 18:13:05] [INFO ] Applying decomposition
[2024-05-29 18:13:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:13:05] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-29 18:13:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:13:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16260327402648388510.txt' '-o' '/tmp/graph16260327402648388510.bin' '-w' '/tmp/graph16260327402648388510.weights'
[2024-05-29 18:13:05] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-29 18:13:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16260327402648388510.bin' '-l' '-1' '-v' '-w' '/tmp/graph16260327402648388510.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:13:05] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17556113973762816462
Running compilation step : cd /tmp/ltsmin17556113973762816462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 18:13:05] [INFO ] Decomposing Gal with order
[2024-05-29 18:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:13:05] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-29 18:13:05] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:13:05] [INFO ] Time to serialize gal into /tmp/LTLFireability11967763906103803323.gal : 3 ms
[2024-05-29 18:13:05] [INFO ] Time to serialize properties into /tmp/LTLFireability18236780952980384611.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11967763906103803323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18236780952980384611.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((F(((X((F("(i13.i1.u79.p244==1)"))&&(X("(i2.i0.u6.p16!=1)"))))&&(G(("(i2.i0.u6.p16!=1)")||(F("(i13.i1.u79.p244!=1)")))))||(G((F("(i1...206
Formula 0 simplified : G(F(G!"(i13.i1.u79.p244==1)" | X!"(i2.i0.u6.p16!=1)") & (X(G!"(i13.i1.u79.p244==1)" | X!"(i2.i0.u6.p16!=1)") | F(!"(i2.i0.u6.p16!=1)...186
Compilation finished in 580 ms.
Running link step : cd /tmp/ltsmin17556113973762816462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17556113973762816462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t53, t56, t96, t99, t148, t151, t195, t198, t226, t234, t235, t240, t243, t244, i0.i0.u2.t205...1152
Computing Next relation with stutter on 369558 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: LTL layer: formula: <>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.007: "<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.225: There are 258 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.225: State length is 281, there are 279 groups
pins2lts-mc-linux64( 0/ 8), 0.225: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.225: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.225: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.225: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.274: [Blue] ~79 levels ~960 states ~4168 transitions
pins2lts-mc-linux64( 3/ 8), 0.293: [Blue] ~79 levels ~1920 states ~5888 transitions
pins2lts-mc-linux64( 3/ 8), 0.320: [Blue] ~79 levels ~3840 states ~9984 transitions
pins2lts-mc-linux64( 3/ 8), 0.388: [Blue] ~79 levels ~7680 states ~19424 transitions
pins2lts-mc-linux64( 3/ 8), 0.507: [Blue] ~79 levels ~15360 states ~37552 transitions
pins2lts-mc-linux64( 3/ 8), 0.726: [Blue] ~79 levels ~30720 states ~80272 transitions
pins2lts-mc-linux64( 3/ 8), 1.158: [Blue] ~79 levels ~61440 states ~173488 transitions
pins2lts-mc-linux64( 3/ 8), 1.801: [Blue] ~79 levels ~122880 states ~367568 transitions
pins2lts-mc-linux64( 3/ 8), 2.858: [Blue] ~79 levels ~245760 states ~789728 transitions
pins2lts-mc-linux64( 3/ 8), 4.677: [Blue] ~79 levels ~491520 states ~1638704 transitions
pins2lts-mc-linux64( 2/ 8), 7.772: [Blue] ~119220 levels ~983040 states ~5152136 transitions
pins2lts-mc-linux64( 0/ 8), 13.750: [Blue] ~243112 levels ~1966080 states ~10884064 transitions
pins2lts-mc-linux64( 0/ 8), 25.578: [Blue] ~485742 levels ~3932160 states ~22485800 transitions
pins2lts-mc-linux64( 0/ 8), 50.294: [Blue] ~970935 levels ~7864320 states ~46448240 transitions
pins2lts-mc-linux64( 0/ 8), 99.097: [Blue] ~1940637 levels ~15728640 states ~95921864 transitions
pins2lts-mc-linux64( 0/ 8), 197.402: [Blue] ~3876993 levels ~31457280 states ~198336368 transitions
pins2lts-mc-linux64( 1/ 8), 282.027: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 282.092:
pins2lts-mc-linux64( 0/ 8), 282.092: Explored 41293610 states 274378633 transitions, fanout: 6.645
pins2lts-mc-linux64( 0/ 8), 282.092: Total exploration time 281.850 sec (281.780 sec minimum, 281.816 sec on average)
pins2lts-mc-linux64( 0/ 8), 282.092: States per second: 146509, Transitions per second: 973492
pins2lts-mc-linux64( 0/ 8), 282.092:
pins2lts-mc-linux64( 0/ 8), 282.092: State space has 134217355 states, 5078970 are accepting
pins2lts-mc-linux64( 0/ 8), 282.092: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 282.092: blue states: 41293610 (30.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 282.092: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 282.092: all-red states: 5078970 (3.78%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 282.092:
pins2lts-mc-linux64( 0/ 8), 282.092: Total memory used for local state coloring: 477.5MB
pins2lts-mc-linux64( 0/ 8), 282.092:
pins2lts-mc-linux64( 0/ 8), 282.092: Queue width: 8B, total height: 31291305, memory: 238.73MB
pins2lts-mc-linux64( 0/ 8), 282.092: Tree memory: 1104.1MB, 8.6 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 282.092: Tree fill ratio (roots/leafs): 99.0%/31.0%
pins2lts-mc-linux64( 0/ 8), 282.092: Stored 252 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 282.092: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 282.092: Est. total memory use: 1342.9MB (~1262.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17556113973762816462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17556113973762816462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-29 18:38:57] [INFO ] Applying decomposition
[2024-05-29 18:38:57] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:38:57] [INFO ] Decomposing Gal with order
[2024-05-29 18:38:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:38:57] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 18:38:57] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:38:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2024-05-29 18:38:57] [INFO ] Time to serialize gal into /tmp/LTLFireability17317727228351091909.gal : 3 ms
[2024-05-29 18:38:57] [INFO ] Time to serialize properties into /tmp/LTLFireability2705081527990291283.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17317727228351091909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2705081527990291283.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(((X((F("(i1.i0.i0.i0.i0.i0.u91.p244==1)"))&&(X("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u12.p16!=1)"))))&&(G(("(i0.i0.i0.i1.i0.i0.i0.i0.i0...314
Formula 0 simplified : G(F(G!"(i1.i0.i0.i0.i0.i0.u91.p244==1)" | X!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u12.p16!=1)") & (X(G!"(i1.i0.i0.i0.i0.i0.u91.p244==1)" |...294
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t205, i0.i0.i0.i1.u25.t161, i0.i0.i0.i1.u25.t162, i0.i0.i0.i1.u25.t166, i0.i0.i0....2161
Computing Next relation with stutter on 369558 deadlock states
ITS-tools command line returned an error code 137
[2024-05-29 18:50:28] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:50:28] [INFO ] Input system was already deterministic with 252 transitions.
[2024-05-29 18:50:28] [INFO ] Transformed 280 places.
[2024-05-29 18:50:28] [INFO ] Transformed 252 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 18:50:28] [INFO ] Time to serialize gal into /tmp/LTLFireability9399672553362991797.gal : 3 ms
[2024-05-29 18:50:28] [INFO ] Time to serialize properties into /tmp/LTLFireability12371782737146589578.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9399672553362991797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12371782737146589578.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X((F("(p244==1)"))&&(X("(p16!=1)"))))&&(G(("(p16!=1)")||(F("(p244!=1)")))))||(G((F("(p244==1)"))&&(X("(p16!=1)")))))))
Formula 0 simplified : G(F(G!"(p244==1)" | X!"(p16!=1)") & (X(G!"(p244==1)" | X!"(p16!=1)") | F(!"(p16!=1)" & G!"(p244!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t21, t25, t29, t34, t38, t42, t43, t47, t49, t50, t52, t53, t55, t56, t58, t59, t63...619
Computing Next relation with stutter on 369558 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r356-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 '
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 ;