About the Execution of GreatSPN+red for ShieldRVs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12002.716 | 3600000.00 | 11603664.00 | 2414.00 | FFF??FFFF?TFT?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759700852.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700852
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 320K 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 ShieldRVs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717062884115
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 09:54:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 09:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:54:45] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-30 09:54:45] [INFO ] Transformed 703 places.
[2024-05-30 09:54:45] [INFO ] Transformed 953 transitions.
[2024-05-30 09:54:45] [INFO ] Found NUPN structural information;
[2024-05-30 09:54:45] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 68 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:54:45] [INFO ] Computed 201 invariants in 21 ms
[2024-05-30 09:54:46] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-30 09:54:46] [INFO ] Invariant cache hit.
[2024-05-30 09:54:47] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:54:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:55:18] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 29 ms to minimize.
SMT process timed out in 30606ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30668ms
Finished structural reductions in LTL mode , in 1 iterations and 32179 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 71 out of 703 places after structural reductions.
[2024-05-30 09:55:18] [INFO ] Flatten gal took : 154 ms
[2024-05-30 09:55:18] [INFO ] Flatten gal took : 87 ms
[2024-05-30 09:55:18] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 65 out of 703 places (down from 71) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (57 resets) in 2012 ms. (19 steps per ms) remains 1/28 properties
BEST_FIRST walk for 39870 steps (8 resets) in 347 ms. (114 steps per ms) remains 0/1 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||(!p1 U X(p0)))))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:55:19] [INFO ] Invariant cache hit.
[2024-05-30 09:55:20] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-30 09:55:20] [INFO ] Invariant cache hit.
[2024-05-30 09:55:21] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:55:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:55:50] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:55:51] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 5 ms to minimize.
[2024-05-30 09:55:51] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 13 ms to minimize.
[2024-05-30 09:55:51] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 30379ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30394ms
Finished structural reductions in LTL mode , in 1 iterations and 31630 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-00
Stuttering criterion allowed to conclude after 687 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-00 finished in 32006 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 X(p1)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:55:51] [INFO ] Invariant cache hit.
[2024-05-30 09:55:52] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-30 09:55:52] [INFO ] Invariant cache hit.
[2024-05-30 09:55:52] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:55:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:56:22] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:56:22] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:56:22] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:56:22] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:56:23] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:56:23] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
SMT process timed out in 30445ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30455ms
Finished structural reductions in LTL mode , in 1 iterations and 31652 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-02 finished in 31793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 81 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:56:23] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 09:56:24] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-30 09:56:24] [INFO ] Invariant cache hit.
[2024-05-30 09:56:24] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2024-05-30 09:56:25] [INFO ] Redundant transitions in 266 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 09:56:25] [INFO ] Computed 201 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:56:55] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-30 09:56:55] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 909 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30030 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:07] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:57:07] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:57:07] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:57:07] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:57:07] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:57:08] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:57:08] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:57:08] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:57:08] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:57:08] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:57:09] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:57:09] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 8 ms to minimize.
[2024-05-30 09:57:09] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:57:09] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:57:09] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/929 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:10] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:57:10] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-30 09:57:10] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:57:10] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 4 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 4 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/949 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 3 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 2 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/969 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 2 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/989 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:57:25] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1653 variables, and 991 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30028 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 88/88 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 38 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61894 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-03
Product exploration explored 100000 steps with 152 reset in 557 ms.
Product exploration explored 100000 steps with 155 reset in 616 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 17112 steps (25 resets) in 140 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:57:27] [INFO ] Invariant cache hit.
[2024-05-30 09:57:27] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-30 09:57:27] [INFO ] Invariant cache hit.
[2024-05-30 09:57:28] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2024-05-30 09:57:28] [INFO ] Redundant transitions in 164 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:57:57] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:57:57] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:57:57] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:57:57] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:57:58] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:58] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:57:58] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-30 09:57:58] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:58] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 4 ms to minimize.
[2024-05-30 09:57:59] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 30575ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30584ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31898 ms. Remains : 702/702 places, 951/951 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 36221 steps (52 resets) in 309 ms. (116 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 154 reset in 480 ms.
Product exploration explored 100000 steps with 153 reset in 579 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:58:01] [INFO ] Invariant cache hit.
[2024-05-30 09:58:01] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-30 09:58:01] [INFO ] Invariant cache hit.
[2024-05-30 09:58:02] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2024-05-30 09:58:02] [INFO ] Redundant transitions in 163 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:58:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:58:32] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:32] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:58:32] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:58:32] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-30 09:58:32] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1653 variables, and 908 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30024 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 5/908 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:58:43] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:58:43] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:58:43] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:58:46] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:58:47] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:47] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/928 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:58:47] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:58:48] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:58:48] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:58:48] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:58:48] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2024-05-30 09:58:48] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-05-30 09:58:49] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 4 ms to minimize.
[2024-05-30 09:58:49] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:58:49] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:58:49] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:58:50] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:58:50] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:58:50] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:58:50] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:58:50] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:58:51] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:58:51] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:58:51] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:58:51] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:58:51] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:58:52] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:58:52] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:58:52] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-05-30 09:58:53] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:58:53] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:58:53] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:58:53] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 2 ms to minimize.
[2024-05-30 09:58:54] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 4 ms to minimize.
[2024-05-30 09:58:54] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:58:54] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:58:54] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:58:55] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:58:55] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:58:55] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:58:55] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 2 ms to minimize.
[2024-05-30 09:58:55] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:58:56] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:58:56] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:58:56] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-30 09:58:56] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/968 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 2 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/988 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1653 variables, and 990 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30024 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 87/87 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61711 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-03 finished in 159407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||((p1 U p2)&&X(G(p3)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:59:03] [INFO ] Computed 201 invariants in 4 ms
[2024-05-30 09:59:03] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-30 09:59:03] [INFO ] Invariant cache hit.
[2024-05-30 09:59:04] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:59:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:59:34] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:59:34] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:59:34] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:59:34] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1656 variables, and 908 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30022 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 4/908 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:59:45] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 3 ms to minimize.
[2024-05-30 09:59:45] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
[2024-05-30 09:59:45] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:59:45] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:59:46] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:59:46] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:59:46] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:59:46] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:59:46] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:59:47] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 2 ms to minimize.
[2024-05-30 09:59:47] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:59:47] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:59:47] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:59:47] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:59:49] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/928 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:59:50] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:59:50] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:59:50] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 09:59:50] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:59:50] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 2 ms to minimize.
[2024-05-30 09:59:51] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-05-30 09:59:51] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-05-30 09:59:51] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-30 09:59:51] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:59:51] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:59:52] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:59:53] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:59:53] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:59:53] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2024-05-30 09:59:53] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:59:54] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:59:54] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:59:55] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:59:55] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-30 09:59:55] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 2 ms to minimize.
[2024-05-30 09:59:56] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:59:56] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:59:56] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 4 ms to minimize.
[2024-05-30 09:59:56] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:59:56] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:59:57] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:59:57] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-05-30 09:59:57] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:59:57] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:59:58] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:59:58] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:59:58] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:59:58] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:59:58] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:59:59] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/968 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:59:59] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:00:00] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-30 10:00:00] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:00:01] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:00:01] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:00:01] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:00:01] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:00:01] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-30 10:00:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2024-05-30 10:00:03] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/988 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1656 variables, and 988 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 84/84 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Finished structural reductions in LTL mode , in 1 iterations and 61620 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-04
Product exploration explored 100000 steps with 158 reset in 478 ms.
Product exploration explored 100000 steps with 154 reset in 565 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) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 103 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23251 steps (33 resets) in 153 ms. (150 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 19 factoid took 129 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 43 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:00:06] [INFO ] Computed 201 invariants in 4 ms
[2024-05-30 10:00:06] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-30 10:00:06] [INFO ] Invariant cache hit.
[2024-05-30 10:00:07] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-30 10:00:07] [INFO ] Redundant transitions in 164 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:00:07] [INFO ] Computed 201 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:00:37] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-05-30 10:00:37] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:00:37] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:00:38] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:00:38] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 30484ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30492ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31863 ms. Remains : 702/703 places, 951/953 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 67 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7963 steps (10 resets) in 54 ms. (144 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 156 reset in 482 ms.
Product exploration explored 100000 steps with 157 reset in 561 ms.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:00:39] [INFO ] Invariant cache hit.
[2024-05-30 10:00:40] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-30 10:00:40] [INFO ] Invariant cache hit.
[2024-05-30 10:00:41] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-30 10:00:41] [INFO ] Redundant transitions in 155 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:01:10] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-30 10:01:10] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:01:10] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:01:10] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:01:11] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:01:11] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:01:11] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 30373ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31657 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-04 finished in 128708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 38 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:01:11] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 10:01:12] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-30 10:01:12] [INFO ] Invariant cache hit.
[2024-05-30 10:01:12] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
[2024-05-30 10:01:13] [INFO ] Redundant transitions in 155 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:01:13] [INFO ] Computed 201 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 5 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 2 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
SMT process timed out in 30433ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31914 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05
Stuttering criterion allowed to conclude after 649 steps with 0 reset in 6 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 32015 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(G(p0))&&G(p1)&&F(p2))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 10:01:43] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 10:01:44] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-30 10:01:44] [INFO ] Invariant cache hit.
[2024-05-30 10:01:44] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 10:01:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:02:14] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:02:14] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 10:02:14] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:02:15] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:02:15] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 30465ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30474ms
Finished structural reductions in LTL mode , in 1 iterations and 31602 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 31798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p1)))||p0)))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 12 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 10:02:15] [INFO ] Invariant cache hit.
[2024-05-30 10:02:15] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-30 10:02:15] [INFO ] Invariant cache hit.
[2024-05-30 10:02:16] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 10:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:02:45] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:02:46] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:02:46] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:02:46] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:02:46] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-30 10:02:46] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-05-30 10:02:47] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
SMT process timed out in 30387ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Finished structural reductions in LTL mode , in 1 iterations and 31497 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-07 finished in 31640 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&&(p1 U X(p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 10:02:47] [INFO ] Invariant cache hit.
[2024-05-30 10:02:47] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 10:02:47] [INFO ] Invariant cache hit.
[2024-05-30 10:02:48] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 10:02:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:03:18] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:03:18] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30337ms
Finished structural reductions in LTL mode , in 1 iterations and 31436 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-08
Stuttering criterion allowed to conclude after 630 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-08 finished in 31586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 32 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:03:18] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 10:03:19] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-30 10:03:19] [INFO ] Invariant cache hit.
[2024-05-30 10:03:19] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-30 10:03:20] [INFO ] Redundant transitions in 168 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:03:20] [INFO ] Computed 201 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:03:49] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:03:49] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-30 10:03:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:03:49] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:03:50] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-30 10:03:50] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31649 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09
Product exploration explored 100000 steps with 149 reset in 503 ms.
Product exploration explored 100000 steps with 149 reset in 631 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 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (57 resets) in 283 ms. (140 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
[2024-05-30 10:03:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 951/1653 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:03:52] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:03:52] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:03:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-30 10:03:52] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:03:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 14/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 951/1653 variables, 702/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:03:54] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:03:54] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:03:54] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:03:54] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-05-30 10:03:54] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:03:55] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:03:56] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:03:57] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 20/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:03:57] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:03:57] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
SMT process timed out in 5501ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 61 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 702/702 places, 951/951 transitions.
RANDOM walk for 40000 steps (68 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217614 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217614 steps, saw 69195 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:04:00] [INFO ] Computed 201 invariants in 5 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, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 951/1653 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:04:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:04:02] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 16/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 951/1653 variables, 702/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:04:03] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:04:04] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:04:05] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 20/1642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:06] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:04:07] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:04:08] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1653 variables, 20/1662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:09] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:10] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:11] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1653 variables, 20/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:04:12] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:13] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:14] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1653 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:15] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:16] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:17] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1653 variables, 20/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:04:18] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:04:19] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:04:20] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:21] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:22] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 4 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1653 variables, 20/1762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:04:23] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:04:24] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-30 10:04:25] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1653 variables, 20/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:04:26] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:04:27] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:04:28] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:04:28] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:04:28] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-30 10:04:28] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1653 variables, 13/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1653 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1653 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 1795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27679 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 189/189 constraints]
After SMT, in 28046ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 431 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:04:29] [INFO ] Invariant cache hit.
[2024-05-30 10:04:29] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-30 10:04:29] [INFO ] Invariant cache hit.
[2024-05-30 10:04:30] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2024-05-30 10:04:30] [INFO ] Redundant transitions in 76 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:05:00] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-05-30 10:05:00] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 10:05:00] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-05-30 10:05:01] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 30524ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31943 ms. Remains : 702/702 places, 951/951 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 331 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:05:01] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 10:05:01] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-30 10:05:01] [INFO ] Invariant cache hit.
[2024-05-30 10:05:02] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2024-05-30 10:05:02] [INFO ] Redundant transitions in 177 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:05:33] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 6 ms to minimize.
[2024-05-30 10:05:33] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 30455ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31811 ms. Remains : 702/702 places, 951/951 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 (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (58 resets) in 274 ms. (145 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
[2024-05-30 10:05:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 951/1653 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:05:34] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 14/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 951/1653 variables, 702/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:35] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:05:36] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:05:37] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 20/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:38] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:05:39] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 5420ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 36 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 702/702 places, 951/951 transitions.
RANDOM walk for 40000 steps (67 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 215130 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 215130 steps, saw 68693 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:05:42] [INFO ] Computed 201 invariants in 10 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, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 951/1653 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1653 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/17 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 685/702 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 685/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:42] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:05:43] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 16/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 951/1653 variables, 702/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:44] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:05:45] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-30 10:05:46] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:05:47] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 20/1642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-05-30 10:05:48] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:05:49] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:05:50] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1653 variables, 20/1662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:05:51] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:05:52] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:05:53] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1653 variables, 20/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:54] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:05:55] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1653 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:56] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:57] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 5 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2024-05-30 10:05:58] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1653 variables, 20/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:05:59] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:06:00] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:01] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:06:02] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:06:03] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:06:04] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1653 variables, 20/1762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:06:05] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:06:06] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:07] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1653 variables, 20/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-30 10:06:08] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-30 10:06:09] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-30 10:06:10] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1653 variables, 13/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1653 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1653 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 1795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27654 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 189/189 constraints]
After SMT, in 28051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 438 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:06:10] [INFO ] Invariant cache hit.
[2024-05-30 10:06:11] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-30 10:06:11] [INFO ] Invariant cache hit.
[2024-05-30 10:06:12] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-30 10:06:12] [INFO ] Redundant transitions in 75 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:06:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:06:41] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 3 ms to minimize.
[2024-05-30 10:06:41] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 4 ms to minimize.
[2024-05-30 10:06:41] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-05-30 10:06:42] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 4 ms to minimize.
[2024-05-30 10:06:42] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 3 ms to minimize.
[2024-05-30 10:06:42] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 4 ms to minimize.
SMT process timed out in 30366ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31735 ms. Remains : 702/702 places, 951/951 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 316 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 544 ms.
Product exploration explored 100000 steps with 150 reset in 629 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:06:44] [INFO ] Computed 201 invariants in 2 ms
[2024-05-30 10:06:44] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-30 10:06:44] [INFO ] Invariant cache hit.
[2024-05-30 10:06:45] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2024-05-30 10:06:45] [INFO ] Redundant transitions in 157 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:07:14] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-30 10:07:15] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-05-30 10:07:15] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:07:15] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:07:15] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:07:15] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30372ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31635 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 237131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(!p0))) U X((!p1||F(!p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 10:07:15] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 10:07:16] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-30 10:07:16] [INFO ] Invariant cache hit.
[2024-05-30 10:07:16] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 10:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 1/703 variables, 201/903 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 10:07:46] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:07:46] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:07:46] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:07:46] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-30 10:07:47] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:07:47] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
SMT process timed out in 30415ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30423ms
Finished structural reductions in LTL mode , in 1 iterations and 31538 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND p1 p2), (AND p2 p1), (AND p1 p2), p2, (AND p2 p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 2144 ms.
Product exploration explored 100000 steps with 50000 reset in 2201 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (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 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 36118 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||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 27 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:07:52] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 10:07:52] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-30 10:07:52] [INFO ] Invariant cache hit.
[2024-05-30 10:07:53] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2024-05-30 10:07:53] [INFO ] Redundant transitions in 157 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:07:53] [INFO ] Computed 201 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:08:21] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-05-30 10:08:21] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-30 10:08:21] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:08:22] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-30 10:08:22] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:08:22] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 10:08:22] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:08:22] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 2 ms to minimize.
[2024-05-30 10:08:23] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:08:23] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 10:08:23] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 2 ms to minimize.
[2024-05-30 10:08:23] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31629 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13
Product exploration explored 100000 steps with 154 reset in 501 ms.
Product exploration explored 100000 steps with 157 reset in 601 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 103 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (59 resets) in 309 ms. (129 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/2 properties
BEST_FIRST walk for 26634 steps (5 resets) in 171 ms. (154 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p3 p0 p1))), (F (NOT (OR (NOT p3) p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p3 (NOT p0) p1))), (F p3), (F (NOT (OR (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT (OR p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 21 factoid took 449 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:08:26] [INFO ] Invariant cache hit.
[2024-05-30 10:08:26] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 10:08:26] [INFO ] Invariant cache hit.
[2024-05-30 10:08:27] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-30 10:08:27] [INFO ] Redundant transitions in 160 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:08:56] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:08:57] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 2 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30507ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31794 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT p3)), (X (OR p2 (NOT p3))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 112 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (58 resets) in 476 ms. (83 steps per ms) remains 2/9 properties
BEST_FIRST walk for 37264 steps (8 resets) in 189 ms. (196 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT p3)), (X (OR p2 (NOT p3))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p3 p0 p1))), (F (NOT (OR (NOT p3) p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p3 (NOT p0) p1))), (F p3), (F (NOT (OR (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (NOT (OR p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 21 factoid took 467 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 158 reset in 515 ms.
Product exploration explored 100000 steps with 160 reset in 599 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 35 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:09:00] [INFO ] Invariant cache hit.
[2024-05-30 10:09:01] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-30 10:09:01] [INFO ] Invariant cache hit.
[2024-05-30 10:09:01] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2024-05-30 10:09:01] [INFO ] Redundant transitions in 154 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:09:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:09:31] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 3 ms to minimize.
[2024-05-30 10:09:31] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 2 ms to minimize.
[2024-05-30 10:09:31] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 10:09:31] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:09:31] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-05-30 10:09:32] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 10:09:32] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 30410ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31697 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 100447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 27 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:09:32] [INFO ] Computed 201 invariants in 10 ms
[2024-05-30 10:09:32] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-30 10:09:32] [INFO ] Invariant cache hit.
[2024-05-30 10:09:33] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-05-30 10:09:33] [INFO ] Redundant transitions in 166 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:09:33] [INFO ] Computed 201 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:10:03] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:10:03] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 2 ms to minimize.
[2024-05-30 10:10:03] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 10:10:03] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:10:03] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:10:04] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-05-30 10:10:04] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
SMT process timed out in 30452ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31763 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14
Stuttering criterion allowed to conclude after 658 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 31834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||((p1 U p2)&&X(G(p3)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-050A-LTLFireability-04
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 33 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:10:04] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 10:10:05] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-30 10:10:05] [INFO ] Invariant cache hit.
[2024-05-30 10:10:05] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 951 sub problems to find dead transitions.
[2024-05-30 10:10:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:10:35] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:10:35] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-30 10:10:35] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:10:35] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:10:35] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-30 10:10:36] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-30 10:10:36] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 30339ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LI_LTL mode, iteration 1 : 702/703 places, 952/953 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31470 ms. Remains : 702/703 places, 952/953 transitions.
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-04
Product exploration explored 100000 steps with 158 reset in 479 ms.
Product exploration explored 100000 steps with 154 reset in 574 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) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 106 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20676 steps (29 resets) in 172 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 19 factoid took 134 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 702 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 20 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 10:10:37] [INFO ] Invariant cache hit.
[2024-05-30 10:10:38] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-30 10:10:38] [INFO ] Invariant cache hit.
[2024-05-30 10:10:39] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-05-30 10:10:39] [INFO ] Redundant transitions in 167 ms returned [300]
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 950 sub problems to find dead transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-30 10:10:39] [INFO ] Computed 201 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:11:08] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-30 10:11:09] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
SMT process timed out in 30449ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30457ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/702 places, 951/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31778 ms. Remains : 702/702 places, 951/952 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 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25589 steps (36 resets) in 152 ms. (167 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 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 154 reset in 471 ms.
Product exploration explored 100000 steps with 155 reset in 559 ms.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:11:11] [INFO ] Invariant cache hit.
[2024-05-30 10:11:11] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-30 10:11:11] [INFO ] Invariant cache hit.
[2024-05-30 10:11:12] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2024-05-30 10:11:12] [INFO ] Redundant transitions in 154 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:11:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-30 10:11:41] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-30 10:11:41] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 2 ms to minimize.
[2024-05-30 10:11:41] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-30 10:11:42] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30372ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31548 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-04 finished in 98498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
[2024-05-30 10:11:43] [INFO ] Flatten gal took : 55 ms
[2024-05-30 10:11:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-30 10:11:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4600 arcs took 8 ms.
Total runtime 1017969 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVs-PT-050A
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 703
TRANSITIONS: 953
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.000s]
SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4346
MODEL NAME: /home/mcc/execution/422/model
703 places, 953 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759700852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A 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 ;