About the Execution of LTSMin+red for ShieldIIPs-PT-005A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
472.871 | 989729.00 | 2488104.00 | 1552.00 | FFTTTFFFFTFTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760300068.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 ShieldIIPs-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 42K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717223901206
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:38:22] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-06-01 06:38:22] [INFO ] Transformed 128 places.
[2024-06-01 06:38:22] [INFO ] Transformed 123 transitions.
[2024-06-01 06:38:22] [INFO ] Found NUPN structural information;
[2024-06-01 06:38:22] [INFO ] Parsed PT model containing 128 places and 123 transitions and 546 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-005A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 21 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-06-01 06:38:22] [INFO ] Computed 46 invariants in 24 ms
[2024-06-01 06:38:22] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 06:38:22] [INFO ] Invariant cache hit.
[2024-06-01 06:38:23] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 11 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4611 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5624 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 10317ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10332ms
Finished structural reductions in LTL mode , in 1 iterations and 10788 ms. Remains : 128/128 places, 123/123 transitions.
Support contains 43 out of 128 places after structural reductions.
[2024-06-01 06:38:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 06:38:33] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:38:33] [INFO ] Input system was already deterministic with 123 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (133 resets) in 1003 ms. (39 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40004 steps (12 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
[2024-06-01 06:38:34] [INFO ] Invariant cache hit.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 1/251 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 0/128 constraints, Positive P Invariants (semi-flows): 0/46 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
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' '!(F(G(p0)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 127 transition count 122
Applied a total of 2 rules in 22 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-06-01 06:38:34] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:38:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 06:38:34] [INFO ] Invariant cache hit.
[2024-06-01 06:38:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-01 06:38:34] [INFO ] Redundant transitions in 23 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 06:38:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5842 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:48] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22372 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28245ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/128 places, 122/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28504 ms. Remains : 127/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-00
Product exploration explored 100000 steps with 346 reset in 406 ms.
Product exploration explored 100000 steps with 345 reset in 328 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 78 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)]
RANDOM walk for 432 steps (0 resets) in 8 ms. (48 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 102 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 122/122 transitions.
Applied a total of 0 rules in 17 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-06-01 06:39:04] [INFO ] Invariant cache hit.
[2024-06-01 06:39:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 06:39:04] [INFO ] Invariant cache hit.
[2024-06-01 06:39:04] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-01 06:39:04] [INFO ] Redundant transitions in 23 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 06:39:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5818 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:12] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22548 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28392ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28626 ms. Remains : 127/127 places, 122/122 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 65 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 28 ms :[(NOT p0)]
RANDOM walk for 1233 steps (3 resets) in 16 ms. (72 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 95 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 347 reset in 237 ms.
Product exploration explored 100000 steps with 342 reset in 263 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 122/122 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-06-01 06:39:33] [INFO ] Invariant cache hit.
[2024-06-01 06:39:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 06:39:33] [INFO ] Invariant cache hit.
[2024-06-01 06:39:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-01 06:39:33] [INFO ] Redundant transitions in 20 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 06:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5770 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:43] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22870 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28667ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28896 ms. Remains : 127/127 places, 122/122 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-00 finished in 88203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1) U p2)))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 14 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-06-01 06:40:02] [INFO ] Computed 46 invariants in 4 ms
[2024-06-01 06:40:02] [INFO ] Implicit Places using invariants in 73 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-01
Stuttering criterion allowed to conclude after 44345 steps with 395 reset in 137 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-01 finished in 385 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(F(p0))||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 13 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
[2024-06-01 06:40:03] [INFO ] Invariant cache hit.
[2024-06-01 06:40:03] [INFO ] Implicit Places using invariants in 75 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-02
Product exploration explored 100000 steps with 1661 reset in 232 ms.
Product exploration explored 100000 steps with 1617 reset in 255 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 148 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 204 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-06-01 06:40:04] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 06:40:04] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:40:04] [INFO ] Invariant cache hit.
[2024-06-01 06:40:04] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 06:40:04] [INFO ] Redundant transitions in 20 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-06-01 06:40:04] [INFO ] Computed 45 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3880 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 17004 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 20908ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 14 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21136 ms. Remains : 125/125 places, 120/121 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 (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) 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 91 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 183 steps (0 resets) in 9 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 208 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 78 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1654 reset in 221 ms.
Product exploration explored 100000 steps with 1659 reset in 233 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 06:40:26] [INFO ] Invariant cache hit.
[2024-06-01 06:40:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:40:26] [INFO ] Invariant cache hit.
[2024-06-01 06:40:26] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-01 06:40:26] [INFO ] Redundant transitions in 18 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 06:40:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:40:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7482 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5976 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13483ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13484ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13688 ms. Remains : 125/125 places, 120/120 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-02 finished in 37156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 12 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-06-01 06:40:40] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:40:40] [INFO ] Implicit Places using invariants in 67 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-03
Product exploration explored 100000 steps with 16616 reset in 178 ms.
Product exploration explored 100000 steps with 16679 reset in 187 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 121 rows 125 cols
[2024-06-01 06:40:41] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 06:40:41] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:40:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 06:40:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:40:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:40:41] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 06:40:41] [INFO ] Computed and/alt/rep : 112/401/112 causal constraints (skipped 8 transitions) in 9 ms.
[2024-06-01 06:40:41] [INFO ] Added : 85 causal constraints over 17 iterations in 253 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 06:40:41] [INFO ] Invariant cache hit.
[2024-06-01 06:40:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 06:40:41] [INFO ] Invariant cache hit.
[2024-06-01 06:40:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 06:40:41] [INFO ] Redundant transitions in 19 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-06-01 06:40:41] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4017 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16998 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 21045ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 21047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21260 ms. Remains : 125/125 places, 120/121 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:41:03] [INFO ] Invariant cache hit.
[2024-06-01 06:41:03] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:41:03] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 06:41:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:41:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:41:03] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-01 06:41:03] [INFO ] Computed and/alt/rep : 112/406/112 causal constraints (skipped 7 transitions) in 10 ms.
[2024-06-01 06:41:04] [INFO ] Added : 107 causal constraints over 22 iterations in 289 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16616 reset in 180 ms.
Product exploration explored 100000 steps with 16503 reset in 190 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 06:41:04] [INFO ] Invariant cache hit.
[2024-06-01 06:41:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:41:04] [INFO ] Invariant cache hit.
[2024-06-01 06:41:04] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 06:41:04] [INFO ] Redundant transitions in 22 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 06:41:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:08] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7502 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:41:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6022 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13548ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13549ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13761 ms. Remains : 125/125 places, 120/120 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-03 finished in 38028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 127 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 124 transition count 120
Applied a total of 5 rules in 6 ms. Remains 124 /128 variables (removed 4) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-06-01 06:41:18] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 06:41:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 06:41:18] [INFO ] Invariant cache hit.
[2024-06-01 06:41:18] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-01 06:41:18] [INFO ] Redundant transitions in 19 ms returned [112]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 124 cols
[2024-06-01 06:41:18] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:41:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/243 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/243 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:24] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:24] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:41:24] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/243 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 19 (OVERLAPS) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 319 constraints, problems are : Problem set: 0 solved, 118 unsolved in 10277 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 437 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3365 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
After SMT, in 13661ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13663ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 119/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13877 ms. Remains : 124/128 places, 119/123 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-04
Product exploration explored 100000 steps with 872 reset in 219 ms.
Product exploration explored 100000 steps with 876 reset in 236 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 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 7 ms. (31 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 95 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-06-01 06:41:33] [INFO ] Invariant cache hit.
[2024-06-01 06:41:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:41:33] [INFO ] Invariant cache hit.
[2024-06-01 06:41:33] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-01 06:41:33] [INFO ] Redundant transitions in 21 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 06:41:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:41:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:36] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:41:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:36] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6649 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:41:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 17458 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 24123ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 24125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24340 ms. Remains : 124/124 places, 119/119 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 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 383 steps (0 resets) in 6 ms. (54 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 121 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 902 reset in 214 ms.
Product exploration explored 100000 steps with 880 reset in 237 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-06-01 06:41:58] [INFO ] Invariant cache hit.
[2024-06-01 06:41:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 06:41:58] [INFO ] Invariant cache hit.
[2024-06-01 06:41:58] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 06:41:58] [INFO ] Redundant transitions in 18 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 06:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:01] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:42:01] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6478 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 17186 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 23681ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 23683ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23891 ms. Remains : 124/124 places, 119/119 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-04 finished in 64100 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)||X(G(p1))||G(p2)))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-06-01 06:42:22] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:42:22] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 06:42:22] [INFO ] Invariant cache hit.
[2024-06-01 06:42:22] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4101 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5282 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9401ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9402ms
Finished structural reductions in LTL mode , in 1 iterations and 9582 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2284 steps with 7 reset in 10 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-05 finished in 9957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:42:32] [INFO ] Invariant cache hit.
[2024-06-01 06:42:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 06:42:32] [INFO ] Invariant cache hit.
[2024-06-01 06:42:32] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4249 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:42:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5541 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9808ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9810ms
Finished structural reductions in LTL mode , in 1 iterations and 10006 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-06 finished in 10100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 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 127 transition count 122
Applied a total of 2 rules in 12 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-06-01 06:42:42] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:42:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 06:42:42] [INFO ] Invariant cache hit.
[2024-06-01 06:42:42] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 06:42:42] [INFO ] Redundant transitions in 19 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 06:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5774 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/249 variables, 127/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 439 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22331 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 28123ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/128 places, 122/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28343 ms. Remains : 127/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-08
Stuttering criterion allowed to conclude after 354 steps with 1 reset in 3 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-08 finished in 28403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-06-01 06:43:10] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:43:10] [INFO ] Implicit Places using invariants in 75 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-09
Product exploration explored 100000 steps with 1429 reset in 214 ms.
Product exploration explored 100000 steps with 1435 reset in 234 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 249 steps (0 resets) in 4 ms. (49 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 121 rows 125 cols
[2024-06-01 06:43:11] [INFO ] Computed 45 invariants in 0 ms
[2024-06-01 06:43:11] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-06-01 06:43:11] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 06:43:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:11] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-06-01 06:43:11] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 06:43:11] [INFO ] Computed and/alt/rep : 112/401/112 causal constraints (skipped 8 transitions) in 9 ms.
[2024-06-01 06:43:12] [INFO ] Added : 93 causal constraints over 19 iterations in 298 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 06:43:12] [INFO ] Invariant cache hit.
[2024-06-01 06:43:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 06:43:12] [INFO ] Invariant cache hit.
[2024-06-01 06:43:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-01 06:43:12] [INFO ] Redundant transitions in 18 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-06-01 06:43:12] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3917 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 17129 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 21068ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 21069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21272 ms. Remains : 125/125 places, 120/121 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 253 steps (0 resets) in 5 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 06:43:33] [INFO ] Invariant cache hit.
[2024-06-01 06:43:33] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:43:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 06:43:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:43:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-06-01 06:43:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 06:43:34] [INFO ] Computed and/alt/rep : 112/406/112 causal constraints (skipped 7 transitions) in 9 ms.
[2024-06-01 06:43:34] [INFO ] Added : 89 causal constraints over 19 iterations in 314 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1426 reset in 215 ms.
Product exploration explored 100000 steps with 1434 reset in 232 ms.
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 06:43:34] [INFO ] Invariant cache hit.
[2024-06-01 06:43:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 06:43:35] [INFO ] Invariant cache hit.
[2024-06-01 06:43:35] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-01 06:43:35] [INFO ] Redundant transitions in 20 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 06:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:39] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7380 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5731 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13132ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13334 ms. Remains : 125/125 places, 120/120 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-09 finished in 37518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1))&&X(G(p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-06-01 06:43:48] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:43:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 06:43:48] [INFO ] Invariant cache hit.
[2024-06-01 06:43:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:43:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4270 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5442 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9732ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9733ms
Finished structural reductions in LTL mode , in 1 iterations and 9917 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-10 finished in 10064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U !p2))))))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:43:58] [INFO ] Invariant cache hit.
[2024-06-01 06:43:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 06:43:58] [INFO ] Invariant cache hit.
[2024-06-01 06:43:58] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4222 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5388 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9628ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9631ms
Finished structural reductions in LTL mode , in 1 iterations and 9808 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005A-LTLFireability-11 finished in 10483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:44:08] [INFO ] Invariant cache hit.
[2024-06-01 06:44:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:44:08] [INFO ] Invariant cache hit.
[2024-06-01 06:44:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:44:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4155 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5545 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9718ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9719ms
Finished structural reductions in LTL mode , in 1 iterations and 9903 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-12
Stuttering criterion allowed to conclude after 295 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-005A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLFireability-12 finished in 10094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p1 U X(p2))||G(p3)))||p0)))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:44:18] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
[2024-06-01 06:44:19] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4234 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5358 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9612ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9615ms
Finished structural reductions in LTL mode , in 1 iterations and 9801 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 236 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) (NOT p3) (NOT p2)), (X p0), (X (X (NOT p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005A-LTLFireability-13 finished in 10622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F((G(p1)||(p1&&F(!p2))))))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:44:29] [INFO ] Invariant cache hit.
[2024-06-01 06:44:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:44:29] [INFO ] Invariant cache hit.
[2024-06-01 06:44:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:44:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4168 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5459 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9647ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9648ms
Finished structural reductions in LTL mode , in 1 iterations and 9832 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 4749 reset in 195 ms.
Product exploration explored 100000 steps with 4752 reset in 213 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) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (133 resets) in 410 ms. (97 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (20 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 274 ms. (145 steps per ms) remains 2/2 properties
[2024-06-01 06:44:40] [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, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/128 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 123/251 variables, 128/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 97 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 4/251 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 4/128 constraints, Positive P Invariants (semi-flows): 0/46 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 06:44:41] [INFO ] Invariant cache hit.
[2024-06-01 06:44:41] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-06-01 06:44:41] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:41] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2024-06-01 06:44:41] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 06:44:41] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 9 ms.
[2024-06-01 06:44:42] [INFO ] Added : 111 causal constraints over 23 iterations in 302 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:44:42] [INFO ] Invariant cache hit.
[2024-06-01 06:44:42] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 06:44:42] [INFO ] Invariant cache hit.
[2024-06-01 06:44:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:44:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4225 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5410 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9657ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9659ms
Finished structural reductions in LTL mode , in 1 iterations and 9847 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 06:44:52] [INFO ] Invariant cache hit.
[2024-06-01 06:44:52] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-06-01 06:44:52] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 06:44:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:44:53] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2024-06-01 06:44:53] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 06:44:53] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 10 ms.
[2024-06-01 06:44:53] [INFO ] Added : 111 causal constraints over 23 iterations in 289 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6066 reset in 173 ms.
Product exploration explored 100000 steps with 6125 reset in 190 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 06:44:54] [INFO ] Redundant transitions in 20 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 128 cols
[2024-06-01 06:44:54] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:44:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/180 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/308 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-06-01 06:44:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:44:57] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 2/313 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-06-01 06:44:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 314 constraints, problems are : Problem set: 1 solved, 120 unsolved in 6848 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 46/172 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/311 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/314 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 120/434 constraints. Problems are: Problem set: 1 solved, 120 unsolved
[2024-06-01 06:45:02] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:45:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 436 constraints, problems are : Problem set: 1 solved, 120 unsolved in 9254 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 120/121 constraints, Known Traps: 11/11 constraints]
After SMT, in 16121ms problems are : Problem set: 1 solved, 120 unsolved
Search for dead transitions found 1 dead transitions in 16123ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 121/123 transitions.
Graph (complete) has 440 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 127 /128 variables (removed 1) and now considering 121/121 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16170 ms. Remains : 127/128 places, 121/123 transitions.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-06-01 06:45:10] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:45:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:45:10] [INFO ] Invariant cache hit.
[2024-06-01 06:45:10] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 06:45:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4173 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 06:45:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5325 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9517ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9519ms
Finished structural reductions in LTL mode , in 1 iterations and 9700 ms. Remains : 128/128 places, 123/123 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-14 finished in 50616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
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 126 transition count 121
Applied a total of 4 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-06-01 06:45:20] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:45:20] [INFO ] Implicit Places using invariants in 67 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-15
Product exploration explored 100000 steps with 364 reset in 229 ms.
Product exploration explored 100000 steps with 366 reset in 248 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10529 steps (35 resets) in 54 ms. (191 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 232 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-06-01 06:45:21] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 06:45:21] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:45:21] [INFO ] Invariant cache hit.
[2024-06-01 06:45:21] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 06:45:21] [INFO ] Redundant transitions in 24 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-06-01 06:45:21] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3961 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 17321 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 21301ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 21304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21526 ms. Remains : 125/125 places, 120/121 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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 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 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5771 steps (18 resets) in 30 ms. (186 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 232 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 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 361 reset in 238 ms.
Product exploration explored 100000 steps with 365 reset in 261 ms.
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 06:45:44] [INFO ] Invariant cache hit.
[2024-06-01 06:45:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 06:45:44] [INFO ] Invariant cache hit.
[2024-06-01 06:45:44] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-01 06:45:44] [INFO ] Redundant transitions in 17 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 06:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:49] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/245 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7414 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-01 06:45:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 437 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5820 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 23/23 constraints]
After SMT, in 13253ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13455 ms. Remains : 125/125 places, 120/120 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-15 finished in 37464 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)))'
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(F(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(F(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(F(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(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' '!(X(X(X(F((p0&&F((G(p1)||(p1&&F(!p2))))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005A-LTLFireability-14
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
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 127 transition count 122
Applied a total of 2 rules in 6 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-06-01 06:45:58] [INFO ] Computed 46 invariants in 1 ms
[2024-06-01 06:45:58] [INFO ] Implicit Places using invariants in 70 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 126/128 places, 122/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 80 ms. Remains : 126/128 places, 122/123 transitions.
Running random walk in product with property : ShieldIIPs-PT-005A-LTLFireability-14
Product exploration explored 100000 steps with 5280 reset in 187 ms.
Product exploration explored 100000 steps with 5304 reset in 205 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) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (137 resets) in 149 ms. (266 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
// Phase 1: matrix 122 rows 126 cols
[2024-06-01 06:45:59] [INFO ] Computed 45 invariants in 1 ms
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, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/126 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 114/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 122/248 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 84 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 4/248 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 4/126 constraints, Positive P Invariants (semi-flows): 0/45 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 06:46:00] [INFO ] Invariant cache hit.
[2024-06-01 06:46:00] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:46:00] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 06:46:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:46:00] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 06:46:00] [INFO ] Computed and/alt/rep : 113/394/113 causal constraints (skipped 8 transitions) in 9 ms.
[2024-06-01 06:46:00] [INFO ] Added : 78 causal constraints over 16 iterations in 232 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 0 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-06-01 06:46:00] [INFO ] Invariant cache hit.
[2024-06-01 06:46:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 06:46:00] [INFO ] Invariant cache hit.
[2024-06-01 06:46:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 06:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5068 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 436 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12914 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 18008ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18010ms
Finished structural reductions in LTL mode , in 1 iterations and 18184 ms. Remains : 126/126 places, 122/122 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 06:46:19] [INFO ] Invariant cache hit.
[2024-06-01 06:46:19] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-06-01 06:46:19] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-01 06:46:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:46:19] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-06-01 06:46:19] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 06:46:19] [INFO ] Computed and/alt/rep : 113/394/113 causal constraints (skipped 8 transitions) in 8 ms.
[2024-06-01 06:46:20] [INFO ] Added : 78 causal constraints over 16 iterations in 219 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6997 reset in 168 ms.
Product exploration explored 100000 steps with 6947 reset in 185 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-06-01 06:46:21] [INFO ] Redundant transitions in 24 ms returned [119]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-06-01 06:46:21] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:46:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:46:22] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:46:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/247 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 06:46:28] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 314 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8593 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 120/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 434 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5920 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
After SMT, in 14535ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14580 ms. Remains : 126/126 places, 121/122 transitions.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-06-01 06:46:35] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 06:46:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:46:35] [INFO ] Invariant cache hit.
[2024-06-01 06:46:35] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 06:46:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 314 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5026 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/248 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 121/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 06:46:43] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 436 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13109 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
After SMT, in 18153ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18154ms
Finished structural reductions in LTL mode , in 1 iterations and 18333 ms. Remains : 126/126 places, 122/122 transitions.
Treatment of property ShieldIIPs-PT-005A-LTLFireability-14 finished in 55827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2024-06-01 06:46:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:46:54] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 06:46:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 123 transitions and 546 arcs took 4 ms.
Total runtime 511851 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-005A-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-005A-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717224890935
--------------------
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 ShieldIIPs-PT-005A-LTLFireability-00
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 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.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 137 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): ~301 levels ~10000 states ~71656 transitions
pnml2lts-mc( 1/ 4): ~302 levels ~20000 states ~158568 transitions
pnml2lts-mc( 1/ 4): ~302 levels ~40000 states ~319192 transitions
pnml2lts-mc( 0/ 4): ~402 levels ~80000 states ~683536 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~539!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 150213
pnml2lts-mc( 0/ 4): unique states count: 152812
pnml2lts-mc( 0/ 4): unique transitions count: 1299635
pnml2lts-mc( 0/ 4): - self-loop count: 510
pnml2lts-mc( 0/ 4): - claim dead count: 1130621
pnml2lts-mc( 0/ 4): - claim found count: 2573
pnml2lts-mc( 0/ 4): - claim success count: 152829
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2348
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 152829 states 1299732 transitions, fanout: 8.504
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.710 sec minimum, 0.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215252, Transitions per second: 1830608
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 9.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-02
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 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.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 156 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): ~130 levels ~10000 states ~23808 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~20000 states ~49844 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~40000 states ~106856 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~80000 states ~234876 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~160000 states ~485376 transitions
pnml2lts-mc( 3/ 4): ~130 levels ~320000 states ~1033084 transitions
pnml2lts-mc( 2/ 4): ~178 levels ~640000 states ~1855452 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~1280000 states ~3603516 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~2560000 states ~7921384 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~5120000 states ~16706508 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~10240000 states ~34118328 transitions
pnml2lts-mc( 2/ 4): ~185 levels ~20480000 states ~68468856 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551491
pnml2lts-mc( 0/ 4): unique states count: 33552073
pnml2lts-mc( 0/ 4): unique transitions count: 136162903
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 102608302
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552086
pnml2lts-mc( 0/ 4): - cum. max stack depth: 739
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552086 states 136162926 transitions, fanout: 4.058
pnml2lts-mc( 0/ 4): Total exploration time 79.360 sec (79.350 sec minimum, 79.357 sec on average)
pnml2lts-mc( 0/ 4): States per second: 422783, Transitions per second: 1715763
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 296.9MB, 9.3 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/63.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 296.9MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-03
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_2_
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 130 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 132 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): ~266 levels ~10000 states ~19344 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~20000 states ~38692 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~40000 states ~77224 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~80000 states ~163688 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~160000 states ~341048 transitions
pnml2lts-mc( 2/ 4): ~271 levels ~320000 states ~689384 transitions
pnml2lts-mc( 2/ 4): ~271 levels ~640000 states ~1425780 transitions
pnml2lts-mc( 2/ 4): ~271 levels ~1280000 states ~3095536 transitions
pnml2lts-mc( 1/ 4): ~246 levels ~2560000 states ~5994304 transitions
pnml2lts-mc( 0/ 4): ~338 levels ~5120000 states ~12710164 transitions
pnml2lts-mc( 1/ 4): ~248 levels ~10240000 states ~26099288 transitions
pnml2lts-mc( 1/ 4): ~248 levels ~20480000 states ~54639680 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548179
pnml2lts-mc( 0/ 4): unique states count: 33549252
pnml2lts-mc( 0/ 4): unique transitions count: 106229010
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 72674592
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549307
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1178
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549307 states 106229156 transitions, fanout: 3.166
pnml2lts-mc( 0/ 4): Total exploration time 63.670 sec (63.650 sec minimum, 63.658 sec on average)
pnml2lts-mc( 0/ 4): States per second: 526925, Transitions per second: 1668433
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.5MB, 8.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.5MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-04
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_3_
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 130 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 128 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): ~276 levels ~10000 states ~26156 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~20000 states ~55444 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~40000 states ~112604 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~80000 states ~230652 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~160000 states ~476712 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~320000 states ~1000316 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~640000 states ~2135916 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~1280000 states ~4488420 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~2560000 states ~8423656 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~5120000 states ~17705608 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~10240000 states ~36127440 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~20480000 states ~75427164 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29639517
pnml2lts-mc( 0/ 4): unique states count: 33520195
pnml2lts-mc( 0/ 4): unique transitions count: 209560447
pnml2lts-mc( 0/ 4): - self-loop count: 393
pnml2lts-mc( 0/ 4): - claim dead count: 158834416
pnml2lts-mc( 0/ 4): - claim found count: 17058728
pnml2lts-mc( 0/ 4): - claim success count: 33520212
pnml2lts-mc( 0/ 4): - cum. max stack depth: 138996
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33520212 states 209560482 transitions, fanout: 6.252
pnml2lts-mc( 0/ 4): Total exploration time 78.350 sec (78.340 sec minimum, 78.345 sec on average)
pnml2lts-mc( 0/ 4): States per second: 427827, Transitions per second: 2674671
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.0MB, 8.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-09
ltl formula formula --ltl=/tmp/3670/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
pnml2lts-mc( 0/ 4): Petri net has 128 places, 123 transitions and 546 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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( 1/ 4): LTL layer: formula: /tmp/3670/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 130 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 139 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): ~201 levels ~10000 states ~48016 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~20000 states ~94688 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~40000 states ~205016 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~80000 states ~379768 transitions
pnml2lts-mc( 2/ 4): ~201 levels ~160000 states ~837252 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~320000 states ~1347304 transitions
pnml2lts-mc( 1/ 4): ~187 levels ~640000 states ~2946848 transitions
pnml2lts-mc( 1/ 4): ~191 levels ~1280000 states ~6074628 transitions
pnml2lts-mc( 2/ 4): ~245 levels ~2560000 states ~14799508 transitions
pnml2lts-mc( 1/ 4): ~191 levels ~5120000 states ~26684508 transitions
pnml2lts-mc( 1/ 4): ~191 levels ~10240000 states ~57540284 transitions
pnml2lts-mc( 1/ 4): ~191 levels ~20480000 states ~119122652 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550928
pnml2lts-mc( 0/ 4): unique states count: 33551619
pnml2lts-mc( 0/ 4): unique transitions count: 246213598
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 212655844
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551634
pnml2lts-mc( 0/ 4): - cum. max stack depth: 844
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551634 states 246213658 transitions, fanout: 7.338
pnml2lts-mc( 0/ 4): Total exploration time 84.600 sec (84.570 sec minimum, 84.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 396591, Transitions per second: 2910327
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 306.7MB, 9.6 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/79.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 306.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-14
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_5_
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 130 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 178 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): ~115 levels ~10000 states ~16704 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~20000 states ~37068 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~40000 states ~76680 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~80000 states ~162568 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~160000 states ~353212 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~320000 states ~606140 transitions
pnml2lts-mc( 2/ 4): ~122 levels ~640000 states ~1419304 transitions
pnml2lts-mc( 2/ 4): ~127 levels ~1280000 states ~2841660 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~2560000 states ~5554576 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~5120000 states ~13111164 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~10240000 states ~23961348 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~20480000 states ~49440596 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552466
pnml2lts-mc( 0/ 4): unique states count: 33552867
pnml2lts-mc( 0/ 4): unique transitions count: 112474862
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 78920115
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552886
pnml2lts-mc( 0/ 4): - cum. max stack depth: 548
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552886 states 112474896 transitions, fanout: 3.352
pnml2lts-mc( 0/ 4): Total exploration time 70.590 sec (70.540 sec minimum, 70.555 sec on average)
pnml2lts-mc( 0/ 4): States per second: 475321, Transitions per second: 1593355
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 284.6MB, 8.9 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/44.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 284.6MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-005A-LTLFireability-15
ltl formula formula --ltl=/tmp/3670/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 128 places, 123 transitions and 546 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3670/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3670/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3670/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3670/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 129 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 129, there are 244 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): ~416 levels ~10000 states ~33348 transitions
pnml2lts-mc( 1/ 4): ~433 levels ~20000 states ~76780 transitions
pnml2lts-mc( 1/ 4): ~607 levels ~40000 states ~158940 transitions
pnml2lts-mc( 1/ 4): ~696 levels ~80000 states ~331396 transitions
pnml2lts-mc( 1/ 4): ~1122 levels ~160000 states ~778872 transitions
pnml2lts-mc( 0/ 4): ~404 levels ~320000 states ~1954468 transitions
pnml2lts-mc( 0/ 4): ~404 levels ~640000 states ~3950316 transitions
pnml2lts-mc( 0/ 4): ~404 levels ~1280000 states ~8225832 transitions
pnml2lts-mc( 0/ 4): ~404 levels ~2560000 states ~17116948 transitions
pnml2lts-mc( 0/ 4): ~4912 levels ~5120000 states ~34010348 transitions
pnml2lts-mc( 2/ 4): ~340 levels ~10240000 states ~72519536 transitions
pnml2lts-mc( 2/ 4): ~340 levels ~20480000 states ~157844944 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27534598
pnml2lts-mc( 0/ 4): unique states count: 33545252
pnml2lts-mc( 0/ 4): unique transitions count: 256828998
pnml2lts-mc( 0/ 4): - self-loop count: 781
pnml2lts-mc( 0/ 4): - claim dead count: 195349834
pnml2lts-mc( 0/ 4): - claim found count: 27888041
pnml2lts-mc( 0/ 4): - claim success count: 33545605
pnml2lts-mc( 0/ 4): - cum. max stack depth: 118723
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545788 states 256832959 transitions, fanout: 7.656
pnml2lts-mc( 0/ 4): Total exploration time 96.900 sec (96.880 sec minimum, 96.885 sec on average)
pnml2lts-mc( 0/ 4): States per second: 346190, Transitions per second: 2650495
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.8MB, 8.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.8MB (~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="ShieldIIPs-PT-005A"
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 ShieldIIPs-PT-005A, 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-171683760300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005A.tgz
mv ShieldIIPs-PT-005A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;