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 |
| 6745.115 | 3600000.00 | 6322178.00 | 9611.80 | FFTFTTFFFTFF??FF | 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-171683759700851.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700851
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717062631926
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
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:50:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 09:50:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:50:33] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-30 09:50:33] [INFO ] Transformed 703 places.
[2024-05-30 09:50:33] [INFO ] Transformed 953 transitions.
[2024-05-30 09:50:33] [INFO ] Found NUPN structural information;
[2024-05-30 09:50:33] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-050A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 67 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:50:33] [INFO ] Computed 201 invariants in 20 ms
[2024-05-30 09:50:34] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-30 09:50:34] [INFO ] Invariant cache hit.
[2024-05-30 09:50:35] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:50:35] [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:51:05] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 39 ms to minimize.
[2024-05-30 09:51:06] [INFO ] Deduced a trap composed of 7 places in 764 ms of which 19 ms to minimize.
SMT process timed out in 30954ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30991ms
Finished structural reductions in LTL mode , in 1 iterations and 32526 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 33 out of 703 places after structural reductions.
[2024-05-30 09:51:06] [INFO ] Flatten gal took : 159 ms
[2024-05-30 09:51:06] [INFO ] Flatten gal took : 86 ms
[2024-05-30 09:51:06] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 31 out of 703 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (57 resets) in 1263 ms. (31 steps per ms) remains 1/17 properties
BEST_FIRST walk for 11044 steps (0 resets) in 115 ms. (95 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 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 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:51:07] [INFO ] Invariant cache hit.
[2024-05-30 09:51:07] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-30 09:51:07] [INFO ] Invariant cache hit.
[2024-05-30 09:51:08] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:51:08] [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:51:37] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 5 ms to minimize.
[2024-05-30 09:51:38] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:51:38] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:51:38] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:51:38] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-30 09:51:39] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 30473ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30484ms
Finished structural reductions in LTL mode , in 1 iterations and 31657 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-01
Stuttering criterion allowed to conclude after 665 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-01 finished in 32057 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((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 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:51:39] [INFO ] Invariant cache hit.
[2024-05-30 09:51:39] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-30 09:51:39] [INFO ] Invariant cache hit.
[2024-05-30 09:51:40] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:51:40] [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:52:09] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:52:10] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:52:10] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:52:10] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 09:52:10] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:52:10] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:52:11] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
SMT process timed out in 30495ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30506ms
Finished structural reductions in LTL mode , in 1 iterations and 31631 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 523 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-07 finished in 31905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 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 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:52:11] [INFO ] Invariant cache hit.
[2024-05-30 09:52:11] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-30 09:52:11] [INFO ] Invariant cache hit.
[2024-05-30 09:52:12] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:52:12] [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:52:41] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 3 ms to minimize.
[2024-05-30 09:52:41] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:52:42] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-05-30 09:52:42] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-30 09:52:42] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:52:42] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:52:42] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
SMT process timed out in 30483ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30493ms
Finished structural reductions in LTL mode , in 1 iterations and 31605 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-08
Stuttering criterion allowed to conclude after 729 steps with 1 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-08 finished in 31792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G((p1 U p2)))))))'
Support contains 5 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 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-30 09:52:43] [INFO ] Invariant cache hit.
[2024-05-30 09:52:43] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-30 09:52:43] [INFO ] Invariant cache hit.
[2024-05-30 09:52:44] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:52: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 09:53:14] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 3 ms to minimize.
[2024-05-30 09:53:14] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 2 ms to minimize.
[2024-05-30 09:53:14] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
SMT process timed out in 30427ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Finished structural reductions in LTL mode , in 1 iterations and 31605 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-10 finished in 31875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 82 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:53:15] [INFO ] Computed 201 invariants in 5 ms
[2024-05-30 09:53:15] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-30 09:53:15] [INFO ] Invariant cache hit.
[2024-05-30 09:53:16] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-30 09:53:16] [INFO ] Redundant transitions in 324 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:53:16] [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 09:53:46] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:53:46] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 3 ms to minimize.
[2024-05-30 09:53:46] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:53:47] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 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 30460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 32 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 32054 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-11
Stuttering criterion allowed to conclude after 63711 steps with 95 reset in 409 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-11 finished in 32522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (!p1&&G(F(!p2))))))'
Support contains 5 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 19 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:53:47] [INFO ] Computed 201 invariants in 9 ms
[2024-05-30 09:53:47] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-30 09:53:47] [INFO ] Invariant cache hit.
[2024-05-30 09:53:48] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:53: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 09:54:18] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:54:18] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:54:18] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:54:19] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 timeout
0.0) 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 30038 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:54:30] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 4 ms to minimize.
[2024-05-30 09:54:30] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:54:30] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:54:30] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:54:30] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:54:31] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:54:31] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:54:31] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:54:31] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-30 09:54:31] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:54:32] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 3 ms to minimize.
[2024-05-30 09:54:32] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2024-05-30 09:54:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:54:32] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:54:33] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 3 ms to minimize.
[2024-05-30 09:54:33] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:54:33] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:54:33] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 4 ms to minimize.
[2024-05-30 09:54:33] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:54:34] [INFO ] Deduced a trap composed of 14 places in 188 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:54:34] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:54:35] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:54:35] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 5 ms to minimize.
[2024-05-30 09:54:35] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-30 09:54:35] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-05-30 09:54:36] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:54:36] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2024-05-30 09:54:36] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:54:36] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:54:36] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 2 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:54:37] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:54:38] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 3 ms to minimize.
[2024-05-30 09:54:38] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:54:38] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:54:38] [INFO ] Deduced a trap composed of 22 places in 190 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:54:39] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:54:39] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2024-05-30 09:54:40] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:54:40] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2024-05-30 09:54:40] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:54:41] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2024-05-30 09:54:41] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:54:41] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 3 ms to minimize.
[2024-05-30 09:54:41] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:54:42] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 3 ms to minimize.
[2024-05-30 09:54:42] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
[2024-05-30 09:54:42] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-05-30 09:54:42] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2024-05-30 09:54:43] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:54:43] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-30 09:54:43] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 2 ms to minimize.
[2024-05-30 09:54:43] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:54:44] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:54:44] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 3 ms to minimize.
[2024-05-30 09:54:44] [INFO ] Deduced a trap composed of 14 places in 189 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:54:45] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 3 ms to minimize.
[2024-05-30 09:54:45] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:54:46] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2024-05-30 09:54:46] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:54:46] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 2 ms to minimize.
[2024-05-30 09:54:47] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 09:54:47] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-30 09:54:47] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-30 09:54:47] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-05-30 09:54:47] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:54:48] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-30 09:54:48] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:54:48] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:54:48] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:54:48] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 2 ms to minimize.
[2024-05-30 09:54:49] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-30 09:54:49] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 60434ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR p2 p1), (OR p1 p2), (NOT p0), (NOT p0), p2, p2]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 150 reset in 512 ms.
Product exploration explored 100000 steps with 149 reset in 672 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 145 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
RANDOM walk for 40000 steps (58 resets) in 948 ms. (42 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 385 ms. (103 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
[2024-05-30 09:54:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 692/703 variables, 198/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 692/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 3/1656 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Domain max(s): 3/703 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 483 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
[2024-05-30 09:54:53] [INFO ] Invariant cache hit.
[2024-05-30 09:54:54] [INFO ] [Real]Absence check using 201 positive place invariants in 79 ms returned sat
[2024-05-30 09:54:55] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2024-05-30 09:54:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 09:54:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 95 ms returned sat
[2024-05-30 09:54:57] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2024-05-30 09:54:57] [INFO ] Computed and/alt/rep : 461/1714/461 causal constraints (skipped 491 transitions) in 66 ms.
[2024-05-30 09:55:02] [INFO ] Added : 358 causal constraints over 73 iterations in 5568 ms. Result :sat
Could not prove EG p1
[2024-05-30 09:55:02] [INFO ] Invariant cache hit.
[2024-05-30 09:55:03] [INFO ] [Real]Absence check using 201 positive place invariants in 104 ms returned sat
[2024-05-30 09:55:04] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2024-05-30 09:55:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 09:55:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 95 ms returned sat
[2024-05-30 09:55:06] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2024-05-30 09:55:06] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:55:06] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-30 09:55:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-05-30 09:55:06] [INFO ] Computed and/alt/rep : 461/1714/461 causal constraints (skipped 491 transitions) in 62 ms.
[2024-05-30 09:55:10] [INFO ] Added : 221 causal constraints over 45 iterations in 3662 ms. Result :sat
Could not prove EG p2
Support contains 5 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 47 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:55:10] [INFO ] Computed 201 invariants in 14 ms
[2024-05-30 09:55:10] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-30 09:55:10] [INFO ] Invariant cache hit.
[2024-05-30 09:55:11] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-30 09:55:11] [INFO ] Redundant transitions in 174 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:55:11] [INFO ] Computed 201 invariants in 9 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:55:41] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:55:41] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:55:41] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30442ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 32 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 31847 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 : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 134 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
RANDOM walk for 40000 steps (58 resets) in 252 ms. (158 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
[2024-05-30 09:55:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 691/702 variables, 198/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 691/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 414 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
Problem apf2 is UNSAT
After SMT solving in domain Int declared 3/1653 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Domain max(s): 3/702 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 20 factoid took 462 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
[2024-05-30 09:55:44] [INFO ] Invariant cache hit.
[2024-05-30 09:55:45] [INFO ] [Real]Absence check using 201 positive place invariants in 117 ms returned sat
[2024-05-30 09:55:46] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2024-05-30 09:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 09:55:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 86 ms returned sat
[2024-05-30 09:55:47] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2024-05-30 09:55:47] [INFO ] Computed and/alt/rep : 459/1709/459 causal constraints (skipped 491 transitions) in 59 ms.
[2024-05-30 09:55:52] [INFO ] Added : 322 causal constraints over 65 iterations in 4745 ms. Result :sat
Could not prove EG p1
[2024-05-30 09:55:52] [INFO ] Invariant cache hit.
[2024-05-30 09:55:53] [INFO ] [Real]Absence check using 201 positive place invariants in 173 ms returned sat
[2024-05-30 09:55:55] [INFO ] [Real]Absence check using state equation in 1984 ms returned sat
[2024-05-30 09:55:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 09:55:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2024-05-30 09:55:56] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2024-05-30 09:55:56] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:55:56] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-30 09:55:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-05-30 09:55:56] [INFO ] Computed and/alt/rep : 459/1709/459 causal constraints (skipped 491 transitions) in 60 ms.
[2024-05-30 09:56:01] [INFO ] Added : 313 causal constraints over 63 iterations in 4565 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p0) p1 p2), (OR p1 p2), (NOT p0), (NOT p0), p2, p2, false, false, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 151 reset in 502 ms.
Product exploration explored 100000 steps with 152 reset in 579 ms.
Support contains 5 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 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:56:03] [INFO ] Invariant cache hit.
[2024-05-30 09:56:03] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-30 09:56:03] [INFO ] Invariant cache hit.
[2024-05-30 09:56:04] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2024-05-30 09:56:04] [INFO ] Redundant transitions in 428 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:56:04] [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:56:34] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:56:34] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:56:35] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 2 ms to minimize.
SMT process timed out in 30447ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32079 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLCardinality-12 finished in 167824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p1))||G(F(p0))))'
Support contains 6 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:56:35] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 09:56:35] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-30 09:56:35] [INFO ] Invariant cache hit.
[2024-05-30 09:56:36] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-05-30 09:56:36] [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:57:06] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 3 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 3 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 3 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:57:06] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1656 variables, and 909 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30020 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: 5/5 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, 5/909 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 2 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 2 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:57:18] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 2 ms to minimize.
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:57:19] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 2 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 2 ms to minimize.
[2024-05-30 09:57:20] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:57:21] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/929 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 2 ms to minimize.
[2024-05-30 09:57:22] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 2 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 2 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2024-05-30 09:57:23] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-05-30 09:57:24] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 3 ms to minimize.
[2024-05-30 09:57:25] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
[2024-05-30 09:57:25] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2024-05-30 09:57:25] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2024-05-30 09:57:25] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 3 ms to minimize.
[2024-05-30 09:57:26] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 2 ms to minimize.
[2024-05-30 09:57:26] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:57:26] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:57:26] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:57:26] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/949 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:57:28] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-30 09:57:28] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:57:28] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-30 09:57:28] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 2 ms to minimize.
[2024-05-30 09:57:28] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 09:57:29] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 2 ms to minimize.
[2024-05-30 09:57:29] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:57:29] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:57:29] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:57:29] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:57:30] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:57:30] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 3 ms to minimize.
[2024-05-30 09:57:30] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 09:57:30] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:57:30] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 09:57:31] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 3 ms to minimize.
[2024-05-30 09:57:31] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 3 ms to minimize.
[2024-05-30 09:57:31] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:57:31] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-05-30 09:57:31] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/969 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-30 09:57:32] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-05-30 09:57:32] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-30 09:57:33] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
[2024-05-30 09:57:33] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 2 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 2 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 2 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:57:34] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 4 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:57:35] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 3 ms to minimize.
[2024-05-30 09:57:36] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2024-05-30 09:57:36] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-05-30 09:57:36] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:57:36] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 2 ms to minimize.
[2024-05-30 09:57:37] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 60417ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 61669 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 1167 reset in 493 ms.
Product exploration explored 100000 steps with 1208 reset in 591 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (58 resets) in 422 ms. (94 steps per ms) remains 1/5 properties
BEST_FIRST walk for 15091 steps (2 resets) in 66 ms. (225 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
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 40 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:57:39] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 09:57:39] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-30 09:57:39] [INFO ] Invariant cache hit.
[2024-05-30 09:57:40] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2024-05-30 09:57:40] [INFO ] Redundant transitions in 261 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:57:40] [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:58:09] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:58:10] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:58:10] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:58:10] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-30 09:58:10] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-05-30 09:58:10] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2024-05-30 09:58:11] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:58:11] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
SMT process timed out in 30540ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 28 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 32079 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 153 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (58 resets) in 397 ms. (100 steps per ms) remains 1/5 properties
BEST_FIRST walk for 11708 steps (1 resets) in 57 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 336 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 612 reset in 484 ms.
Product exploration explored 100000 steps with 609 reset in 596 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 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 09:58:13] [INFO ] Invariant cache hit.
[2024-05-30 09:58:14] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-30 09:58:14] [INFO ] Invariant cache hit.
[2024-05-30 09:58:15] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-30 09:58:15] [INFO ] Redundant transitions in 156 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 09:58:15] [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:43] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:58:44] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 2 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-30 09:58:45] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 30393ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31673 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLCardinality-13 finished in 130309 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)&&F(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.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 35 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
// Phase 1: matrix 951 rows 701 cols
[2024-05-30 09:58:45] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 09:58:46] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-30 09:58:46] [INFO ] Invariant cache hit.
[2024-05-30 09:58:46] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-05-30 09:58:46] [INFO ] Redundant transitions in 174 ms returned [299]
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 949 sub problems to find dead transitions.
// Phase 1: matrix 950 rows 701 cols
[2024-05-30 09:58:47] [INFO ] Computed 201 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 949 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:58:57] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:58:58] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 2 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 5 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-30 09:58:59] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 2 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:59:00] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 20/922 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-05-30 09:59:01] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 2 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:59:02] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-05-30 09:59:03] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 6 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:59:04] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-30 09:59:05] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:59:05] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 949 unsolved
[2024-05-30 09:59:15] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:59:16] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 09:59:16] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-30 09:59:16] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-30 09:59:16] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-05-30 09:59:17] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-30 09:59:17] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 30282ms, After SMT, problems are : Problem set: 0 solved, 949 unsolved
Search for dead transitions found 0 dead transitions in 30290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 701/703 places, 950/953 transitions.
Applied a total of 0 rules in 24 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31639 ms. Remains : 701/703 places, 950/953 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-14
Stuttering criterion allowed to conclude after 33432 steps with 61 reset in 162 ms.
FORMULA ShieldRVs-PT-050A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLCardinality-14 finished in 31963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (!p1&&G(F(!p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p1))||G(F(p0))))'
Found a Shortening insensitive property : ShieldRVs-PT-050A-LTLCardinality-13
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 6 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 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 37 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:59:18] [INFO ] Computed 201 invariants in 5 ms
[2024-05-30 09:59:18] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-30 09:59:18] [INFO ] Invariant cache hit.
[2024-05-30 09:59:19] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 951 sub problems to find dead transitions.
[2024-05-30 09:59:19] [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 09:59:48] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 3 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 2 ms to minimize.
[2024-05-30 09:59:48] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-05-30 09:59:49] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-30 09:59:49] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-05-30 09:59:49] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:59:49] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 30455ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30465ms
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 31648 ms. Remains : 702/703 places, 952/953 transitions.
Running random walk in product with property : ShieldRVs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 1228 reset in 524 ms.
Product exploration explored 100000 steps with 1185 reset in 626 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 34957 steps (52 resets) in 364 ms. (95 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 09:59:52] [INFO ] Invariant cache hit.
[2024-05-30 09:59:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-30 09:59:52] [INFO ] Invariant cache hit.
[2024-05-30 09:59:53] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-30 09:59:53] [INFO ] Redundant transitions in 176 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:59:53] [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:23] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:00:23] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-30 10:00:23] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 10:00:23] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 10:00:23] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 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 30443ms
Starting structural reductions in SI_LTL mode, iteration 1 : 702/702 places, 951/952 transitions.
Applied a total of 0 rules in 24 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 31775 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
RANDOM walk for 40000 steps (58 resets) in 236 ms. (168 steps per ms) remains 1/5 properties
BEST_FIRST walk for 8921 steps (0 resets) in 33 ms. (262 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 285 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 612 reset in 514 ms.
Product exploration explored 100000 steps with 610 reset in 607 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 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-30 10:00:26] [INFO ] Invariant cache hit.
[2024-05-30 10:00:26] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-30 10:00:26] [INFO ] Invariant cache hit.
[2024-05-30 10:00:27] [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.
[2024-05-30 10:00:27] [INFO ] Redundant transitions in 177 ms returned []
Running 950 sub problems to find dead transitions.
[2024-05-30 10:00: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:00:56] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 10:00:57] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-30 10:00:58] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 2 ms to minimize.
[2024-05-30 10:00:58] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 30502ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31799 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLCardinality-13 finished in 100485 ms.
[2024-05-30 10:00:58] [INFO ] Flatten gal took : 54 ms
[2024-05-30 10:00:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-05-30 10:00:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4600 arcs took 13 ms.
Total runtime 625200 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/413/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.023s, Sys 0.003s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
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: 2576
MODEL NAME: /home/mcc/execution/413/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.
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
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-171683759700851"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;