Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761100436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPs-PT-010A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 88K 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 ShieldPPPs-PT-010A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243312090

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:01:53] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 12:01:53] [INFO ] Transformed 313 places.
[2024-06-01 12:01:53] [INFO ] Transformed 263 transitions.
[2024-06-01 12:01:53] [INFO ] Found NUPN structural information;
[2024-06-01 12:01:53] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-010A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 36 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-06-01 12:01:53] [INFO ] Computed 111 invariants in 19 ms
[2024-06-01 12:01:54] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 12:01:54] [INFO ] Invariant cache hit.
[2024-06-01 12:01:54] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 12:01:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:02:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18601 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:02:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48742ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48760ms
Finished structural reductions in LTL mode , in 1 iterations and 49506 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 55 out of 313 places after structural reductions.
[2024-06-01 12:02:43] [INFO ] Flatten gal took : 52 ms
[2024-06-01 12:02:43] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:02:43] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 54 out of 313 places (down from 55) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 39130 steps (52 resets) in 1425 ms. (27 steps per ms) remains 0/29 properties
FORMULA ShieldPPPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((G(F(p0))||(X(p1)&&G(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-01 12:02:44] [INFO ] Invariant cache hit.
[2024-06-01 12:02:44] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:02:44] [INFO ] Invariant cache hit.
[2024-06-01 12:02:44] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 12:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:02:49] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:02:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:02:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:02:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:02:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17424 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30023 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47490ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47493ms
Finished structural reductions in LTL mode , in 1 iterations and 47939 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-00
Product exploration explored 100000 steps with 272 reset in 499 ms.
Product exploration explored 100000 steps with 268 reset in 487 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 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 29260 steps (37 resets) in 607 ms. (48 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 10 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 38 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:03:34] [INFO ] Computed 111 invariants in 6 ms
[2024-06-01 12:03:34] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 12:03:34] [INFO ] Invariant cache hit.
[2024-06-01 12:03:35] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-06-01 12:03:35] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:03:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:03:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:03:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:03:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18688 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:04:18] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:04:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48751ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49236 ms. Remains : 311/313 places, 261/263 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 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 37202 steps (49 resets) in 564 ms. (65 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 143 reset in 355 ms.
Product exploration explored 100000 steps with 144 reset in 399 ms.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:04:25] [INFO ] Invariant cache hit.
[2024-06-01 12:04:25] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:04:25] [INFO ] Invariant cache hit.
[2024-06-01 12:04:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-01 12:04:26] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:04:33] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:04:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:04:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19053 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49118ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49563 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-00 finished in 150988 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(p1)&&X(G(p2))&&p0)))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 21 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-06-01 12:05:15] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:05:15] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:05:15] [INFO ] Invariant cache hit.
[2024-06-01 12:05:15] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-06-01 12:05:15] [INFO ] Redundant transitions in 9 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 12:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:05:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:05:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:05:23] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:23] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13526 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:05:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30019 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43578ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44035 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-01
Stuttering criterion allowed to conclude after 743 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-01 finished in 44313 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)||G(F(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 20 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:05:59] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:05:59] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 12:05:59] [INFO ] Invariant cache hit.
[2024-06-01 12:06:00] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-06-01 12:06:00] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:06:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:06:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19395 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:06:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:06:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49448ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49970 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-03
Product exploration explored 100000 steps with 191 reset in 393 ms.
Product exploration explored 100000 steps with 193 reset in 438 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 19736 steps (25 resets) in 171 ms. (114 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:06:51] [INFO ] Invariant cache hit.
[2024-06-01 12:06:51] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:06:51] [INFO ] Invariant cache hit.
[2024-06-01 12:06:51] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-06-01 12:06:51] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:06:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:06:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:07:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:03] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18977 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49031ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49033ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49485 ms. Remains : 311/311 places, 261/261 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 25688 steps (34 resets) in 116 ms. (219 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 191 reset in 373 ms.
Product exploration explored 100000 steps with 189 reset in 459 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:07:42] [INFO ] Invariant cache hit.
[2024-06-01 12:07:42] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:07:42] [INFO ] Invariant cache hit.
[2024-06-01 12:07:42] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-06-01 12:07:42] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:07:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:07:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19344 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:08:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49396ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49399ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49850 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-03 finished in 152566 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)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 311 transition count 261
Applied a total of 2 rules in 18 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:08:32] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:08:32] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 12:08:32] [INFO ] Invariant cache hit.
[2024-06-01 12:08:32] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-06-01 12:08:32] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23507 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 53553ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53980 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-04
Product exploration explored 100000 steps with 138 reset in 381 ms.
Product exploration explored 100000 steps with 139 reset in 427 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 31814 steps (42 resets) in 138 ms. (228 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:09:27] [INFO ] Invariant cache hit.
[2024-06-01 12:09:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 12:09:27] [INFO ] Invariant cache hit.
[2024-06-01 12:09:27] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-06-01 12:09:27] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:09:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:09:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:09:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:09:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23400 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:09:58] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:09:58] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 53443ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 53446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53866 ms. Remains : 311/311 places, 261/261 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 27170 steps (36 resets) in 126 ms. (213 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 139 reset in 366 ms.
Product exploration explored 100000 steps with 139 reset in 414 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:10:22] [INFO ] Invariant cache hit.
[2024-06-01 12:10:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:10:22] [INFO ] Invariant cache hit.
[2024-06-01 12:10:22] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-06-01 12:10:22] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:10:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/311 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:10:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:39] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:10:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/572 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 741 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24381 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 109/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/572 variables, 311/741 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 260/1001 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:10:54] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:54] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 1004 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 54426ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54428ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54874 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-04 finished in 165310 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)||(!p0&&G(F(!p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 311 transition count 261
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 310 transition count 260
Applied a total of 4 rules in 21 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-06-01 12:11:17] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:11:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 12:11:17] [INFO ] Invariant cache hit.
[2024-06-01 12:11:17] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-06-01 12:11:17] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 12:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13770 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:11:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43818ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43821ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44276 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 217 ms :[p0, true, (AND p0 p1), p1, p1]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-05
Product exploration explored 100000 steps with 191 reset in 370 ms.
Product exploration explored 100000 steps with 184 reset in 416 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 (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p1, p1]
RANDOM walk for 6377 steps (6 resets) in 43 ms. (144 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), p1, p1]
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 13 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-01 12:12:03] [INFO ] Invariant cache hit.
[2024-06-01 12:12:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 12:12:03] [INFO ] Invariant cache hit.
[2024-06-01 12:12:03] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-01 12:12:03] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 12:12:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:12:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:11] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:12:11] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:12:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:12:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13720 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:12:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30018 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43766ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44194 ms. Remains : 310/310 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p0 p1), p1, p1]
RANDOM walk for 11172 steps (13 resets) in 58 ms. (189 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 p1), p1, p1]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 p1), p1, p1]
Product exploration explored 100000 steps with 197 reset in 357 ms.
Product exploration explored 100000 steps with 184 reset in 409 ms.
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-01 12:12:49] [INFO ] Invariant cache hit.
[2024-06-01 12:12:49] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 12:12:49] [INFO ] Invariant cache hit.
[2024-06-01 12:12:49] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-06-01 12:12:49] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 12:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:12:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:12:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:12:57] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13854 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43910ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43913ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44415 ms. Remains : 310/310 places, 260/260 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-05 finished in 136130 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)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 10 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:13:33] [INFO ] Computed 111 invariants in 3 ms
[2024-06-01 12:13:33] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 12:13:33] [INFO ] Invariant cache hit.
[2024-06-01 12:13:34] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-01 12:13:34] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:13:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:13:45] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
[2024-06-01 12:13:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18486 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:14:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:14:19] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48534ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49057 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-06
Product exploration explored 100000 steps with 142 reset in 355 ms.
Product exploration explored 100000 steps with 141 reset in 402 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 216 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:14:23] [INFO ] Invariant cache hit.
[2024-06-01 12:14:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:14:23] [INFO ] Invariant cache hit.
[2024-06-01 12:14:24] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-06-01 12:14:24] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:14:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:14:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:14:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:14:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19066 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:15:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30025 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49131ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49598 ms. Remains : 311/311 places, 261/261 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 142 reset in 353 ms.
Product exploration explored 100000 steps with 140 reset in 443 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:15:14] [INFO ] Invariant cache hit.
[2024-06-01 12:15:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 12:15:14] [INFO ] Invariant cache hit.
[2024-06-01 12:15:15] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-06-01 12:15:15] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:15:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:15:27] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18606 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:15:59] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:16:00] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30033 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48670ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49161 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-06 finished in 150165 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)||G(p1))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 16 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-06-01 12:16:03] [INFO ] Invariant cache hit.
[2024-06-01 12:16:03] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:16:03] [INFO ] Invariant cache hit.
[2024-06-01 12:16:04] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-06-01 12:16:04] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:16:11] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:16:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:16:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18533 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:16:48] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:16:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48582ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49088 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-08
Product exploration explored 100000 steps with 141 reset in 382 ms.
Product exploration explored 100000 steps with 141 reset in 428 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 p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 108 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 5049 steps (5 resets) in 26 ms. (187 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 265 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:16:54] [INFO ] Invariant cache hit.
[2024-06-01 12:16:54] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 12:16:54] [INFO ] Invariant cache hit.
[2024-06-01 12:16:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-06-01 12:16:54] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:16:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:17:01] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:17:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:17:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18886 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:17:39] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:17:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48930ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49477 ms. Remains : 311/311 places, 261/261 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 101 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4126 steps (3 resets) in 33 ms. (121 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 309 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 142 reset in 385 ms.
Product exploration explored 100000 steps with 141 reset in 429 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:17:45] [INFO ] Invariant cache hit.
[2024-06-01 12:17:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:17:45] [INFO ] Invariant cache hit.
[2024-06-01 12:17:45] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-06-01 12:17:45] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:17:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:17:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:17:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18744 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:18:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:18:32] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48788ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49239 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-08 finished in 150621 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((X(X(p0))||F((X(p1)&&F(p2))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-06-01 12:18:34] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:18:34] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 12:18:34] [INFO ] Invariant cache hit.
[2024-06-01 12:18:34] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 12:18:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:18:40] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:18:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:18:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:18:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:18:46] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18174 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:19:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:19:11] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1009 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 10/10 constraints]
After SMT, in 48221ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48224ms
Finished structural reductions in LTL mode , in 1 iterations and 48656 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 447 reset in 348 ms.
Stuttering criterion allowed to conclude after 95311 steps with 424 reset in 382 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-09 finished in 49843 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 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 22 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:19:24] [INFO ] Computed 111 invariants in 3 ms
[2024-06-01 12:19:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 12:19:24] [INFO ] Invariant cache hit.
[2024-06-01 12:19:24] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-06-01 12:19:24] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:19:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:19:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19013 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:20:09] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:20:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30024 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49071ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49530 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-10
Product exploration explored 100000 steps with 2180 reset in 278 ms.
Product exploration explored 100000 steps with 2146 reset in 319 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 p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 227 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 132 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 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:20:14] [INFO ] Invariant cache hit.
[2024-06-01 12:20:15] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 12:20:15] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-01 12:20:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:20:15] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 12:20:15] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-06-01 12:20:15] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 12:20:18] [INFO ] Added : 259 causal constraints over 56 iterations in 3041 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:20:18] [INFO ] Invariant cache hit.
[2024-06-01 12:20:19] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 12:20:19] [INFO ] Invariant cache hit.
[2024-06-01 12:20:19] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-06-01 12:20:19] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:20:26] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:20:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:20:31] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18701 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:21:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48751ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48754ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49198 ms. Remains : 311/311 places, 261/261 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 211 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 98 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 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:21:08] [INFO ] Invariant cache hit.
[2024-06-01 12:21:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-06-01 12:21:08] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-06-01 12:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:21:09] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-06-01 12:21:09] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-06-01 12:21:09] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 12:21:12] [INFO ] Added : 259 causal constraints over 56 iterations in 2949 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2164 reset in 276 ms.
Product exploration explored 100000 steps with 2161 reset in 316 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:21:13] [INFO ] Invariant cache hit.
[2024-06-01 12:21:13] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 12:21:13] [INFO ] Invariant cache hit.
[2024-06-01 12:21:13] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-06-01 12:21:13] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:21:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:21:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18851 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:21:58] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:22:00] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48902ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49381 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-10 finished in 158319 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)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-06-01 12:22:02] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 12:22:02] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:22:02] [INFO ] Invariant cache hit.
[2024-06-01 12:22:02] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 12:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:22:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18378 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:22:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30016 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48428ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48431ms
Finished structural reductions in LTL mode , in 1 iterations and 48864 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-12
Product exploration explored 100000 steps with 690 reset in 347 ms.
Product exploration explored 100000 steps with 725 reset in 386 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 p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1213 steps (0 resets) in 13 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 77 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 91 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:22:52] [INFO ] Invariant cache hit.
[2024-06-01 12:22:52] [INFO ] [Real]Absence check using 111 positive place invariants in 38 ms returned sat
[2024-06-01 12:22:53] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-06-01 12:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:22:53] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 12:22:53] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-06-01 12:22:53] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 12:22:57] [INFO ] Added : 260 causal constraints over 55 iterations in 3877 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 14 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:22:57] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:22:57] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 12:22:57] [INFO ] Invariant cache hit.
[2024-06-01 12:22:58] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-06-01 12:22:58] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:22:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:23:05] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:23:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:23:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18939 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:23:42] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:23:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49000ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49455 ms. Remains : 311/313 places, 261/263 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 63 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1288 steps (0 resets) in 15 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 88 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 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2024-06-01 12:23:47] [INFO ] Invariant cache hit.
[2024-06-01 12:23:47] [INFO ] [Real]Absence check using 111 positive place invariants in 39 ms returned sat
[2024-06-01 12:23:47] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-06-01 12:23:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:23:48] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 12:23:48] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-06-01 12:23:48] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 12:23:51] [INFO ] Added : 247 causal constraints over 53 iterations in 2738 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 358 reset in 334 ms.
Product exploration explored 100000 steps with 354 reset in 378 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:23:51] [INFO ] Invariant cache hit.
[2024-06-01 12:23:52] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:23:52] [INFO ] Invariant cache hit.
[2024-06-01 12:23:52] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-06-01 12:23:52] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18889 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:24:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48944ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48946ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49413 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-12 finished in 158855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-06-01 12:24:41] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 12:24:41] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 12:24:41] [INFO ] Invariant cache hit.
[2024-06-01 12:24:41] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 12:24:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:24:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:24:53] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17895 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 12:25:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47943ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47946ms
Finished structural reductions in LTL mode , in 1 iterations and 48355 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-13
Stuttering criterion allowed to conclude after 29024 steps with 89 reset in 106 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-13 finished in 48567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G((F(p2)&&F(p3)))))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 19 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-06-01 12:25:29] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:25:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:25:30] [INFO ] Invariant cache hit.
[2024-06-01 12:25:30] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-06-01 12:25:30] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:25:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:25:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18926 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48976ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48978ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49424 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-14
Product exploration explored 100000 steps with 373 reset in 345 ms.
Product exploration explored 100000 steps with 371 reset in 393 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 p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 185 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 2502 steps (1 resets) in 20 ms. (119 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p0), (F (NOT (OR p0 (NOT p1) p3))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 315 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2024-06-01 12:26:21] [INFO ] Invariant cache hit.
[2024-06-01 12:26:21] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-06-01 12:26:21] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-06-01 12:26:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:26:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 12:26:22] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-01 12:26:22] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:26:24] [INFO ] Added : 257 causal constraints over 53 iterations in 2444 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2024-06-01 12:26:24] [INFO ] Invariant cache hit.
[2024-06-01 12:26:24] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-06-01 12:26:25] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-06-01 12:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:26:25] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-06-01 12:26:25] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-06-01 12:26:25] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 12:26:28] [INFO ] Added : 235 causal constraints over 47 iterations in 3120 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:26:28] [INFO ] Invariant cache hit.
[2024-06-01 12:26:28] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:26:28] [INFO ] Invariant cache hit.
[2024-06-01 12:26:29] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-06-01 12:26:29] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:26:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:26:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19006 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49057ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49485 ms. Remains : 311/311 places, 261/261 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) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 1777 steps (0 resets) in 24 ms. (71 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p0), (F (NOT (OR p0 (NOT p1) p3))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 362 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2024-06-01 12:27:19] [INFO ] Invariant cache hit.
[2024-06-01 12:27:19] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-06-01 12:27:19] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-01 12:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:27:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-06-01 12:27:19] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2024-06-01 12:27:20] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 12:27:22] [INFO ] Added : 257 causal constraints over 53 iterations in 2515 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2024-06-01 12:27:22] [INFO ] Invariant cache hit.
[2024-06-01 12:27:22] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-06-01 12:27:22] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-01 12:27:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:27:23] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 12:27:23] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-06-01 12:27:23] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 12:27:26] [INFO ] Added : 235 causal constraints over 47 iterations in 3139 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 369 reset in 378 ms.
Product exploration explored 100000 steps with 378 reset in 416 ms.
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-06-01 12:27:27] [INFO ] Invariant cache hit.
[2024-06-01 12:27:27] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:27:27] [INFO ] Invariant cache hit.
[2024-06-01 12:27:27] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-06-01 12:27:27] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 12:27:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18605 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 12:28:11] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:28:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48656ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48658ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49082 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-14 finished in 166690 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&&(p1||F(p2))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 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 312 transition count 262
Applied a total of 2 rules in 11 ms. Remains 312 /313 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 312 cols
[2024-06-01 12:28:16] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 12:28:16] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:28:16] [INFO ] Invariant cache hit.
[2024-06-01 12:28:17] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-01 12:28:17] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 12:28:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:28:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:28:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:28:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:28:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:28:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:28:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:28:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:28:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:28:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:28:36] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:28:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:28:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 27366 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:29:12] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30022 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 57417ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 57420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 262/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57852 ms. Remains : 312/313 places, 262/263 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-15
Product exploration explored 100000 steps with 7141 reset in 332 ms.
Product exploration explored 100000 steps with 7539 reset in 368 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 p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (55 resets) in 171 ms. (232 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
[2024-06-01 12:29:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 302/312 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 302/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 735 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 4/574 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Domain max(s): 4/312 constraints, Positive P Invariants (semi-flows): 0/111 constraints, State Equation: 0/312 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (AND (OR p2 p0) (OR p2 p1)))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 289 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:29:16] [INFO ] Invariant cache hit.
[2024-06-01 12:29:16] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:29:16] [INFO ] Invariant cache hit.
[2024-06-01 12:29:16] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-01 12:29:16] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 12:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:29:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:29:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:29:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 4 ms to minimize.
[2024-06-01 12:29:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:29:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 27076 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:30:10] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 57123ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 57127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57541 ms. Remains : 312/312 places, 262/262 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 p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 7330 reset in 305 ms.
Product exploration explored 100000 steps with 7608 reset in 349 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 12:30:15] [INFO ] Invariant cache hit.
[2024-06-01 12:30:15] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 12:30:15] [INFO ] Invariant cache hit.
[2024-06-01 12:30:15] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-01 12:30:15] [INFO ] Redundant transitions in 0 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 12:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:30:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:30:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/574 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:30:27] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:30:28] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:30:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:30:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/574 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:30:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 748 constraints, problems are : Problem set: 0 solved, 261 unsolved in 26602 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 311/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 111/422 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/748 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 261/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 12:31:09] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 1010 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints]
After SMT, in 56654ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 56656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57114 ms. Remains : 312/312 places, 262/262 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-15 finished in 175759 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(F(p0))||(X(p1)&&G(p2)))))'
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)||G(F(p1)))))'
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)))'
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)||(!p0&&G(F(!p1)))))'
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)))'
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)||G(p1))))'
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)))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G((F(p2)&&F(p3)))))))'
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&&(p1||F(p2))))))'
[2024-06-01 12:31:13] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:31:13] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:31:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 263 transitions and 1006 arcs took 3 ms.
Total runtime 1760298 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-010A-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-03
FORMULA ShieldPPPs-PT-010A-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-010A-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-010A-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-08
FORMULA ShieldPPPs-PT-010A-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-12
FORMULA ShieldPPPs-PT-010A-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-010A-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717246759842

