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-171683762300988.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 ShieldRVt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762300988
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 239K 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 ShieldRVt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717079698207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 14:34:59] [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-30 14:34:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:34:59] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-30 14:34:59] [INFO ] Transformed 1003 places.
[2024-05-30 14:34:59] [INFO ] Transformed 1003 transitions.
[2024-05-30 14:34:59] [INFO ] Found NUPN structural information;
[2024-05-30 14:34:59] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 238 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 4 formulas.
FORMULA ShieldRVt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 796 transition count 796
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 796 transition count 796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 415 place count 795 transition count 795
Iterating global reduction 0 with 1 rules applied. Total rules applied 416 place count 795 transition count 795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 794 transition count 794
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 794 transition count 794
Applied a total of 418 rules in 257 ms. Remains 794 /1003 variables (removed 209) and now considering 794/1003 (removed 209) transitions.
// Phase 1: matrix 794 rows 794 cols
[2024-05-30 14:35:00] [INFO ] Computed 81 invariants in 28 ms
[2024-05-30 14:35:00] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-30 14:35:00] [INFO ] Invariant cache hit.
[2024-05-30 14:35:01] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2024-05-30 14:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/793 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/794 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 793 unsolved
[2024-05-30 14:35:18] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 8 ms to minimize.
[2024-05-30 14:35:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
[2024-05-30 14:35:19] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:35:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:35:20] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:35:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:35:21] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:35:21] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:35:22] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:35:22] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:35:22] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:35:23] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 3 ms to minimize.
[2024-05-30 14:35:23] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:35:24] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:35:24] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:35:24] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:35:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:35:25] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:35:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:35:25] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/1588 variables, and 101 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/793 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/794 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/794 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 793 unsolved
[2024-05-30 14:35:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:35:48] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 4 ms to minimize.
[2024-05-30 14:35:48] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:35:48] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:35:49] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:35:50] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:35:50] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 793 unsolved
[2024-05-30 14:35:58] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 793 unsolved
[2024-05-30 14:36:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 4 ms to minimize.
SMT process timed out in 60249ms, After SMT, problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Starting structural reductions in LTL mode, iteration 1 : 794/1003 places, 794/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61595 ms. Remains : 794/1003 places, 794/1003 transitions.
Support contains 31 out of 794 places after structural reductions.
[2024-05-30 14:36:01] [INFO ] Flatten gal took : 81 ms
[2024-05-30 14:36:01] [INFO ] Flatten gal took : 38 ms
[2024-05-30 14:36:01] [INFO ] Input system was already deterministic with 794 transitions.
RANDOM walk for 40000 steps (9 resets) in 2261 ms. (17 steps per ms) remains 12/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
[2024-05-30 14:36:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 562/578 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 216/794 variables, 23/81 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 794/1588 variables, 794/875 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1588 variables, 0/875 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1588 variables, 0/875 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1588/1588 variables, and 875 constraints, problems are : Problem set: 1 solved, 11 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 794/794 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 124/137 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 657/794 variables, 71/81 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-30 14:36:04] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 9/90 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 794/1588 variables, 794/884 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1588 variables, 11/895 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-30 14:36:05] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:36:05] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:36:05] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:36:05] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1588 variables, 4/899 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1588 variables, 0/899 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1588 variables, 0/899 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1588/1588 variables, and 899 constraints, problems are : Problem set: 1 solved, 11 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 794/794 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 13/13 constraints]
After SMT, in 4158ms problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 7470 ms.
Support contains 13 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 794/794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 794 transition count 580
Reduce places removed 214 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 215 rules applied. Total rules applied 429 place count 580 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 579 transition count 579
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 430 place count 579 transition count 428
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 732 place count 428 transition count 428
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 737 place count 423 transition count 423
Iterating global reduction 3 with 5 rules applied. Total rules applied 742 place count 423 transition count 423
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 742 place count 423 transition count 420
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 748 place count 420 transition count 420
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 0 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1114 place count 237 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1115 place count 237 transition count 236
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1117 place count 236 transition count 235
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1231 place count 179 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1232 place count 179 transition count 285
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1233 place count 179 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1234 place count 178 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1235 place count 178 transition count 283
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 178 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1237 place count 177 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1238 place count 176 transition count 282
Applied a total of 1238 rules in 153 ms. Remains 176 /794 variables (removed 618) and now considering 282/794 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 176/794 places, 282/794 transitions.
RANDOM walk for 39851 steps (12 resets) in 533 ms. (74 steps per ms) remains 0/11 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 241 stabilizing places and 241 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(p0)&&X((F(p1)&&X((G(p2)||(p2&&F(!p0))))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 61 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-30 14:36:15] [INFO ] Computed 81 invariants in 9 ms
[2024-05-30 14:36:15] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 14:36:15] [INFO ] Invariant cache hit.
[2024-05-30 14:36:15] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-30 14:36:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:36:31] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:36:32] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:36:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:36:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-05-30 14:36:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:36:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:36:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:36:35] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:36:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 4 ms to minimize.
[2024-05-30 14:36:36] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:36:36] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:36:37] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:36:37] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:36:38] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:36:38] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:36:39] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:36:39] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:36:40] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:36:40] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:36:40] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:37:02] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/884 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1665 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 5 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 5 ms to minimize.
[2024-05-30 14:37:15] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/1564 variables, and 1668 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 24/24 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 782/794 places, 782/794 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (AND p0 (NOT p2)), p0]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-00
Stuttering criterion allowed to conclude after 11335 steps with 3 reset in 70 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-00 finished in 61440 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(X(X(X(F((p0||G(p1))))))))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 42 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-30 14:37:16] [INFO ] Computed 81 invariants in 4 ms
[2024-05-30 14:37:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-30 14:37:16] [INFO ] Invariant cache hit.
[2024-05-30 14:37:17] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-30 14:37:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:37:33] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 14:37:34] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:37:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:37:35] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:37:35] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:37:36] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:37:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:37:37] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:37:37] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:37:38] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:37:38] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:37:39] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:37:39] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:37:39] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:37:40] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:37:40] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:37:41] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:37:41] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 2 ms to minimize.
[2024-05-30 14:37:42] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:37:42] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)timeout

