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.r355-tall-171683757900052.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 greatspnxred
Input is ShieldIIPs-PT-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 34K 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 ShieldIIPs-PT-004A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716880441026

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:14:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 07:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:14:02] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-28 07:14:02] [INFO ] Transformed 103 places.
[2024-05-28 07:14:02] [INFO ] Transformed 99 transitions.
[2024-05-28 07:14:02] [INFO ] Found NUPN structural information;
[2024-05-28 07:14:02] [INFO ] Parsed PT model containing 103 places and 99 transitions and 438 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-004A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:02] [INFO ] Computed 37 invariants in 10 ms
[2024-05-28 07:14:02] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-28 07:14:02] [INFO ] Invariant cache hit.
[2024-05-28 07:14:02] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:03] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 8 ms to minimize.
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:14:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:14:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:14:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4649 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2843 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7555ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7571ms
Finished structural reductions in LTL mode , in 1 iterations and 7968 ms. Remains : 103/103 places, 99/99 transitions.
Support contains 46 out of 103 places after structural reductions.
[2024-05-28 07:14:10] [INFO ] Flatten gal took : 36 ms
[2024-05-28 07:14:10] [INFO ] Flatten gal took : 14 ms
[2024-05-28 07:14:10] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 3154 steps (10 resets) in 261 ms. (12 steps per ms) remains 0/27 properties
Computed a total of 1 stabilizing places and 1 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' '!((!p0 U G((p1 U p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 25 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:14:11] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:14:11] [INFO ] Implicit Places using invariants in 69 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-00 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
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 0 with 2 rules applied. Total rules applied 5 place count 99 transition count 96
Applied a total of 5 rules in 10 ms. Remains 99 /103 variables (removed 4) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 99 cols
[2024-05-28 07:14:11] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:14:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 07:14:11] [INFO ] Invariant cache hit.
[2024-05-28 07:14:12] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 07:14:12] [INFO ] Redundant transitions in 26 ms returned [90]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 94 sub problems to find dead transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-28 07:14:12] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:14:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:14:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:14:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:14:12] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:14:13] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:14:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:14:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:14:13] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:14:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 243 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2550 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/194 variables, 99/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 94/337 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:14:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-28 07:14:16] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 339 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3660 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 11/11 constraints]
After SMT, in 6234ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/103 places, 95/99 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6489 ms. Remains : 99/103 places, 95/99 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-01
Stuttering criterion allowed to conclude after 10401 steps with 133 reset in 81 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-01 finished in 6680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:18] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:14:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 07:14:18] [INFO ] Invariant cache hit.
[2024-05-28 07:14:18] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:14:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:14:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:14:19] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:20] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4346 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2717 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7088ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7090ms
Finished structural reductions in LTL mode , in 1 iterations and 7280 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-03
Stuttering criterion allowed to conclude after 59904 steps with 567 reset in 169 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-03 finished in 7590 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 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 13 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:14:26] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:14:26] [INFO ] Implicit Places using invariants in 75 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-04
Stuttering criterion allowed to conclude after 353 steps with 1 reset in 2 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-04 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U p1) U (p0 U X(p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:26] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:14:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:14:26] [INFO ] Invariant cache hit.
[2024-05-28 07:14:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:14:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:14:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:14:27] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:28] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4381 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2767 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7166ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7168ms
Finished structural reductions in LTL mode , in 1 iterations and 7348 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true, p0, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 228 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-05 finished in 7704 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) U X(G(!p1))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:14:34] [INFO ] Invariant cache hit.
[2024-05-28 07:14:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 07:14:34] [INFO ] Invariant cache hit.
[2024-05-28 07:14:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:14:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:37] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4360 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2720 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7099ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7102ms
Finished structural reductions in LTL mode , in 1 iterations and 7318 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-06
Product exploration explored 100000 steps with 33297 reset in 222 ms.
Product exploration explored 100000 steps with 33152 reset in 322 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 601 steps (1 resets) in 8 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:14:42] [INFO ] Invariant cache hit.
[2024-05-28 07:14:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 07:14:43] [INFO ] Invariant cache hit.
[2024-05-28 07:14:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4392 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2790 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7203ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7205ms
Finished structural reductions in LTL mode , in 1 iterations and 7380 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 746 steps (2 resets) in 22 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 33264 reset in 166 ms.
Product exploration explored 100000 steps with 33412 reset in 212 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:14:51] [INFO ] Redundant transitions in 21 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:51] [INFO ] Computed 37 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:14:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:14:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:14:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-28 07:14:52] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:14:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:14:53] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:14:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/252 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:14:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:14:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 254 constraints, problems are : Problem set: 1 solved, 97 unsolved in 3343 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 37/138 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 11/151 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/254 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 97/351 constraints. Problems are: Problem set: 1 solved, 97 unsolved
[2024-05-28 07:14:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:14:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 1 solved, 97 unsolved in 4204 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/98 constraints, Known Traps: 13/13 constraints]
After SMT, in 7567ms problems are : Problem set: 1 solved, 97 unsolved
Search for dead transitions found 1 dead transitions in 7571ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 98/99 transitions.
Graph (complete) has 354 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 102 /103 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/103 places, 98/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7627 ms. Remains : 102/103 places, 98/99 transitions.
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:14:59] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:14:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 07:14:59] [INFO ] Invariant cache hit.
[2024-05-28 07:14:59] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4348 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2640 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7004ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7006ms
Finished structural reductions in LTL mode , in 1 iterations and 7177 ms. Remains : 103/103 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-06 finished in 32535 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(G(p0)) U (X(p0)&&(F(p1) U G(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:06] [INFO ] Invariant cache hit.
[2024-05-28 07:15:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:15:06] [INFO ] Invariant cache hit.
[2024-05-28 07:15:06] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:15:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:15:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-28 07:15:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:08] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4172 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2649 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6843ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6844ms
Finished structural reductions in LTL mode , in 1 iterations and 7019 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-07
Stuttering criterion allowed to conclude after 1605 steps with 11 reset in 6 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-07 finished in 7401 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||X(X(F(p1))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:14] [INFO ] Invariant cache hit.
[2024-05-28 07:15:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 07:15:14] [INFO ] Invariant cache hit.
[2024-05-28 07:15:14] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4184 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2680 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6881ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6882ms
Finished structural reductions in LTL mode , in 1 iterations and 7077 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 3421 reset in 173 ms.
Product exploration explored 100000 steps with 3436 reset in 187 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2183 steps (6 resets) in 18 ms. (114 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 07:15:22] [INFO ] Invariant cache hit.
[2024-05-28 07:15:22] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:15:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:15:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:15:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2024-05-28 07:15:22] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-28 07:15:22] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-28 07:15:22] [INFO ] Added : 88 causal constraints over 18 iterations in 239 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:22] [INFO ] Invariant cache hit.
[2024-05-28 07:15:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:15:22] [INFO ] Invariant cache hit.
[2024-05-28 07:15:23] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4327 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2618 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6961ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6963ms
Finished structural reductions in LTL mode , in 1 iterations and 7137 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4531 steps (17 resets) in 24 ms. (181 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 07:15:30] [INFO ] Invariant cache hit.
[2024-05-28 07:15:30] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:15:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-28 07:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:15:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-28 07:15:30] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:15:30] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-28 07:15:31] [INFO ] Added : 65 causal constraints over 14 iterations in 226 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3435 reset in 169 ms.
Product exploration explored 100000 steps with 3414 reset in 189 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:15:31] [INFO ] Redundant transitions in 18 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 103 cols
[2024-05-28 07:15:31] [INFO ] Computed 37 invariants in 0 ms
[2024-05-28 07:15:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/201 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 251 constraints, problems are : Problem set: 1 solved, 96 unsolved in 2823 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 37/138 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/201 variables, 103/248 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/251 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 96/347 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:15:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:15:35] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:15:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 3/350 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:15:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:15:41] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:15:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/201 variables, 3/353 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/201 variables, 1/354 constraints. Problems are: Problem set: 1 solved, 96 unsolved
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/201 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 355 constraints, problems are : Problem set: 1 solved, 96 unsolved in 20840 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 96/97 constraints, Known Traps: 13/13 constraints]
After SMT, in 23685ms problems are : Problem set: 1 solved, 96 unsolved
Search for dead transitions found 1 dead transitions in 23686ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 97/99 transitions.
Graph (complete) has 352 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 102 /103 variables (removed 1) and now considering 97/97 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/103 places, 97/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23727 ms. Remains : 102/103 places, 97/99 transitions.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:15:55] [INFO ] Computed 37 invariants in 0 ms
[2024-05-28 07:15:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:15:55] [INFO ] Invariant cache hit.
[2024-05-28 07:15:55] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:15:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4076 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2681 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6776ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6778ms
Finished structural reductions in LTL mode , in 1 iterations and 6950 ms. Remains : 103/103 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 48461 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((G((X(!p1) U p2))||p0))))'
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:16:02] [INFO ] Invariant cache hit.
[2024-05-28 07:16:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 07:16:02] [INFO ] Invariant cache hit.
[2024-05-28 07:16:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:03] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:16:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:16:03] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:16:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4316 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2705 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7039ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7040ms
Finished structural reductions in LTL mode , in 1 iterations and 7217 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09
Product exploration explored 100000 steps with 786 reset in 209 ms.
Product exploration explored 100000 steps with 783 reset in 229 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 486 steps (1 resets) in 11 ms. (40 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:16:11] [INFO ] Invariant cache hit.
[2024-05-28 07:16:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:16:11] [INFO ] Invariant cache hit.
[2024-05-28 07:16:11] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4378 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2637 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7041ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7042ms
Finished structural reductions in LTL mode , in 1 iterations and 7217 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 211 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 305 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 816 reset in 208 ms.
Product exploration explored 100000 steps with 784 reset in 223 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:16:19] [INFO ] Invariant cache hit.
[2024-05-28 07:16:19] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 07:16:19] [INFO ] Invariant cache hit.
[2024-05-28 07:16:19] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:20] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:16:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:16:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:16:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:21] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4174 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2715 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6915ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6916ms
Finished structural reductions in LTL mode , in 1 iterations and 7097 ms. Remains : 103/103 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 24432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 10 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:16:26] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:16:26] [INFO ] Implicit Places using invariants in 73 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-10
Product exploration explored 100000 steps with 7112 reset in 143 ms.
Product exploration explored 100000 steps with 7103 reset in 155 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:16:27] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:16:27] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:16:27] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-28 07:16:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:16:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:16:28] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:16:28] [INFO ] Computed and/alt/rep : 90/325/90 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-28 07:16:28] [INFO ] Added : 58 causal constraints over 12 iterations in 174 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:16:28] [INFO ] Invariant cache hit.
[2024-05-28 07:16:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:16:28] [INFO ] Invariant cache hit.
[2024-05-28 07:16:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-28 07:16:28] [INFO ] Redundant transitions in 24 ms returned [91]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:16:28] [INFO ] Computed 36 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 245 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2948 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 95/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:32] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 341 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4114 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 10/10 constraints]
After SMT, in 7080ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7081ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7297 ms. Remains : 100/100 places, 96/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-28 07:16:35] [INFO ] Invariant cache hit.
[2024-05-28 07:16:36] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:16:36] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 07:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:16:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-28 07:16:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 07:16:36] [INFO ] Computed and/alt/rep : 90/330/90 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-28 07:16:36] [INFO ] Added : 89 causal constraints over 19 iterations in 238 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7093 reset in 145 ms.
Product exploration explored 100000 steps with 7095 reset in 159 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 07:16:36] [INFO ] Invariant cache hit.
[2024-05-28 07:16:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:16:36] [INFO ] Invariant cache hit.
[2024-05-28 07:16:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-28 07:16:37] [INFO ] Redundant transitions in 19 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-28 07:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 245 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3721 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/196 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 95/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 340 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5810 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
After SMT, in 9547ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9549ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9746 ms. Remains : 100/100 places, 96/96 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-10 finished in 19720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 07:16:46] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:16:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:16:46] [INFO ] Invariant cache hit.
[2024-05-28 07:16:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4150 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2718 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6885ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6886ms
Finished structural reductions in LTL mode , in 1 iterations and 7069 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-11 finished in 7177 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)&&X(p1)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:16:53] [INFO ] Invariant cache hit.
[2024-05-28 07:16:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 07:16:53] [INFO ] Invariant cache hit.
[2024-05-28 07:16:53] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:16:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:16:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4213 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2804 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7044ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7045ms
Finished structural reductions in LTL mode , in 1 iterations and 7224 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-12 finished in 7417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&G(p1)) U (G((X(p0)&&G(p1)))||(X(p0)&&G(p1)&&G((F(!p2)&&F(!p3))))))))'
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:17:01] [INFO ] Invariant cache hit.
[2024-05-28 07:17:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:17:01] [INFO ] Invariant cache hit.
[2024-05-28 07:17:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4371 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2675 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 7079ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7081ms
Finished structural reductions in LTL mode , in 1 iterations and 7250 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3) (AND (NOT p0) p1)), (NOT p1), p2, p3, (OR p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p0) p3))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-13 finished in 7661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(p1)) U p2)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 07:17:08] [INFO ] Invariant cache hit.
[2024-05-28 07:17:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 07:17:08] [INFO ] Invariant cache hit.
[2024-05-28 07:17:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 07:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
[2024-05-28 07:17:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:17:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:17:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:17:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:17:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:17:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:17:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:11] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 07:17:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4278 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 98/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 353 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2694 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 12/12 constraints]
After SMT, in 6994ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6996ms
Finished structural reductions in LTL mode , in 1 iterations and 7162 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-14
Stuttering criterion allowed to conclude after 1608 steps with 29 reset in 5 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-14 finished in 7311 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 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 14 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:17:16] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:17:16] [INFO ] Implicit Places using invariants in 71 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004A-LTLFireability-15 finished in 538 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) U X(G(!p1))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-004A-LTLFireability-06
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
Applied a total of 2 rules in 7 ms. Remains 102 /103 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:17:16] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:17:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 07:17:17] [INFO ] Invariant cache hit.
[2024-05-28 07:17:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 07:17:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:17:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:17:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 249 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3700 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 97/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/200 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:26] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 348 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11990 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 15707ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 15709ms
Starting structural reductions in LI_LTL mode, iteration 1 : 102/103 places, 98/99 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15882 ms. Remains : 102/103 places, 98/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-06
Product exploration explored 100000 steps with 33327 reset in 163 ms.
Product exploration explored 100000 steps with 33412 reset in 171 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 1224 steps (4 resets) in 15 ms. (76 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:17:33] [INFO ] Invariant cache hit.
[2024-05-28 07:17:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 07:17:33] [INFO ] Invariant cache hit.
[2024-05-28 07:17:33] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 07:17:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:17:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:17:34] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:17:34] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:36] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:17:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 249 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3763 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 97/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/200 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 348 constraints, problems are : Problem set: 0 solved, 97 unsolved in 12435 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 16215ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 16216ms
Finished structural reductions in LTL mode , in 1 iterations and 16367 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 516 steps (0 resets) in 11 ms. (43 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 33339 reset in 163 ms.
Product exploration explored 100000 steps with 33155 reset in 172 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:17:51] [INFO ] Redundant transitions in 27 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 07:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:52] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:17:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:17:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:17:52] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:17:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 249 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3776 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 97/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/200 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 348 constraints, problems are : Problem set: 0 solved, 97 unsolved in 12292 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 16083ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 16084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16128 ms. Remains : 102/102 places, 98/98 transitions.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:18:07] [INFO ] Invariant cache hit.
[2024-05-28 07:18:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:18:07] [INFO ] Invariant cache hit.
[2024-05-28 07:18:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 07:18:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:08] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:18:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:18:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:18:08] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:18:10] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 249 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3667 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 37/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/249 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 97/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/200 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:18:17] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 348 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11846 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 15546ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 15547ms
Finished structural reductions in LTL mode , in 1 iterations and 15709 ms. Remains : 102/102 places, 98/98 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-06 finished in 66763 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||X(X(F(p1))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-004A-LTLFireability-08
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
Applied a total of 3 rules in 6 ms. Remains 100 /103 variables (removed 3) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:18:23] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 07:18:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 07:18:23] [INFO ] Invariant cache hit.
[2024-05-28 07:18:23] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3386 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4621 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 8024ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8025ms
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8231 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 3941 reset in 168 ms.
Product exploration explored 100000 steps with 3825 reset in 179 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) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1103 steps (3 resets) in 8 ms. (122 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 07:18:32] [INFO ] Invariant cache hit.
[2024-05-28 07:18:32] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 07:18:33] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-28 07:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:18:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:18:33] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 07:18:33] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 07:18:33] [INFO ] Added : 96 causal constraints over 20 iterations in 277 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:18:33] [INFO ] Invariant cache hit.
[2024-05-28 07:18:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:18:33] [INFO ] Invariant cache hit.
[2024-05-28 07:18:33] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:18:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:18:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:18:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:35] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:35] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3431 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4652 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 8099ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8101ms
Finished structural reductions in LTL mode , in 1 iterations and 8265 ms. Remains : 100/100 places, 97/97 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 p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10140 steps (42 resets) in 43 ms. (230 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 07:18:42] [INFO ] Invariant cache hit.
[2024-05-28 07:18:42] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:18:42] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 07:18:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:18:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-28 07:18:42] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-28 07:18:42] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 07:18:43] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 07:18:43] [INFO ] Added : 96 causal constraints over 22 iterations in 354 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3889 reset in 164 ms.
Product exploration explored 100000 steps with 3911 reset in 175 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:18:43] [INFO ] Redundant transitions in 26 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:18:43] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/196 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:18:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:18:45] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:18:45] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:18:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:46] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 249 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3467 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/196 variables, 100/249 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 95/344 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:18:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:18:48] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/196 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 346 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6304 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 15/15 constraints]
After SMT, in 9800ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9866 ms. Remains : 100/100 places, 96/97 transitions.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:18:53] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:18:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 07:18:53] [INFO ] Invariant cache hit.
[2024-05-28 07:18:53] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:18:54] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-28 07:18:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:18:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/197 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3501 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/197 variables, 100/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 96/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 344 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4507 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 12/12 constraints]
After SMT, in 8020ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8021ms
Finished structural reductions in LTL mode , in 1 iterations and 8177 ms. Remains : 100/100 places, 97/97 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 38306 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((G((X(!p1) U p2))||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-004A-LTLFireability-09
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 9 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 07:19:02] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:19:02] [INFO ] Implicit Places using invariants in 67 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 80 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09
Product exploration explored 100000 steps with 863 reset in 200 ms.
Product exploration explored 100000 steps with 868 reset in 220 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 494 steps (1 resets) in 17 ms. (27 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:19:03] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:19:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:19:03] [INFO ] Invariant cache hit.
[2024-05-28 07:19:03] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:04] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:19:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:19:04] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:19:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:19:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/197 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:08] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 253 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5482 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 96/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 349 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3639 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
After SMT, in 9137ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9138ms
Finished structural reductions in LTL mode , in 1 iterations and 9301 ms. Remains : 100/100 places, 97/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 590 steps (1 resets) in 20 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 843 reset in 204 ms.
Product exploration explored 100000 steps with 832 reset in 221 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 07:19:14] [INFO ] Invariant cache hit.
[2024-05-28 07:19:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 07:19:14] [INFO ] Invariant cache hit.
[2024-05-28 07:19:14] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 07:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:19:15] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:19:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/197 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:19:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 253 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5562 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 36/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 96/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 349 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3605 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
After SMT, in 9183ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9184ms
Finished structural reductions in LTL mode , in 1 iterations and 9352 ms. Remains : 100/100 places, 97/97 transitions.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 21853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 07:19:23] [INFO ] Flatten gal took : 15 ms
[2024-05-28 07:19:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-28 07:19:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 99 transitions and 438 arcs took 5 ms.
Total runtime 321546 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-004A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 103
TRANSITIONS: 99
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3445
MODEL NAME: /home/mcc/execution/410/model
103 places, 99 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ShieldIIPs-PT-004A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPs-PT-004A, 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 r355-tall-171683757900052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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