Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K 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 ShieldIIPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717235506149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:51:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:51:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:51:47] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-01 09:51:47] [INFO ] Transformed 213 places.
[2024-06-01 09:51:47] [INFO ] Transformed 198 transitions.
[2024-06-01 09:51:47] [INFO ] Found NUPN structural information;
[2024-06-01 09:51:47] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 183 transition count 168
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 167
Applied a total of 62 rules in 49 ms. Remains 182 /213 variables (removed 31) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 182 cols
[2024-06-01 09:51:47] [INFO ] Computed 28 invariants in 17 ms
[2024-06-01 09:51:48] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 09:51:48] [INFO ] Invariant cache hit.
[2024-06-01 09:51:48] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 09:51:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 10 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:51:51] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/349 variables, 182/236 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:51:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:51:54] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 245 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10136 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:51:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/349 variables, 182/246 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 166/412 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:52:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 12/424 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:05] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 09:52:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:52:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 09:52:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/349 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 16 (OVERLAPS) 0/349 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 437 constraints, problems are : Problem set: 0 solved, 166 unsolved in 26035 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 61/61 constraints]
After SMT, in 36235ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 36253ms
Starting structural reductions in LTL mode, iteration 1 : 182/213 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36729 ms. Remains : 182/213 places, 167/198 transitions.
Support contains 18 out of 182 places after structural reductions.
[2024-06-01 09:52:24] [INFO ] Flatten gal took : 37 ms
[2024-06-01 09:52:24] [INFO ] Flatten gal took : 20 ms
[2024-06-01 09:52:24] [INFO ] Input system was already deterministic with 167 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 1590 steps (0 resets) in 134 ms. (11 steps per ms) remains 0/12 properties
Computed a total of 49 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 181 transition count 129
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 74 place count 144 transition count 107
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 118 place count 122 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 120 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 120 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 120 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 222 place count 70 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 70 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 69 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 239 place count 62 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 60 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 58 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 58 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 57 transition count 54
Applied a total of 245 rules in 43 ms. Remains 57 /182 variables (removed 125) and now considering 54/167 (removed 113) transitions.
// Phase 1: matrix 54 rows 57 cols
[2024-06-01 09:52:24] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 09:52:25] [INFO ] Implicit Places using invariants in 75 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/182 places, 54/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 53
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 55 cols
[2024-06-01 09:52:25] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 09:52:25] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 09:52:25] [INFO ] Invariant cache hit.
[2024-06-01 09:52:25] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/182 places, 53/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 55/182 places, 53/167 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-01 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p2||X(p0)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 165
Applied a total of 4 rules in 10 ms. Remains 180 /182 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-06-01 09:52:25] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:52:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 09:52:25] [INFO ] Invariant cache hit.
[2024-06-01 09:52:25] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 09:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/234 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:52:29] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:52:30] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:52:30] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:52:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 5/239 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 240 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8667 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/345 variables, 180/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 164/404 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:52:36] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:52:37] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:52:37] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-06-01 09:52:37] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 11/415 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:38] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:52:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:52:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:52:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:52:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 5/420 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 09:52:43] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:52:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 424 constraints, problems are : Problem set: 0 solved, 164 unsolved in 16126 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 52/52 constraints]
After SMT, in 24811ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 24815ms
Starting structural reductions in LTL mode, iteration 1 : 180/182 places, 165/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25110 ms. Remains : 180/182 places, 165/167 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-003B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-02 finished in 25685 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((G((X(p1)||p0))||F(p2)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 5 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-06-01 09:52:51] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:52:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 09:52:51] [INFO ] Invariant cache hit.
[2024-06-01 09:52:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-06-01 09:52:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/229 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:52:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:52:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/343 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:53:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
[2024-06-01 09:53:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 238 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13238 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 163/402 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:53:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 09:53:07] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:53:07] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:53:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 5/407 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:53:09] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:53:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:53:10] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:53:16] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/343 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:18] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 415 constraints, problems are : Problem set: 0 solved, 163 unsolved in 21143 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 45/45 constraints]
After SMT, in 34417ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 34420ms
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34655 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-04
Product exploration explored 100000 steps with 1 reset in 141 ms.
Product exploration explored 100000 steps with 1 reset in 312 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 230 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 164/164 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-06-01 09:53:27] [INFO ] Invariant cache hit.
[2024-06-01 09:53:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 09:53:27] [INFO ] Invariant cache hit.
[2024-06-01 09:53:27] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-06-01 09:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:30] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:53:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/229 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:53:31] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/343 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:53:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:37] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:53:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 238 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13294 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:41] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 163/402 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:53:43] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:53:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:53:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:53:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 5/407 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:53:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-01 09:53:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:53:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:53:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/343 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:53:55] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 415 constraints, problems are : Problem set: 0 solved, 163 unsolved in 21441 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 45/45 constraints]
After SMT, in 34758ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 34760ms
Finished structural reductions in LTL mode , in 1 iterations and 34939 ms. Remains : 179/179 places, 164/164 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 202 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 164/164 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 179 transition count 164
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 179 transition count 174
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 179 transition count 174
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 104 place count 179 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 179 transition count 174
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 127 place count 157 transition count 152
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 149 place count 157 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 157 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 155 transition count 150
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 155 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 164 place count 155 transition count 201
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 174 place count 145 transition count 181
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 184 place count 145 transition count 181
Deduced a syphon composed of 81 places in 0 ms
Applied a total of 184 rules in 54 ms. Remains 145 /179 variables (removed 34) and now considering 181/164 (removed -17) transitions.
[2024-06-01 09:54:04] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
// Phase 1: matrix 181 rows 145 cols
[2024-06-01 09:54:04] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:54:04] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/48 constraints. Problems are: Problem set: 111 solved, 69 unsolved
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 09:54:05] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 09:54:06] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 09:54:06] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
[2024-06-01 09:54:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 6/54 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 181/326 variables, 145/199 constraints. Problems are: Problem set: 122 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 35/234 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/234 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/234 constraints. Problems are: Problem set: 122 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 234 constraints, problems are : Problem set: 122 solved, 58 unsolved in 2775 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 145/145 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 122 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 82/145 variables, 28/28 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 26/54 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 181/326 variables, 145/199 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 35/234 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 58/292 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/292 constraints. Problems are: Problem set: 122 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/292 constraints. Problems are: Problem set: 122 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 292 constraints, problems are : Problem set: 122 solved, 58 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 145/145 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 58/180 constraints, Known Traps: 26/26 constraints]
After SMT, in 4817ms problems are : Problem set: 122 solved, 58 unsolved
Search for dead transitions found 122 dead transitions in 4819ms
Found 122 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 122 transitions
Dead transitions reduction (with SMT) removed 122 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 145/179 places, 59/164 transitions.
Graph (complete) has 209 edges and 145 vertex of which 64 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.2 ms
Discarding 81 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 64 /145 variables (removed 81) and now considering 59/59 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/179 places, 59/164 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4904 ms. Remains : 64/179 places, 59/164 transitions.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-06-01 09:54:09] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:54:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 09:54:09] [INFO ] Invariant cache hit.
[2024-06-01 09:54:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-06-01 09:54:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:54:10] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:54:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/229 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:54:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/343 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
[2024-06-01 09:54:18] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:19] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:54:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 238 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12950 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:23] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 163/402 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:24] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:54:24] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:54:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:54:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:54:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 5/407 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:54:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:54:27] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:54:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:54:33] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/343 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:36] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 415 constraints, problems are : Problem set: 0 solved, 163 unsolved in 21084 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 45/45 constraints]
After SMT, in 34048ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 34050ms
Finished structural reductions in LTL mode , in 1 iterations and 34264 ms. Remains : 179/179 places, 164/164 transitions.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-04 finished in 112505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p0)))))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 2 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-06-01 09:54:43] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:54:43] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 09:54:43] [INFO ] Invariant cache hit.
[2024-06-01 09:54:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-06-01 09:54:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:54:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:47] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 164/343 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 239 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8539 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/240 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 163/403 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:54:54] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:54:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:54:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:54:55] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:54:55] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-01 09:54:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:54:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:54:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 415 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12179 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 45/45 constraints]
After SMT, in 20732ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 20736ms
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20895 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-05 finished in 21097 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 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 181 transition count 129
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 74 place count 144 transition count 106
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 120 place count 121 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 119 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 119 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 118 transition count 103
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 239 place count 62 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 61 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 59 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 242 place count 59 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 58 transition count 57
Applied a total of 244 rules in 21 ms. Remains 58 /182 variables (removed 124) and now considering 57/167 (removed 110) transitions.
// Phase 1: matrix 57 rows 58 cols
[2024-06-01 09:55:04] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 09:55:04] [INFO ] Implicit Places using invariants in 40 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/182 places, 57/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 56
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 56 cols
[2024-06-01 09:55:04] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 09:55:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:55:04] [INFO ] Invariant cache hit.
[2024-06-01 09:55:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 09:55:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/182 places, 56/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 56/182 places, 56/167 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-07
Stuttering criterion allowed to conclude after 9376 steps with 1 reset in 37 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-07 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U X(p2)))||G(p3))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 2 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-06-01 09:55:04] [INFO ] Computed 28 invariants in 2 ms
[2024-06-01 09:55:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 09:55:05] [INFO ] Invariant cache hit.
[2024-06-01 09:55:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 09:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:55:06] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:55:07] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:55:08] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:55:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8856 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:55:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:55:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:55:19] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:55:19] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:55:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:21] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:23] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18223 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27091ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27093ms
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27242 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13
Product exploration explored 100000 steps with 33499 reset in 183 ms.
Product exploration explored 100000 steps with 33259 reset in 195 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p2), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p3))), (X p1), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1)), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 58 factoid took 182 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1128 ms. (35 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
[2024-06-01 09:55:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 120/178 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 206 constraints, problems are : Problem set: 0 solved, 6 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Int declared 58/341 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 7/28 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p2), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p3))), (X p1), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1)), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p2 p3 (NOT p1))), (G (OR (NOT p0) p2 p3)), (G (OR p0 p2 p3 p1)), (G (OR p0 p2 p3 (NOT p1))), (G (OR (NOT p0) p2 p3 p1)), (G (OR p0 p2 p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p0) p2 (NOT p3) (NOT p1)))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p3) p1))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3 p1))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 64 factoid took 1000 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-01 09:55:35] [INFO ] Invariant cache hit.
[2024-06-01 09:55:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 09:55:35] [INFO ] Invariant cache hit.
[2024-06-01 09:55:35] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 09:55:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:36] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:55:37] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:55:38] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:40] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:41] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:55:41] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8979 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:55:46] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:55:46] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:55:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:55:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:55:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:55:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:55:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:49] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:55:49] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:55:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:55:50] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:51] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:55:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18339 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27336ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27338ms
Finished structural reductions in LTL mode , in 1 iterations and 27490 ms. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p1 p3))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p3))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 46 factoid took 152 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/22 properties
BEST_FIRST walk for 2041 steps (0 resets) in 20 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 p1 p3))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p3))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 46 factoid took 960 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33296 reset in 145 ms.
Product exploration explored 100000 steps with 33429 reset in 246 ms.
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-01 09:56:05] [INFO ] Invariant cache hit.
[2024-06-01 09:56:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 09:56:05] [INFO ] Invariant cache hit.
[2024-06-01 09:56:05] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 09:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:56:06] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:56:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:08] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:56:08] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:11] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:56:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:14] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:56:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:56:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:56:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:56:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:56:19] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:56:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 09:56:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17688 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 26518ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 26519ms
Finished structural reductions in LTL mode , in 1 iterations and 26678 ms. Remains : 178/178 places, 163/163 transitions.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 86842 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((G((X(p1)||p0))||F(p2)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-003B-LTLCardinality-04
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 182 transition count 131
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 146 transition count 131
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 72 place count 146 transition count 109
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 116 place count 124 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 123 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 123 transition count 108
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 220 place count 72 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 72 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 71 transition count 55
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 237 place count 64 transition count 59
Applied a total of 237 rules in 18 ms. Remains 64 /182 variables (removed 118) and now considering 59/167 (removed 108) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-06-01 09:56:32] [INFO ] Computed 28 invariants in 0 ms
[2024-06-01 09:56:32] [INFO ] Implicit Places using invariants in 41 ms returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/182 places, 59/167 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 62 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 58
Applied a total of 2 rules in 2 ms. Remains 61 /62 variables (removed 1) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 61 cols
[2024-06-01 09:56:32] [INFO ] Computed 26 invariants in 0 ms
[2024-06-01 09:56:32] [INFO ] Implicit Places using invariants in 39 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 60/182 places, 58/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 57
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 59 cols
[2024-06-01 09:56:32] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 09:56:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 09:56:32] [INFO ] Invariant cache hit.
[2024-06-01 09:56:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 09:56:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 59/182 places, 57/167 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 201 ms. Remains : 59/182 places, 57/167 transitions.
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 1 reset in 203 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 427 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 09:56:33] [INFO ] Invariant cache hit.
[2024-06-01 09:56:33] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 09:56:33] [INFO ] Invariant cache hit.
[2024-06-01 09:56:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 09:56:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-06-01 09:56:33] [INFO ] Invariant cache hit.
[2024-06-01 09:56:33] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 09:56:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 106 constraints, problems are : Problem set: 0 solved, 56 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 162 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1812ms
Finished structural reductions in LTL mode , in 1 iterations and 1912 ms. Remains : 59/59 places, 57/57 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 385 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 4 reset in 176 ms.
Product exploration explored 100000 steps with 4 reset in 217 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 09:56:37] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 09:56:37] [INFO ] Invariant cache hit.
[2024-06-01 09:56:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 09:56:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 106 constraints, problems are : Problem set: 0 solved, 56 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 162 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1824ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1831 ms. Remains : 59/59 places, 57/57 transitions.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 57/57 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 09:56:39] [INFO ] Invariant cache hit.
[2024-06-01 09:56:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:56:39] [INFO ] Invariant cache hit.
[2024-06-01 09:56:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 09:56:39] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-06-01 09:56:39] [INFO ] Invariant cache hit.
[2024-06-01 09:56:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 09:56:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 106 constraints, problems are : Problem set: 0 solved, 56 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/116 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 162 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1869ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1870ms
Finished structural reductions in LTL mode , in 1 iterations and 1982 ms. Remains : 59/59 places, 57/57 transitions.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-04 finished in 9620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U X(p2)))||G(p3))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 181 transition count 130
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 145 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 74 place count 144 transition count 107
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 118 place count 122 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 120 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 120 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 122 place count 120 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 208 place count 77 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 77 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 76 transition count 60
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 227 place count 68 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 64 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 231 place count 64 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 63 transition count 62
Applied a total of 233 rules in 21 ms. Remains 63 /182 variables (removed 119) and now considering 62/167 (removed 105) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-06-01 09:56:41] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 09:56:41] [INFO ] Implicit Places using invariants in 41 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/182 places, 62/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 61
Applied a total of 2 rules in 2 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-06-01 09:56:41] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 09:56:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:56:41] [INFO ] Invariant cache hit.
[2024-06-01 09:56:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 09:56:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 61/182 places, 61/167 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 153 ms. Remains : 61/182 places, 61/167 transitions.
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13
Product exploration explored 100000 steps with 27313 reset in 292 ms.
Product exploration explored 100000 steps with 27307 reset in 260 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p1), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
Knowledge based reduction with 32 factoid took 2485 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 880 ms. (45 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
[2024-06-01 09:56:45] [INFO ] Invariant cache hit.
[2024-06-01 09:56:45] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/39 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 54/93 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 25/118 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/121 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/121 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 89 constraints, problems are : Problem set: 0 solved, 6 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Int declared 24/122 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 7/25 constraints, State Equation: 0/61 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p1), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p2 p3 (NOT p1))), (G (OR (NOT p0) p2 p3)), (G (OR p0 p2 p3 p1)), (G (OR p0 p2 p3 (NOT p1))), (G (OR (NOT p0) p2 p3 p1)), (G (OR p0 p2 p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p0) p2 (NOT p3) (NOT p1)))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p3) p1))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3 p1))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 38 factoid took 3716 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 09:56:49] [INFO ] Invariant cache hit.
[2024-06-01 09:56:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 09:56:49] [INFO ] Invariant cache hit.
[2024-06-01 09:56:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 09:56:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 09:56:49] [INFO ] Invariant cache hit.
[2024-06-01 09:56:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:56:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:56:50] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:56:50] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 60/121 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 53 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 4/61 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 60/121 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 53/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 53 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints]
After SMT, in 1441ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1442ms
Finished structural reductions in LTL mode , in 1 iterations and 1541 ms. Remains : 61/61 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p1 p3)), (X (NOT (AND p0 p1 p3))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 p3))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
Knowledge based reduction with 20 factoid took 2461 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (9 resets) in 394 ms. (101 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p1 p3)), (X (NOT (AND p0 p1 p3))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 p3))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 20 factoid took 3464 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 27278 reset in 191 ms.
Stack based approach found an accepted trace after 82402 steps with 22670 reset with depth 21 and stack size 19 in 206 ms.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 17060 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 09:56:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 09:56:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 09:56:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 167 transitions and 430 arcs took 4 ms.
Total runtime 311160 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-003B-LTLCardinality-13