--------------------
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
mcc2024
ltl formula name ShieldPPPs-PT-010A-LTLFireability-00
ltl formula formula --ltl=/tmp/3247/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 315 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 359 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~584 levels ~10000 states ~38908 transitions
pnml2lts-mc( 3/ 4): ~584 levels ~20000 states ~82868 transitions
pnml2lts-mc( 3/ 4): ~584 levels ~40000 states ~182548 transitions
pnml2lts-mc( 2/ 4): ~558 levels ~80000 states ~397240 transitions
pnml2lts-mc( 2/ 4): ~558 levels ~160000 states ~833692 transitions
pnml2lts-mc( 2/ 4): ~558 levels ~320000 states ~1785780 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~640000 states ~3108796 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~1280000 states ~6859564 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~2560000 states ~14696264 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~5120000 states ~31488476 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~10240000 states ~62494472 transitions
pnml2lts-mc( 0/ 4): ~792 levels ~20480000 states ~130077088 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33535130
pnml2lts-mc( 0/ 4): unique states count: 33537578
pnml2lts-mc( 0/ 4): unique transitions count: 240130661
pnml2lts-mc( 0/ 4): - self-loop count: 23064
pnml2lts-mc( 0/ 4): - claim dead count: 206553222
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33537592
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2585
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33537592 states 240130690 transitions, fanout: 7.160
pnml2lts-mc( 0/ 4): Total exploration time 177.500 sec (177.500 sec minimum, 177.500 sec on average)
pnml2lts-mc( 0/ 4): States per second: 188944, Transitions per second: 1352849
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 270.2MB, 8.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 270.2MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-03
ltl formula formula --ltl=/tmp/3247/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 278 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~635 levels ~10000 states ~46496 transitions
pnml2lts-mc( 0/ 4): ~635 levels ~20000 states ~85764 transitions
pnml2lts-mc( 0/ 4): ~635 levels ~40000 states ~187740 transitions
pnml2lts-mc( 2/ 4): ~629 levels ~80000 states ~263320 transitions
pnml2lts-mc( 2/ 4): ~629 levels ~160000 states ~554092 transitions
pnml2lts-mc( 2/ 4): ~629 levels ~320000 states ~1191552 transitions
pnml2lts-mc( 2/ 4): ~629 levels ~640000 states ~2581388 transitions
pnml2lts-mc( 2/ 4): ~629 levels ~1280000 states ~5222996 transitions
pnml2lts-mc( 2/ 4): ~639 levels ~2560000 states ~11640388 transitions
pnml2lts-mc( 2/ 4): ~641 levels ~5120000 states ~23714776 transitions
pnml2lts-mc( 2/ 4): ~645 levels ~10240000 states ~46797860 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18459426
pnml2lts-mc( 0/ 4): unique states count: 18462026
pnml2lts-mc( 0/ 4): unique transitions count: 123952744
pnml2lts-mc( 0/ 4): - self-loop count: 6519
pnml2lts-mc( 0/ 4): - claim dead count: 105467423
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18462042
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2688
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18462042 states 123952775 transitions, fanout: 6.714
pnml2lts-mc( 0/ 4): Total exploration time 109.460 sec (109.460 sec minimum, 109.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168665, Transitions per second: 1132402
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 205.0MB, 11.6 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 55.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 205.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-04
ltl formula formula --ltl=/tmp/3247/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 303 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~597 levels ~10000 states ~114800 transitions
pnml2lts-mc( 2/ 4): ~640 levels ~20000 states ~178560 transitions
pnml2lts-mc( 2/ 4): ~640 levels ~40000 states ~359752 transitions
pnml2lts-mc( 2/ 4): ~640 levels ~80000 states ~728160 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~160000 states ~1438280 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~320000 states ~3161392 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~640000 states ~6541616 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~1280000 states ~13905608 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~2560000 states ~29304400 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~5120000 states ~60665688 transitions
pnml2lts-mc( 0/ 4): ~1272 levels ~10240000 states ~148049152 transitions
pnml2lts-mc( 2/ 4): ~640 levels ~20480000 states ~291181096 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33530200
pnml2lts-mc( 0/ 4): unique states count: 33533354
pnml2lts-mc( 0/ 4): unique transitions count: 555321172
pnml2lts-mc( 0/ 4): - self-loop count: 70811
pnml2lts-mc( 0/ 4): - claim dead count: 521647517
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33533368
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3269
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33533368 states 555321243 transitions, fanout: 16.560
pnml2lts-mc( 0/ 4): Total exploration time 246.170 sec (246.080 sec minimum, 246.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 136220, Transitions per second: 2255844
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 307.7MB, 9.6 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/80.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 307.7MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-05
ltl formula formula --ltl=/tmp/3247/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 315 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 278 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~586 levels ~10000 states ~52816 transitions
pnml2lts-mc( 1/ 4): ~615 levels ~20000 states ~94576 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~40000 states ~161548 transitions
pnml2lts-mc( 2/ 4): ~681 levels ~80000 states ~343080 transitions
pnml2lts-mc( 2/ 4): ~681 levels ~160000 states ~706464 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~320000 states ~1481956 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~640000 states ~3293152 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~1280000 states ~7310980 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~2560000 states ~15549100 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~5120000 states ~31203956 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~10240000 states ~70279984 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~20480000 states ~141638112 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33531696
pnml2lts-mc( 0/ 4): unique states count: 33534322
pnml2lts-mc( 0/ 4): unique transitions count: 238627943
pnml2lts-mc( 0/ 4): - self-loop count: 7393
pnml2lts-mc( 0/ 4): - claim dead count: 205062382
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33534339
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2734
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33534339 states 238628014 transitions, fanout: 7.116
pnml2lts-mc( 0/ 4): Total exploration time 190.880 sec (190.870 sec minimum, 190.872 sec on average)
pnml2lts-mc( 0/ 4): States per second: 175683, Transitions per second: 1250147
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 272.8MB, 8.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/26.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 272.8MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-06
ltl formula formula --ltl=/tmp/3247/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 275 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~639 levels ~10000 states ~53968 transitions
pnml2lts-mc( 3/ 4): ~639 levels ~20000 states ~105064 transitions
pnml2lts-mc( 1/ 4): ~695 levels ~40000 states ~168464 transitions
pnml2lts-mc( 3/ 4): ~639 levels ~80000 states ~459332 transitions
pnml2lts-mc( 1/ 4): ~695 levels ~160000 states ~828660 transitions
pnml2lts-mc( 3/ 4): ~643 levels ~320000 states ~2105444 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~640000 states ~3606388 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~1280000 states ~7714148 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~2560000 states ~16422768 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~5120000 states ~34847864 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~10240000 states ~71779208 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~20480000 states ~157713988 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33533437
pnml2lts-mc( 0/ 4): unique states count: 33536135
pnml2lts-mc( 0/ 4): unique transitions count: 321646248
pnml2lts-mc( 0/ 4): - self-loop count: 21892
pnml2lts-mc( 0/ 4): - claim dead count: 288068036
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33536156
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2812
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33536156 states 321646293 transitions, fanout: 9.591
pnml2lts-mc( 0/ 4): Total exploration time 187.320 sec (187.300 sec minimum, 187.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 179031, Transitions per second: 1717095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 275.9MB, 8.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/31.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 275.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-08
ltl formula formula --ltl=/tmp/3247/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 286 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~695 levels ~10000 states ~48848 transitions
pnml2lts-mc( 1/ 4): ~695 levels ~20000 states ~95304 transitions
pnml2lts-mc( 1/ 4): ~695 levels ~40000 states ~190848 transitions
pnml2lts-mc( 2/ 4): ~775 levels ~80000 states ~358908 transitions
pnml2lts-mc( 2/ 4): ~780 levels ~160000 states ~728980 transitions
pnml2lts-mc( 2/ 4): ~781 levels ~320000 states ~1553260 transitions
pnml2lts-mc( 2/ 4): ~781 levels ~640000 states ~3146384 transitions
pnml2lts-mc( 3/ 4): ~676 levels ~1280000 states ~7837124 transitions
pnml2lts-mc( 1/ 4): ~714 levels ~2560000 states ~19518072 transitions
pnml2lts-mc( 1/ 4): ~728 levels ~5120000 states ~40369600 transitions
pnml2lts-mc( 1/ 4): ~728 levels ~10240000 states ~78001056 transitions
pnml2lts-mc( 1/ 4): ~728 levels ~20480000 states ~152546088 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31685900
pnml2lts-mc( 0/ 4): unique states count: 31688616
pnml2lts-mc( 0/ 4): unique transitions count: 258808170
pnml2lts-mc( 0/ 4): - self-loop count: 13689
pnml2lts-mc( 0/ 4): - claim dead count: 227080828
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 31688630
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2845
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31688630 states 258808198 transitions, fanout: 8.167
pnml2lts-mc( 0/ 4): Total exploration time 170.100 sec (170.090 sec minimum, 170.092 sec on average)
pnml2lts-mc( 0/ 4): States per second: 186294, Transitions per second: 1521506
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.9MB, 10.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 94.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-10
ltl formula formula --ltl=/tmp/3247/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 315 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 287 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~454 levels ~10000 states ~27312 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~20000 states ~58252 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~40000 states ~109560 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~80000 states ~226372 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~160000 states ~463412 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~320000 states ~986584 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~640000 states ~1964012 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~1280000 states ~4232428 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~2560000 states ~8640104 transitions
pnml2lts-mc( 3/ 4): ~527 levels ~5120000 states ~17917920 transitions
pnml2lts-mc( 2/ 4): ~489 levels ~10240000 states ~36912176 transitions
pnml2lts-mc( 2/ 4): ~489 levels ~20480000 states ~77469028 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33539334
pnml2lts-mc( 0/ 4): unique states count: 33541266
pnml2lts-mc( 0/ 4): unique transitions count: 133527775
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 99973370
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33541294
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2048
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33541294 states 133527846 transitions, fanout: 3.981
pnml2lts-mc( 0/ 4): Total exploration time 185.490 sec (185.450 sec minimum, 185.465 sec on average)
pnml2lts-mc( 0/ 4): States per second: 180825, Transitions per second: 719865
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 279.1MB, 8.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/36.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 279.1MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-12
ltl formula formula --ltl=/tmp/3247/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 315 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~492 levels ~10000 states ~30900 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~20000 states ~58784 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~40000 states ~115344 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~80000 states ~234392 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~160000 states ~464228 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~320000 states ~994572 transitions
pnml2lts-mc( 0/ 4): ~492 levels ~640000 states ~2092684 transitions
pnml2lts-mc( 0/ 4): ~494 levels ~1280000 states ~4203232 transitions
pnml2lts-mc( 0/ 4): ~494 levels ~2560000 states ~8668472 transitions
pnml2lts-mc( 0/ 4): ~494 levels ~5120000 states ~18884212 transitions
pnml2lts-mc( 0/ 4): ~494 levels ~10240000 states ~39594984 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19209578
pnml2lts-mc( 0/ 4): unique states count: 19211808
pnml2lts-mc( 0/ 4): unique transitions count: 73916180
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 54688632
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19211822
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2345
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19211822 states 73916211 transitions, fanout: 3.847
pnml2lts-mc( 0/ 4): Total exploration time 89.870 sec (89.850 sec minimum, 89.857 sec on average)
pnml2lts-mc( 0/ 4): States per second: 213773, Transitions per second: 822479
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 210.7MB, 11.5 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 57.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 210.7MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-14
ltl formula formula --ltl=/tmp/3247/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_8_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 520 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~454 levels ~10000 states ~31336 transitions
pnml2lts-mc( 3/ 4): ~454 levels ~20000 states ~59940 transitions
pnml2lts-mc( 3/ 4): ~454 levels ~40000 states ~120276 transitions
pnml2lts-mc( 3/ 4): ~454 levels ~80000 states ~251948 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~160000 states ~313096 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~320000 states ~661980 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~640000 states ~1328068 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~1280000 states ~2802500 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~2560000 states ~6536504 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~5120000 states ~12703636 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~10240000 states ~27968784 transitions
pnml2lts-mc( 1/ 4): ~608 levels ~20480000 states ~58319252 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33535845
pnml2lts-mc( 0/ 4): unique states count: 33537936
pnml2lts-mc( 0/ 4): unique transitions count: 110358665
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 76801949
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33537949
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2177
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33537949 states 110358709 transitions, fanout: 3.291
pnml2lts-mc( 0/ 4): Total exploration time 160.160 sec (160.070 sec minimum, 160.103 sec on average)
pnml2lts-mc( 0/ 4): States per second: 209403, Transitions per second: 689053
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 273.9MB, 8.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/27.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 273.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-15
ltl formula formula --ltl=/tmp/3247/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3247/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3247/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3247/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3247/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 314 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 314, there are 419 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~499 levels ~10000 states ~27796 transitions
pnml2lts-mc( 1/ 4): ~499 levels ~20000 states ~48828 transitions
pnml2lts-mc( 1/ 4): ~499 levels ~40000 states ~93404 transitions
pnml2lts-mc( 3/ 4): ~520 levels ~80000 states ~176736 transitions
pnml2lts-mc( 3/ 4): ~520 levels ~160000 states ~347244 transitions
pnml2lts-mc( 3/ 4): ~520 levels ~320000 states ~725608 transitions
pnml2lts-mc( 0/ 4): ~604 levels ~640000 states ~1473064 transitions
pnml2lts-mc( 0/ 4): ~604 levels ~1280000 states ~2996756 transitions
pnml2lts-mc( 0/ 4): ~604 levels ~2560000 states ~6380760 transitions
pnml2lts-mc( 0/ 4): ~604 levels ~5120000 states ~13653560 transitions
pnml2lts-mc( 3/ 4): ~524 levels ~10240000 states ~27426188 transitions
pnml2lts-mc( 3/ 4): ~524 levels ~20480000 states ~56753632 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33534966
pnml2lts-mc( 0/ 4): unique states count: 33537176
pnml2lts-mc( 0/ 4): unique transitions count: 150990067
pnml2lts-mc( 0/ 4): - self-loop count: 47
pnml2lts-mc( 0/ 4): - claim dead count: 117435426
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33537198
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2320
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33537198 states 150990154 transitions, fanout: 4.502
pnml2lts-mc( 0/ 4): Total exploration time 163.680 sec (163.660 sec minimum, 163.667 sec on average)
pnml2lts-mc( 0/ 4): States per second: 204895, Transitions per second: 922472
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 315.1MB, 9.8 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/92.0%
pnml2lts-mc( 0/ 4): Stored 266 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 315.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-010A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761100436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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