(s617 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:38:03] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/884 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1665 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 4 ms to minimize.
[2024-05-30 14:38:17] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/1564 variables, and 1667 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 23/23 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 782/794 places, 782/794 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-01
Product exploration explored 100000 steps with 14285 reset in 175 ms.
Product exploration explored 100000 steps with 14285 reset in 220 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
[2024-05-30 14:38:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 743/782 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1564 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1564/1564 variables, and 863 constraints, problems are : Problem set: 0 solved, 3 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 743/782 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 14:38:19] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 782/1564 variables, 782/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1564 variables, 3/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:38:20] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1564 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1564 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1564 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1564/1564 variables, and 876 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 2004ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1338 ms.
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 782/782 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 782 transition count 565
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 565 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 564 transition count 564
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 436 place count 564 transition count 405
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 754 place count 405 transition count 405
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1114 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1115 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1117 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1235 place count 165 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1236 place count 165 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 164 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Applied a total of 1238 rules in 57 ms. Remains 163 /782 variables (removed 619) and now considering 278/782 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 163/782 places, 278/782 transitions.
RANDOM walk for 40000 steps (15 resets) in 244 ms. (163 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
// Phase 1: matrix 278 rows 163 cols
[2024-05-30 14:38:22] [INFO ] Computed 80 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/82 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/337 variables, 32/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/379 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 25/404 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/426 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 15/441 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/441 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/82 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/337 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/379 variables, 18/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/379 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 25/404 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/426 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/426 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 15/441 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/441 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/441 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/441 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 278/278 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 163/163 places, 278/278 transitions.
RANDOM walk for 40000 steps (12 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37990 steps (9 resets) in 73 ms. (513 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 782/782 places, 782/782 transitions.
Applied a total of 0 rules in 17 ms. Remains 782 /782 variables (removed 0) and now considering 782/782 (removed 0) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-30 14:38:23] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:38:23] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-30 14:38:23] [INFO ] Invariant cache hit.
[2024-05-30 14:38:24] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-30 14:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:38:40] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:38:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:38:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:38:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:38:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:38:43] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:38:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:38:44] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:38:44] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:38:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:45] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:46] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:38:46] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:38:47] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:38:47] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:38:48] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:38:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:38:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:38:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:39:10] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/884 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1665 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:39:24] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 5 ms to minimize.
[2024-05-30 14:39:24] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 5 ms to minimize.
SMT process timed out in 60347ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Finished structural reductions in LTL mode , in 1 iterations and 61015 ms. Remains : 782/782 places, 782/782 transitions.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9 resets) in 205 ms. (194 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2024-05-30 14:39:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 743/782 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1564 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1564/1564 variables, and 863 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 743/782 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-30 14:39:25] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-30 14:39:26] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 14:39:26] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 782/1564 variables, 782/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1564 variables, 3/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:39:26] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1564 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1564 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1564 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1564/1564 variables, and 876 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 1884ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 892 ms.
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 782/782 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 782 transition count 565
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 565 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 564 transition count 564
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 436 place count 564 transition count 405
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 754 place count 405 transition count 405
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1114 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1115 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1117 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1235 place count 165 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1236 place count 165 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 164 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Applied a total of 1238 rules in 47 ms. Remains 163 /782 variables (removed 619) and now considering 278/782 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 163/782 places, 278/782 transitions.
RANDOM walk for 40000 steps (12 resets) in 203 ms. (196 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
// Phase 1: matrix 278 rows 163 cols
[2024-05-30 14:39:27] [INFO ] Computed 80 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/82 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/337 variables, 32/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/379 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 25/404 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/426 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 15/441 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/441 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/82 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/337 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/379 variables, 18/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/379 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 25/404 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/404 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/404 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/426 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/426 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 15/441 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/441 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/441 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/441 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 278/278 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 163/163 places, 278/278 transitions.
RANDOM walk for 32029 steps (9 resets) in 133 ms. (239 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14285 reset in 129 ms.
Product exploration explored 100000 steps with 14285 reset in 137 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 782/782 places, 782/782 transitions.
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 782 transition count 782
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 218 place count 782 transition count 862
Deduced a syphon composed of 298 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 298 place count 782 transition count 862
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 538 places in 1 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 538 place count 782 transition count 862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 539 place count 782 transition count 861
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 698 place count 623 transition count 702
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 857 place count 623 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 380 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 623 transition count 702
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 860 place count 621 transition count 700
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 862 place count 621 transition count 700
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -562
Deduced a syphon composed of 456 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 940 place count 621 transition count 1262
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1019 place count 542 transition count 1104
Deduced a syphon composed of 377 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1098 place count 542 transition count 1104
Deduced a syphon composed of 377 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1101 place count 542 transition count 1101
Deduced a syphon composed of 377 places in 0 ms
Applied a total of 1101 rules in 218 ms. Remains 542 /782 variables (removed 240) and now considering 1101/782 (removed -319) transitions.
[2024-05-30 14:39:30] [INFO ] Redundant transitions in 79 ms returned []
Running 1100 sub problems to find dead transitions.
// Phase 1: matrix 1101 rows 542 cols
[2024-05-30 14:39:30] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:39:30] [INFO ] State equation strengthened by 351 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (OVERLAPS) 1/542 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-30 14:39:48] [INFO ] Deduced a trap composed of 3 places in 30 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 TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 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 TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1096 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 20/101 constraints. Problems are: Problem set: 193 solved, 907 unsolved
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-30 14:39:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
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 TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 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 TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 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
Problem TDEAD161 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 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 TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 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
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 20/121 constraints. Problems are: Problem set: 403 solved, 697 unsolved
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 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 TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 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 TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 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 TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/141 constraints. Problems are: Problem set: 611 solved, 489 unsolved
[2024-05-30 14:39:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 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 TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 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 TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 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 TDEAD203 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 20/161 constraints. Problems are: Problem set: 816 solved, 284 unsolved
[2024-05-30 14:39:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/162 constraints. Problems are: Problem set: 821 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/1643 variables, and 162 constraints, problems are : Problem set: 821 solved, 279 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/542 constraints, ReadFeed: 0/351 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 821 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 378/542 variables, 81/81 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 81/162 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/162 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 1100/1642 variables, 542/704 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1642 variables, 350/1054 constraints. Problems are: Problem set: 821 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1642 variables, 279/1333 constraints. Problems are: Problem set: 821 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1642/1643 variables, and 1333 constraints, problems are : Problem set: 821 solved, 279 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 542/542 constraints, ReadFeed: 350/351 constraints, PredecessorRefiner: 279/1100 constraints, Known Traps: 81/81 constraints]
After SMT, in 61005ms problems are : Problem set: 821 solved, 279 unsolved
Search for dead transitions found 821 dead transitions in 61016ms
Found 821 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 821 transitions
Dead transitions reduction (with SMT) removed 821 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 542/782 places, 280/782 transitions.
Graph (complete) has 975 edges and 542 vertex of which 165 are kept as prefixes of interest. Removing 377 places using SCC suffix rule.2 ms
Discarding 377 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 165 /542 variables (removed 377) and now considering 280/280 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/782 places, 280/782 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61357 ms. Remains : 165/782 places, 280/782 transitions.
Built C files in :
/tmp/ltsmin11770231592244782733
[2024-05-30 14:40:31] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11770231592244782733
Running compilation step : cd /tmp/ltsmin11770231592244782733;'/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 1498 ms.
Running link step : cd /tmp/ltsmin11770231592244782733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11770231592244782733;'/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/stateBased4328871882088911966.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-020B-LTLFireability-01 finished in 196474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 781 transition count 781
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 781 transition count 781
Applied a total of 26 rules in 30 ms. Remains 781 /794 variables (removed 13) and now considering 781/794 (removed 13) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-30 14:40:33] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:40:33] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-30 14:40:33] [INFO ] Invariant cache hit.
[2024-05-30 14:40:33] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:40:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:40:50] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:40:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:40:51] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:40:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:40:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:40:52] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-30 14:40:52] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:40:53] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:40:53] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:40:54] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:40:54] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:40:55] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:40:55] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:40:56] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:40:56] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:40:57] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:40:57] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:40:58] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:40:58] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:40:58] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:41:19] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1562 variables, 780/1663 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:41:32] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 5 ms to minimize.
[2024-05-30 14:41:32] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 5 ms to minimize.
[2024-05-30 14:41:32] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 4 ms to minimize.
[2024-05-30 14:41:33] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 5 ms to minimize.
[2024-05-30 14:41:33] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 5 ms to minimize.
[2024-05-30 14:41:33] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 5 ms to minimize.
SMT process timed out in 60279ms, After SMT, problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in LTL mode, iteration 1 : 781/794 places, 781/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60965 ms. Remains : 781/794 places, 781/794 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-02
Product exploration explored 100000 steps with 618 reset in 278 ms.
Product exploration explored 100000 steps with 625 reset in 271 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Detected a total of 238/781 stabilizing places and 238/781 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 621 steps (0 resets) in 6 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-30 14:41:35] [INFO ] Invariant cache hit.
[2024-05-30 14:41:35] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2024-05-30 14:41:36] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2024-05-30 14:41:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 14:41:36] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2024-05-30 14:41:37] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2024-05-30 14:41:37] [INFO ] Computed and/alt/rep : 780/1141/780 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-30 14:41:46] [INFO ] Added : 769 causal constraints over 155 iterations in 8931 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 780 transition count 562
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 562 transition count 562
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 436 place count 562 transition count 401
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 758 place count 401 transition count 401
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 1110 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1111 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1113 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1231 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1233 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1234 place count 162 transition count 279
Applied a total of 1234 rules in 38 ms. Remains 162 /781 variables (removed 619) and now considering 279/781 (removed 502) transitions.
// Phase 1: matrix 279 rows 162 cols
[2024-05-30 14:41:46] [INFO ] Computed 80 invariants in 0 ms
[2024-05-30 14:41:46] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-30 14:41:46] [INFO ] Invariant cache hit.
[2024-05-30 14:41:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 14:41:46] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2024-05-30 14:41:46] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-30 14:41:46] [INFO ] Invariant cache hit.
[2024-05-30 14:41:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-30 14:41:48] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 278/440 variables, 162/243 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/441 variables, and 253 constraints, problems are : Problem set: 0 solved, 274 unsolved in 8222 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 162/162 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 278/440 variables, 162/243 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 274/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/441 variables, and 527 constraints, problems are : Problem set: 0 solved, 274 unsolved in 6832 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 162/162 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 1/1 constraints]
After SMT, in 15124ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 15127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/781 places, 279/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15860 ms. Remains : 162/781 places, 279/781 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/162 stabilizing places and 2/279 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2024-05-30 14:42:02] [INFO ] Invariant cache hit.
[2024-05-30 14:42:02] [INFO ] [Real]Absence check using 80 positive place invariants in 12 ms returned sat
[2024-05-30 14:42:02] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-30 14:42:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 14:42:02] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2024-05-30 14:42:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-30 14:42:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 14:42:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-30 14:42:03] [INFO ] Computed and/alt/rep : 262/815/262 causal constraints (skipped 12 transitions) in 16 ms.
[2024-05-30 14:42:03] [INFO ] Added : 208 causal constraints over 42 iterations in 771 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-02 finished in 90896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(!p0)) U X(G(p1))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 781 transition count 781
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 781 transition count 781
Applied a total of 26 rules in 36 ms. Remains 781 /794 variables (removed 13) and now considering 781/794 (removed 13) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-30 14:42:03] [INFO ] Computed 81 invariants in 4 ms
[2024-05-30 14:42:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-30 14:42:04] [INFO ] Invariant cache hit.
[2024-05-30 14:42:04] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:42:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:42:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:42:21] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:42:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
[2024-05-30 14:42:22] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:42:22] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:42:23] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:42:23] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:42:24] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:42:24] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:42:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 3 ms to minimize.
[2024-05-30 14:42:25] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:42:26] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:42:26] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:42:27] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:42:27] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:42:28] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:42:28] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:42:28] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:42:29] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:42:29] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:42:51] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1562 variables, 780/1663 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:43:03] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 5 ms to minimize.
[2024-05-30 14:43:03] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 4 ms to minimize.
[2024-05-30 14:43:04] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 5 ms to minimize.
[2024-05-30 14:43:04] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1667 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 25/25 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 781/794 places, 781/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 781/794 places, 781/794 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-04 finished in 60931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G((p1||(p2 U p0)))))) U p3))'
Support contains 4 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 793 transition count 577
Reduce places removed 216 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 433 place count 577 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 576 transition count 576
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 434 place count 576 transition count 421
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 753 place count 412 transition count 412
Iterating global reduction 3 with 9 rules applied. Total rules applied 762 place count 412 transition count 412
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 762 place count 412 transition count 405
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 776 place count 405 transition count 405
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1130 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1131 place count 228 transition count 227
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1133 place count 227 transition count 226
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1249 place count 169 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1251 place count 167 transition count 280
Applied a total of 1251 rules in 46 ms. Remains 167 /794 variables (removed 627) and now considering 280/794 (removed 514) transitions.
// Phase 1: matrix 280 rows 167 cols
[2024-05-30 14:43:04] [INFO ] Computed 81 invariants in 1 ms
[2024-05-30 14:43:05] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 14:43:05] [INFO ] Invariant cache hit.
[2024-05-30 14:43:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 14:43:05] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-30 14:43:05] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-30 14:43:05] [INFO ] Invariant cache hit.
[2024-05-30 14:43:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-30 14:43:07] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 279/446 variables, 167/249 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/446 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/447 variables, and 259 constraints, problems are : Problem set: 0 solved, 275 unsolved in 8711 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 167/167 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 279/446 variables, 167/249 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 275/534 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/447 variables, and 534 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7558 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 167/167 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
After SMT, in 16331ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 16333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 167/794 places, 280/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16684 ms. Remains : 167/794 places, 280/794 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p3), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-05 finished in 16910 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 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 793 transition count 576
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 576 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 575 transition count 575
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 436 place count 575 transition count 421
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 754 place count 411 transition count 411
Iterating global reduction 3 with 10 rules applied. Total rules applied 764 place count 411 transition count 411
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 764 place count 411 transition count 403
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 780 place count 403 transition count 403
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1136 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1137 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1139 place count 224 transition count 223
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1255 place count 166 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1257 place count 164 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1258 place count 163 transition count 277
Applied a total of 1258 rules in 50 ms. Remains 163 /794 variables (removed 631) and now considering 277/794 (removed 517) transitions.
// Phase 1: matrix 277 rows 163 cols
[2024-05-30 14:43:21] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:43:21] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 14:43:21] [INFO ] Invariant cache hit.
[2024-05-30 14:43:22] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-30 14:43:22] [INFO ] Redundant transitions in 1 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-30 14:43:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/440 variables, and 243 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5706 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 273/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/440 variables, and 516 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5937 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 11707ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 11709ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/794 places, 277/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12016 ms. Remains : 163/794 places, 277/794 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-06
Product exploration explored 100000 steps with 56 reset in 391 ms.
Product exploration explored 100000 steps with 67 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 22108 steps (5 resets) in 246 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 277/277 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-30 14:43:35] [INFO ] Invariant cache hit.
[2024-05-30 14:43:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 14:43:35] [INFO ] Invariant cache hit.
[2024-05-30 14:43:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-30 14:43:35] [INFO ] Redundant transitions in 0 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-30 14:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/440 variables, and 243 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5768 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 273/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/440 variables, and 516 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 11666ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 11668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11934 ms. Remains : 163/163 places, 277/277 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 16396 steps (4 resets) in 266 ms. (61 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 60 reset in 321 ms.
Product exploration explored 100000 steps with 59 reset in 361 ms.
Built C files in :
/tmp/ltsmin8251977580242920028
[2024-05-30 14:43:48] [INFO ] Computing symmetric may disable matrix : 277 transitions.
[2024-05-30 14:43:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:43:48] [INFO ] Computing symmetric may enable matrix : 277 transitions.
[2024-05-30 14:43:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:43:48] [INFO ] Computing Do-Not-Accords matrix : 277 transitions.
[2024-05-30 14:43:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:43:48] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8251977580242920028
Running compilation step : cd /tmp/ltsmin8251977580242920028;'/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 678 ms.
Running link step : cd /tmp/ltsmin8251977580242920028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8251977580242920028;'/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/stateBased6659398154654117700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 277/277 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-30 14:44:03] [INFO ] Invariant cache hit.
[2024-05-30 14:44:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-30 14:44:03] [INFO ] Invariant cache hit.
[2024-05-30 14:44:04] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-30 14:44:04] [INFO ] Redundant transitions in 1 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-30 14:44:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 0/439 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/440 variables, and 243 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5720 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 276/439 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 273/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/440 variables, and 516 constraints, problems are : Problem set: 0 solved, 273 unsolved in 5745 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 11527ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 11529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11819 ms. Remains : 163/163 places, 277/277 transitions.
Built C files in :
/tmp/ltsmin11373424785820159324
[2024-05-30 14:44:15] [INFO ] Computing symmetric may disable matrix : 277 transitions.
[2024-05-30 14:44:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:44:15] [INFO ] Computing symmetric may enable matrix : 277 transitions.
[2024-05-30 14:44:15] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:44:15] [INFO ] Computing Do-Not-Accords matrix : 277 transitions.
[2024-05-30 14:44:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 14:44:15] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11373424785820159324
Running compilation step : cd /tmp/ltsmin11373424785820159324;'/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 631 ms.
Running link step : cd /tmp/ltsmin11373424785820159324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11373424785820159324;'/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/stateBased16817164848096606233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 14:44:30] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:44:30] [INFO ] Flatten gal took : 18 ms
[2024-05-30 14:44:30] [INFO ] Time to serialize gal into /tmp/LTL2234870431017964107.gal : 5 ms
[2024-05-30 14:44:30] [INFO ] Time to serialize properties into /tmp/LTL4913155375226241317.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/LTL2234870431017964107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15097162111692164109.hoa' '-atoms' '/tmp/LTL4913155375226241317.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...318
Loading property file /tmp/LTL4913155375226241317.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15097162111692164109.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
Detected timeout of ITS tools.
[2024-05-30 14:44:45] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:44:45] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:44:45] [INFO ] Time to serialize gal into /tmp/LTL18366455544166210925.gal : 3 ms
[2024-05-30 14:44:45] [INFO ] Time to serialize properties into /tmp/LTL16390890276107272611.ltl : 13 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/LTL18366455544166210925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16390890276107272611.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("(p361==1)"))||(G("(p335==0)"))))
Formula 0 simplified : G!"(p361==1)" & F!"(p335==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
Detected timeout of ITS tools.
[2024-05-30 14:45:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:45:01] [INFO ] Applying decomposition
[2024-05-30 14:45:01] [INFO ] Flatten gal took : 21 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/graph17364637223044210756.txt' '-o' '/tmp/graph17364637223044210756.bin' '-w' '/tmp/graph17364637223044210756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17364637223044210756.bin' '-l' '-1' '-v' '-w' '/tmp/graph17364637223044210756.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:45:01] [INFO ] Decomposing Gal with order
[2024-05-30 14:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:45:01] [INFO ] Removed a total of 532 redundant transitions.
[2024-05-30 14:45:01] [INFO ] Flatten gal took : 60 ms
[2024-05-30 14:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 16 ms.
[2024-05-30 14:45:01] [INFO ] Time to serialize gal into /tmp/LTL14117828535446156531.gal : 3 ms
[2024-05-30 14:45:01] [INFO ] Time to serialize properties into /tmp/LTL2464001666376243315.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/LTL14117828535446156531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2464001666376243315.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("(i2.i1.u28.p361==1)"))||(G("(i2.i1.u26.p335==0)"))))
Formula 0 simplified : G!"(i2.i1.u28.p361==1)" & F!"(i2.i1.u26.p335==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.10526e+15 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
10 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.131631,21300,1,0,10188,66,876,29240,98,139,11047
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-020B-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-020B-LTLFireability-06 finished in 99650 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(X((p1 U (p2||G(p1))))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 32 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:45:01] [INFO ] Computed 81 invariants in 2 ms
[2024-05-30 14:45:01] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-30 14:45:01] [INFO ] Invariant cache hit.
[2024-05-30 14:45:02] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:45:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:45:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:45:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:45:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:45:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:45:20] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:45:20] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:45:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:45:21] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:45:21] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:45:22] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:45:22] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:45:23] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:45:23] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:45:24] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:45:24] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:45:25] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:45:25] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:45:26] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:45:26] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:45:27] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:45:48] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/885 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 782/1667 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:46:00] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 4 ms to minimize.
[2024-05-30 14:46:01] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 4 ms to minimize.
[2024-05-30 14:46:01] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 5 ms to minimize.
[2024-05-30 14:46:01] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 4 ms to minimize.
[2024-05-30 14:46:01] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-30 14:46:01] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 4 ms to minimize.
[2024-05-30 14:46:02] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1566 variables, and 1674 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 28/28 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60898 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-07
Stuttering criterion allowed to conclude after 54521 steps with 0 reset in 119 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-07 finished in 61191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p0&&G(p1)) U ((!p0&&X(p2)&&G(p1))||G((!p0&&G(p1)))))&&p3))))'
Support contains 5 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 30 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:46:02] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:46:02] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-30 14:46:02] [INFO ] Invariant cache hit.
[2024-05-30 14:46:03] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:46:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:46:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:46:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:46:20] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:46:21] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:46:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:46:22] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:46:22] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:46:22] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:46:23] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:46:23] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:46:24] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:46:24] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:46:25] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:46:25] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:46:26] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:46:26] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:46:27] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:46:27] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:46:28] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:46:28] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:46:50] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:46:50] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/886 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 782/1668 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:47:03] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 5 ms to minimize.
[2024-05-30 14:47:03] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1566 variables, and 1670 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 24/24 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60821 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p3) p0), (OR (NOT p1) (NOT p3) p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-08
Product exploration explored 100000 steps with 17 reset in 249 ms.
Stack based approach found an accepted trace after 18778 steps with 0 reset with depth 18779 and stack size 17463 in 58 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-08 finished in 61400 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))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 793 transition count 575
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 575 transition count 575
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 436 place count 575 transition count 419
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 748 place count 419 transition count 419
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 759 place count 408 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 770 place count 408 transition count 408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 770 place count 408 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 786 place count 400 transition count 400
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 1136 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1137 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1257 place count 165 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1259 place count 163 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1260 place count 162 transition count 279
Applied a total of 1260 rules in 44 ms. Remains 162 /794 variables (removed 632) and now considering 279/794 (removed 515) transitions.
// Phase 1: matrix 279 rows 162 cols
[2024-05-30 14:47:04] [INFO ] Computed 80 invariants in 0 ms
[2024-05-30 14:47:04] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-30 14:47:04] [INFO ] Invariant cache hit.
[2024-05-30 14:47:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 14:47:04] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-30 14:47:04] [INFO ] Redundant transitions in 1 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-30 14:47:04] [INFO ] Invariant cache hit.
[2024-05-30 14:47:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-30 14:47:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 278/440 variables, 162/243 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/441 variables, and 253 constraints, problems are : Problem set: 0 solved, 274 unsolved in 6779 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 162/162 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 278/440 variables, 162/243 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 274/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/441 variables, and 527 constraints, problems are : Problem set: 0 solved, 274 unsolved in 7777 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 162/162 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 1/1 constraints]
After SMT, in 14624ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 14626ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/794 places, 279/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15048 ms. Remains : 162/794 places, 279/794 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-10 finished in 15097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 782 transition count 782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 782 transition count 782
Applied a total of 24 rules in 38 ms. Remains 782 /794 variables (removed 12) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-30 14:47:19] [INFO ] Computed 81 invariants in 7 ms
[2024-05-30 14:47:19] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-30 14:47:19] [INFO ] Invariant cache hit.
[2024-05-30 14:47:19] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-30 14:47:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:47:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:47:37] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:47:37] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:47:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:47:38] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:47:39] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:47:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:47:40] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:47:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:47:41] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:47:41] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:47:42] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:47:42] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2024-05-30 14:47:43] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:47:43] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:47:44] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:47:44] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:47:44] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:47:45] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:47:45] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:48:06] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 1 ms to minimize.
[2024-05-30 14:48:06] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:48:06] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/886 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1667 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:48:18] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 4 ms to minimize.
[2024-05-30 14:48:19] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 5 ms to minimize.
[2024-05-30 14:48:19] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 5 ms to minimize.
[2024-05-30 14:48:19] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
SMT process timed out in 60204ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 782/794 places, 782/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60879 ms. Remains : 782/794 places, 782/794 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-11
Stuttering criterion allowed to conclude after 36481 steps with 0 reset in 100 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-11 finished in 61062 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||X(F(p1))))))'
Support contains 3 out of 794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 783 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 783 transition count 783
Applied a total of 22 rules in 33 ms. Remains 783 /794 variables (removed 11) and now considering 783/794 (removed 11) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:48:20] [INFO ] Computed 81 invariants in 6 ms
[2024-05-30 14:48:20] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 14:48:20] [INFO ] Invariant cache hit.
[2024-05-30 14:48:20] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:48:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:48:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:48:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:48:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:48:38] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:48:38] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:48:39] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:48:39] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:48:40] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:48:40] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:48:41] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:48:41] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:48:42] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:48:42] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:48:43] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:48:43] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:48:44] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:48:44] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:48:44] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:48:45] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:48:45] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:49:07] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/885 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 782/1667 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:49:19] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 3 ms to minimize.
[2024-05-30 14:49:19] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 4 ms to minimize.
[2024-05-30 14:49:19] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 4 ms to minimize.
[2024-05-30 14:49:20] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 4 ms to minimize.
[2024-05-30 14:49:20] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-30 14:49:21] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 4 ms to minimize.
SMT process timed out in 60244ms, After SMT, problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 783/794 places, 783/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60932 ms. Remains : 783/794 places, 783/794 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-13
Stuttering criterion allowed to conclude after 8776 steps with 0 reset in 22 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-13 finished in 61086 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||G(p1)))))'
Support contains 2 out of 794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 794/794 places, 794/794 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 793 transition count 577
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 577 transition count 577
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 432 place count 577 transition count 421
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 744 place count 421 transition count 421
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 754 place count 411 transition count 411
Iterating global reduction 2 with 10 rules applied. Total rules applied 764 place count 411 transition count 411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 764 place count 411 transition count 404
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 778 place count 404 transition count 404
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1134 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1135 place count 226 transition count 225
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 225 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1253 place count 167 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1255 place count 165 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1256 place count 164 transition count 278
Applied a total of 1256 rules in 46 ms. Remains 164 /794 variables (removed 630) and now considering 278/794 (removed 516) transitions.
// Phase 1: matrix 278 rows 164 cols
[2024-05-30 14:49:21] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:49:21] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-30 14:49:21] [INFO ] Invariant cache hit.
[2024-05-30 14:49:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-30 14:49:21] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-30 14:49:21] [INFO ] Redundant transitions in 0 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-30 14:49:21] [INFO ] Invariant cache hit.
[2024-05-30 14:49:21] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 277/441 variables, 164/244 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/442 variables, and 248 constraints, problems are : Problem set: 0 solved, 273 unsolved in 7446 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 277/441 variables, 164/244 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 273/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/441 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/442 variables, and 521 constraints, problems are : Problem set: 0 solved, 273 unsolved in 6752 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 14263ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 14266ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/794 places, 278/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14619 ms. Remains : 164/794 places, 278/794 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-15 finished in 14714 ms.
All properties solved by simple procedures.
Total runtime 876618 ms.

BK_STOP 1717080576006

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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-171683762300988"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;