BK_STOP 1717235864709

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ltl formula name ShieldIIPt-PT-003B-LTLCardinality-04
ltl formula formula --ltl=/tmp/3574/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 182 places, 167 transitions and 430 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3574/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3574/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3574/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3574/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 184 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 183, there are 193 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~69 levels ~10000 states ~23084 transitions
pnml2lts-mc( 1/ 4): ~78 levels ~20000 states ~48144 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~40000 states ~103700 transitions
pnml2lts-mc( 1/ 4): ~152 levels ~80000 states ~211424 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~141!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31733
pnml2lts-mc( 0/ 4): unique states count: 77509
pnml2lts-mc( 0/ 4): unique transitions count: 328798
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 55937
pnml2lts-mc( 0/ 4): - claim found count: 62573
pnml2lts-mc( 0/ 4): - claim success count: 77525
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45605
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 77527 states 328843 transitions, fanout: 4.242
pnml2lts-mc( 0/ 4): Total exploration time 0.700 sec (0.700 sec minimum, 0.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 110753, Transitions per second: 469776
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.3MB, 11.8 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.3MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-003B-LTLCardinality-13
ltl formula formula --ltl=/tmp/3574/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 182 places, 167 transitions and 430 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3574/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3574/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3574/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3574/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 183 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 183, there are 1585 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~110 levels ~10000 states ~27828 transitions
pnml2lts-mc( 1/ 4): ~110 levels ~20000 states ~62920 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~40000 states ~130396 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~80000 states ~285484 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~160000 states ~580208 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~320000 states ~1238856 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~640000 states ~2485432 transitions
pnml2lts-mc( 1/ 4): ~142 levels ~1280000 states ~5484504 transitions
pnml2lts-mc( 2/ 4): ~631060 levels ~2560000 states ~15920192 transitions
pnml2lts-mc( 2/ 4): ~1260284 levels ~5120000 states ~32980224 transitions
pnml2lts-mc( 2/ 4): ~2517197 levels ~10240000 states ~68221016 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1862453
pnml2lts-mc( 0/ 4): unique states count: 10276709
pnml2lts-mc( 0/ 4): unique transitions count: 68731194
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 9008583
pnml2lts-mc( 0/ 4): - claim found count: 22775912
pnml2lts-mc( 0/ 4): - claim success count: 10276719
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7651826
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10276721 states 68731223 transitions, fanout: 6.688
pnml2lts-mc( 0/ 4): Total exploration time 44.440 sec (44.420 sec minimum, 44.427 sec on average)
pnml2lts-mc( 0/ 4): States per second: 231249, Transitions per second: 1546607
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 319.1MB, 10.0 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 319.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-003B, 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 r528-tall-171683760600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-PT-003B 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;