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.r135-tall-171631131200491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DiscoveryGPU-PT-14a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131200491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 DiscoveryGPU-PT-14a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716371327149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:48:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 09:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:48:48] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-22 09:48:48] [INFO ] Transformed 143 places.
[2024-05-22 09:48:48] [INFO ] Transformed 197 transitions.
[2024-05-22 09:48:48] [INFO ] Found NUPN structural information;
[2024-05-22 09:48:48] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 186
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 123 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 123 transition count 177
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 114 transition count 159
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 114 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 114 transition count 154
Applied a total of 63 rules in 46 ms. Remains 114 /143 variables (removed 29) and now considering 154/197 (removed 43) transitions.
// Phase 1: matrix 154 rows 114 cols
[2024-05-22 09:48:48] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 09:48:49] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 09:48:49] [INFO ] Invariant cache hit.
[2024-05-22 09:48:49] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-22 09:48:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 407 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 154/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 473 ms. Remains : 113/143 places, 154/197 transitions.
Support contains 25 out of 113 places after structural reductions.
[2024-05-22 09:48:49] [INFO ] Flatten gal took : 32 ms
[2024-05-22 09:48:49] [INFO ] Flatten gal took : 18 ms
[2024-05-22 09:48:49] [INFO ] Input system was already deterministic with 154 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 1904 steps (9 resets) in 112 ms. (16 steps per ms) remains 0/17 properties
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 300 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 109 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 149
Applied a total of 10 rules in 20 ms. Remains 108 /113 variables (removed 5) and now considering 149/154 (removed 5) transitions.
// Phase 1: matrix 149 rows 108 cols
[2024-05-22 09:48:49] [INFO ] Computed 1 invariants in 8 ms
[2024-05-22 09:48:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 09:48:49] [INFO ] Invariant cache hit.
[2024-05-22 09:48:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 09:48:50] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-22 09:48:50] [INFO ] Invariant cache hit.
[2024-05-22 09:48:50] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/257 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 73/182 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/257 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 182 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/257 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 73/182 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 148/330 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/257 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 330 constraints, problems are : Problem set: 0 solved, 148 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 7448ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 7465ms
Starting structural reductions in LTL mode, iteration 1 : 108/113 places, 149/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7688 ms. Remains : 108/113 places, 149/154 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 293 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Detected a total of 16/108 stabilizing places and 15/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-01 finished in 8669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(!p0) U X(G(p1))))))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 147
Applied a total of 14 rules in 11 ms. Remains 106 /113 variables (removed 7) and now considering 147/154 (removed 7) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-22 09:48:58] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 09:48:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 09:48:58] [INFO ] Invariant cache hit.
[2024-05-22 09:48:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 09:48:58] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 09:48:58] [INFO ] Invariant cache hit.
[2024-05-22 09:48:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 179 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 146/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 325 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 6260ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 6263ms
Starting structural reductions in LTL mode, iteration 1 : 106/113 places, 147/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6609 ms. Remains : 106/113 places, 147/154 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-03
Product exploration explored 100000 steps with 5427 reset in 236 ms.
Product exploration explored 100000 steps with 5287 reset in 310 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 290 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 570 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (261 resets) in 182 ms. (218 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
[2024-05-22 09:49:06] [INFO ] Invariant cache hit.
[2024-05-22 09:49:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/253 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/106 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 147/147 transitions.
Graph (complete) has 290 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 104 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 104 transition count 144
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 5 place count 103 transition count 144
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 59 place count 76 transition count 117
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 64 transition count 93
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 64 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 53 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 53 transition count 71
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 116 place count 42 transition count 60
Iterating global reduction 2 with 11 rules applied. Total rules applied 127 place count 42 transition count 60
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 137 place count 32 transition count 40
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 32 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 23 transition count 31
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 23 transition count 31
Applied a total of 165 rules in 33 ms. Remains 23 /106 variables (removed 83) and now considering 31/147 (removed 116) transitions.
[2024-05-22 09:49:06] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 23 cols
[2024-05-22 09:49:06] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:49:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 09:49:06] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-22 09:49:06] [INFO ] Invariant cache hit.
[2024-05-22 09:49:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 09:49:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-22 09:49:07] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-22 09:49:07] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-22 09:49:07] [INFO ] Invariant cache hit.
[2024-05-22 09:49:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/50 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/106 places, 31/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 23/106 places, 31/147 transitions.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 67 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 458 steps (3 resets) in 10 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 230 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-03 finished in 9670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((F(G(p0))&&G(p1))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 105 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 105 transition count 146
Applied a total of 16 rules in 8 ms. Remains 105 /113 variables (removed 8) and now considering 146/154 (removed 8) transitions.
// Phase 1: matrix 146 rows 105 cols
[2024-05-22 09:49:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 09:49:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 09:49:08] [INFO ] Invariant cache hit.
[2024-05-22 09:49:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 09:49:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 09:49:08] [INFO ] Invariant cache hit.
[2024-05-22 09:49:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/251 variables, 105/106 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 178 constraints, problems are : Problem set: 0 solved, 145 unsolved in 3541 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/251 variables, 105/106 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 145/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 323 constraints, problems are : Problem set: 0 solved, 145 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
After SMT, in 6182ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 6183ms
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 146/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6332 ms. Remains : 105/113 places, 146/154 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-06
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-06 finished in 6508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 105 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 103 transition count 144
Applied a total of 20 rules in 7 ms. Remains 103 /113 variables (removed 10) and now considering 144/154 (removed 10) transitions.
// Phase 1: matrix 144 rows 103 cols
[2024-05-22 09:49:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 09:49:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 09:49:14] [INFO ] Invariant cache hit.
[2024-05-22 09:49:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 09:49:14] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-22 09:49:14] [INFO ] Invariant cache hit.
[2024-05-22 09:49:14] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 143/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 318 constraints, problems are : Problem set: 0 solved, 143 unsolved in 2603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 6036ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 6038ms
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6176 ms. Remains : 103/113 places, 144/154 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-08
Product exploration explored 100000 steps with 673 reset in 215 ms.
Product exploration explored 100000 steps with 672 reset in 189 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 18 factoid took 381 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (260 resets) in 215 ms. (185 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
[2024-05-22 09:49:22] [INFO ] Invariant cache hit.
[2024-05-22 09:49:22] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
At refinement iteration 6 (OVERLAPS) 32/43 variables, 17/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 14/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/84 variables, 14/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 14/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/114 variables, 14/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 29/143 variables, 14/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 13/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 52/195 variables, 14/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/195 variables, 12/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/195 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 50/245 variables, 25/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/245 variables, 13/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/245 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/247 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 1 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 11/247 variables, and 8 constraints, problems are : Problem set: 3 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/103 constraints, ReadFeed: 3/71 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p2 p0)), (G (OR p2 (NOT p1) p0)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p2 p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 497 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 144/144 transitions.
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 102 transition count 142
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 3 place count 101 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 55 place count 75 transition count 116
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 68 place count 62 transition count 90
Iterating global reduction 0 with 13 rules applied. Total rules applied 81 place count 62 transition count 90
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 94 place count 49 transition count 64
Iterating global reduction 0 with 13 rules applied. Total rules applied 107 place count 49 transition count 64
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 120 place count 36 transition count 51
Iterating global reduction 0 with 13 rules applied. Total rules applied 133 place count 36 transition count 51
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 25 transition count 29
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 place count 25 transition count 29
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 166 place count 14 transition count 18
Iterating global reduction 0 with 11 rules applied. Total rules applied 177 place count 14 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 14 transition count 18
Applied a total of 178 rules in 20 ms. Remains 14 /103 variables (removed 89) and now considering 18/144 (removed 126) transitions.
[2024-05-22 09:49:23] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 09:49:23] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:49:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 09:49:23] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:23] [INFO ] Invariant cache hit.
[2024-05-22 09:49:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 09:49:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-22 09:49:23] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-22 09:49:23] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:23] [INFO ] Invariant cache hit.
[2024-05-22 09:49:23] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 293ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/103 places, 18/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 14/103 places, 18/144 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40009 steps (485 resets) in 37 ms. (1052 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-05-22 09:49:23] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:23] [INFO ] Invariant cache hit.
[2024-05-22 09:49:23] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/22 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/28 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/30 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 22/31 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/14 constraints, ReadFeed: 4/12 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 356 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1080 reset in 94 ms.
Product exploration explored 100000 steps with 1084 reset in 95 ms.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 09:49:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:24] [INFO ] Invariant cache hit.
[2024-05-22 09:49:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 09:49:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:24] [INFO ] Invariant cache hit.
[2024-05-22 09:49:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 09:49:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 09:49:24] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-22 09:49:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:24] [INFO ] Invariant cache hit.
[2024-05-22 09:49:24] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 14/14 places, 18/18 transitions.
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-08 finished in 10434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((G(p2)||p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 105 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 103 transition count 144
Applied a total of 20 rules in 5 ms. Remains 103 /113 variables (removed 10) and now considering 144/154 (removed 10) transitions.
// Phase 1: matrix 144 rows 103 cols
[2024-05-22 09:49:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 09:49:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 09:49:25] [INFO ] Invariant cache hit.
[2024-05-22 09:49:25] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 09:49:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-22 09:49:25] [INFO ] Invariant cache hit.
[2024-05-22 09:49:25] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 143/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 318 constraints, problems are : Problem set: 0 solved, 143 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 6132ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 6134ms
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6283 ms. Remains : 103/113 places, 144/154 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-13
Stuttering criterion allowed to conclude after 233 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-13 finished in 6497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1)||F(p2))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 147
Applied a total of 14 rules in 9 ms. Remains 106 /113 variables (removed 7) and now considering 147/154 (removed 7) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-22 09:49:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 09:49:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 09:49:31] [INFO ] Invariant cache hit.
[2024-05-22 09:49:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 09:49:31] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 09:49:31] [INFO ] Invariant cache hit.
[2024-05-22 09:49:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 179 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/253 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 72/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 146/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 325 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 6159ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 6161ms
Starting structural reductions in LTL mode, iteration 1 : 106/113 places, 147/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6319 ms. Remains : 106/113 places, 147/154 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 290 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-14 finished in 6927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||G(p2)||p0)))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-14a-LTLCardinality-08
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Graph (complete) has 300 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 110 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 106 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 106 transition count 146
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 11 place count 105 transition count 146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 101 transition count 142
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 101 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 71 place count 75 transition count 116
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 62 transition count 90
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 62 transition count 90
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 49 transition count 64
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 49 transition count 64
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 136 place count 36 transition count 51
Iterating global reduction 2 with 13 rules applied. Total rules applied 149 place count 36 transition count 51
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 160 place count 25 transition count 29
Iterating global reduction 2 with 11 rules applied. Total rules applied 171 place count 25 transition count 29
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 182 place count 14 transition count 18
Iterating global reduction 2 with 11 rules applied. Total rules applied 193 place count 14 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 14 transition count 18
Applied a total of 194 rules in 25 ms. Remains 14 /113 variables (removed 99) and now considering 18/154 (removed 136) transitions.
[2024-05-22 09:49:38] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 09:49:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 09:49:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 09:49:38] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:38] [INFO ] Invariant cache hit.
[2024-05-22 09:49:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 09:49:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-22 09:49:38] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:38] [INFO ] Invariant cache hit.
[2024-05-22 09:49:38] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 325ms
Starting structural reductions in LI_LTL mode, iteration 1 : 14/113 places, 18/154 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 404 ms. Remains : 14/113 places, 18/154 transitions.
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-08
Product exploration explored 100000 steps with 1081 reset in 84 ms.
Product exploration explored 100000 steps with 1079 reset in 94 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 18 factoid took 277 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40017 steps (484 resets) in 98 ms. (404 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (91 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (81 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (92 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
[2024-05-22 09:49:40] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:40] [INFO ] Invariant cache hit.
[2024-05-22 09:49:40] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
At refinement iteration 6 (OVERLAPS) 10/22 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/26 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/28 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/30 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 1 solved, 2 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 12/31 variables, and 9 constraints, problems are : Problem set: 3 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/14 constraints, ReadFeed: 4/12 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p2 p0)), (G (OR p2 (NOT p1) p0)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p2 p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 531 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 09:49:40] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:40] [INFO ] Invariant cache hit.
[2024-05-22 09:49:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 09:49:40] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:40] [INFO ] Invariant cache hit.
[2024-05-22 09:49:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 09:49:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-22 09:49:40] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-22 09:49:40] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:40] [INFO ] Invariant cache hit.
[2024-05-22 09:49:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 14/14 places, 18/18 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 213 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40004 steps (475 resets) in 21 ms. (1818 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (99 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-22 09:49:41] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:41] [INFO ] Invariant cache hit.
[2024-05-22 09:49:41] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/22 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/28 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/30 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 22/31 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/14 constraints, ReadFeed: 4/12 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 312 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1083 reset in 94 ms.
Product exploration explored 100000 steps with 1080 reset in 96 ms.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 09:49:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:42] [INFO ] Invariant cache hit.
[2024-05-22 09:49:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 09:49:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:42] [INFO ] Invariant cache hit.
[2024-05-22 09:49:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 09:49:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 09:49:42] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-22 09:49:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 09:49:42] [INFO ] Invariant cache hit.
[2024-05-22 09:49:42] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 14/14 places, 18/18 transitions.
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-08 finished in 4270 ms.
[2024-05-22 09:49:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:49:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-22 09:49:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 154 transitions and 455 arcs took 32 ms.
Total runtime 54449 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-14a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 113
TRANSITIONS: 154
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1345
MODEL NAME: /home/mcc/execution/412/model
113 places, 154 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716371383685

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="DiscoveryGPU-PT-14a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DiscoveryGPU-PT-14a, 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 r135-tall-171631131200491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14a.tgz
mv DiscoveryGPU-PT-14a 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 ;