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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 13K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 02:42 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 46K 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-13a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193077141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:04:38] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-31 22:04:38] [INFO ] Transformed 133 places.
[2024-05-31 22:04:38] [INFO ] Transformed 183 transitions.
[2024-05-31 22:04:38] [INFO ] Found NUPN structural information;
[2024-05-31 22:04:38] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 125 transition count 175
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 125 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 117 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 117 transition count 167
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 110 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 110 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 110 transition count 147
Applied a total of 52 rules in 40 ms. Remains 110 /133 variables (removed 23) and now considering 147/183 (removed 36) transitions.
// Phase 1: matrix 147 rows 110 cols
[2024-05-31 22:04:38] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:04:38] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-31 22:04:38] [INFO ] Invariant cache hit.
[2024-05-31 22:04:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-31 22:04:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 147/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 465 ms. Remains : 109/133 places, 147/183 transitions.
Support contains 22 out of 109 places after structural reductions.
[2024-05-31 22:04:39] [INFO ] Flatten gal took : 30 ms
[2024-05-31 22:04:39] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:04:39] [INFO ] Input system was already deterministic with 147 transitions.
RANDOM walk for 1685 steps (9 resets) in 151 ms. (11 steps per ms) remains 0/17 properties
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 283 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 13 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-31 22:04:39] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 22:04:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 22:04:39] [INFO ] Invariant cache hit.
[2024-05-31 22:04:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 22:04:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-31 22:04:39] [INFO ] Invariant cache hit.
[2024-05-31 22:04:39] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 133/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5622ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5635ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5833 ms. Remains : 96/109 places, 134/147 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-00 finished in 6078 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((G(p0)||X((p1||X(p2)))||G(p3))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 102 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 102 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 99 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 99 transition count 137
Applied a total of 20 rules in 11 ms. Remains 99 /109 variables (removed 10) and now considering 137/147 (removed 10) transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-31 22:04:45] [INFO ] Computed 1 invariants in 3 ms
[2024-05-31 22:04:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 22:04:45] [INFO ] Invariant cache hit.
[2024-05-31 22:04:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-31 22:04:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:04:45] [INFO ] Invariant cache hit.
[2024-05-31 22:04:45] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 136/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 303 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5555ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5557ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 137/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5720 ms. Remains : 99/109 places, 137/147 transitions.
Stuttering acceptance computed with spot in 511 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-01
Product exploration explored 100000 steps with 33344 reset in 420 ms.
Product exploration explored 100000 steps with 33346 reset in 196 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/99 stabilizing places and 14/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p3), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Knowledge based reduction with 19 factoid took 561 ms. Reduced automaton from 13 states, 32 edges and 4 AP (stutter sensitive) to 13 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40001 steps (278 resets) in 630 ms. (63 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40003 steps (24 resets) in 170 ms. (233 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (23 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
[2024-05-31 22:04:53] [INFO ] Invariant cache hit.
[2024-05-31 22:04:53] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 31/37 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 40/77 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 29/106 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 29/135 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 38/173 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 35/208 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 24/232 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/232 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/234 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 2/236 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 31/37 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 40/77 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/106 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/106 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 29/135 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/135 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/135 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Int declared 173/236 variables, and 120 constraints, problems are : Problem set: 3 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 73/99 constraints, ReadFeed: 43/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 268ms 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) (NOT p3) p1 (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p3), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p1)), (G (OR p0 p1 (NOT p3))), (G (OR p0 p1 p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p0) p3 p2))), (F p0), (F (NOT (OR p0 (NOT p3) p2))), (F p3), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p3) p2))), (F (NOT (OR (NOT p0) (NOT p3))))]
Knowledge based reduction with 22 factoid took 1511 ms. Reduced automaton from 13 states, 32 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 699 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:04:56] [INFO ] Invariant cache hit.
[2024-05-31 22:04:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 22:04:57] [INFO ] Invariant cache hit.
[2024-05-31 22:04:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-31 22:04:57] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:04:57] [INFO ] Invariant cache hit.
[2024-05-31 22:04:57] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 136/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 303 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 6254ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 6257ms
Finished structural reductions in LTL mode , in 1 iterations and 6496 ms. Remains : 99/99 places, 137/137 transitions.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/99 stabilizing places and 14/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X p3), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Knowledge based reduction with 12 factoid took 514 ms. Reduced automaton from 13 states, 29 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (281 resets) in 137 ms. (289 steps per ms) remains 3/18 properties
BEST_FIRST walk for 13536 steps (5 resets) in 16 ms. (796 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X p3), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F p2), (F (NOT p1)), (F (NOT (OR p3 (NOT p0)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p3) (NOT p0) p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p3) p0 p2))), (F (NOT (OR p3 (NOT p0) p2))), (F p3), (F (NOT (OR (NOT p3) p0))), (F (NOT (AND (NOT p3) (NOT p0)))), (F p0), (F (NOT (OR (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p3) p2)))]
Knowledge based reduction with 12 factoid took 1401 ms. Reduced automaton from 13 states, 29 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 550 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 508 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 33410 reset in 162 ms.
Product exploration explored 100000 steps with 33440 reset in 206 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 137/137 transitions.
Graph (complete) has 270 edges and 99 vertex of which 98 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 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 98 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 136
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 29 place count 98 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 87 transition count 140
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 87 transition count 140
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 72 place count 66 transition count 98
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 93 place count 66 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 103 place count 56 transition count 88
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 113 place count 56 transition count 88
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 123 place count 46 transition count 68
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 133 place count 46 transition count 68
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 152 place count 27 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 171 place count 27 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 171 rules in 28 ms. Remains 27 /99 variables (removed 72) and now considering 39/137 (removed 98) transitions.
[2024-05-31 22:05:08] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-31 22:05:08] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 27 cols
[2024-05-31 22:05:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 22:05:08] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/61 variables, 27/28 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 18/46 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/47 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 12 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 12 solved, 26 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 33/53 variables, 20/21 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 17/38 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 26/64 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/64 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 6/59 variables, 6/70 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 2/61 variables, 2/72 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/62 variables, 1/73 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/73 constraints. Problems are: Problem set: 12 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/62 variables, 0/73 constraints. Problems are: Problem set: 12 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 73 constraints, problems are : Problem set: 12 solved, 26 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 26/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 704ms problems are : Problem set: 12 solved, 26 unsolved
Search for dead transitions found 12 dead transitions in 704ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 27/99 places, 27/137 transitions.
Graph (complete) has 58 edges and 27 vertex of which 20 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 20 /27 variables (removed 7) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/99 places, 27/137 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 739 ms. Remains : 20/99 places, 27/137 transitions.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-31 22:05:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 22:05:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:05:09] [INFO ] Invariant cache hit.
[2024-05-31 22:05:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-31 22:05:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:05:09] [INFO ] Invariant cache hit.
[2024-05-31 22:05:09] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3069 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 136/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 303 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5460ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5462ms
Finished structural reductions in LTL mode , in 1 iterations and 5610 ms. Remains : 99/99 places, 137/137 transitions.
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-01 finished in 29266 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((F((X(p1)&&p0))&&(G(p2)||F(p3)))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 102 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 102 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 99 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 99 transition count 137
Applied a total of 20 rules in 6 ms. Remains 99 /109 variables (removed 10) and now considering 137/147 (removed 10) transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-31 22:05:15] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 22:05:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:05:15] [INFO ] Invariant cache hit.
[2024-05-31 22:05:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-31 22:05:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-31 22:05:15] [INFO ] Invariant cache hit.
[2024-05-31 22:05:15] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/236 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 136/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 303 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5538ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5540ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 137/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5684 ms. Remains : 99/109 places, 137/147 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-02
Stuttering criterion allowed to conclude after 1856 steps with 24 reset in 8 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-02 finished in 6008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 3 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-31 22:05:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 22:05:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 22:05:21] [INFO ] Invariant cache hit.
[2024-05-31 22:05:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 22:05:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-31 22:05:21] [INFO ] Invariant cache hit.
[2024-05-31 22:05:21] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 133/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5201ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5203ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5325 ms. Remains : 96/109 places, 134/147 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-05 finished in 5411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(p0) U p1)))&&X(F(p2))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 101 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 101 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 97 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 97 transition count 135
Applied a total of 24 rules in 4 ms. Remains 97 /109 variables (removed 12) and now considering 135/147 (removed 12) transitions.
// Phase 1: matrix 135 rows 97 cols
[2024-05-31 22:05:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 22:05:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 22:05:26] [INFO ] Invariant cache hit.
[2024-05-31 22:05:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 22:05:26] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-31 22:05:26] [INFO ] Invariant cache hit.
[2024-05-31 22:05:26] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/232 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 66/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 164 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/232 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 66/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 134/298 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 298 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 5438ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 5440ms
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 135/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5566 ms. Remains : 97/109 places, 135/147 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-06
Product exploration explored 100000 steps with 727 reset in 169 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 52 in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-06 finished in 5936 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(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 7 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-31 22:05:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 22:05:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 22:05:32] [INFO ] Invariant cache hit.
[2024-05-31 22:05:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 22:05:32] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-31 22:05:32] [INFO ] Invariant cache hit.
[2024-05-31 22:05:32] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2898 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/230 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 133/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5176ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5177ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5331 ms. Remains : 96/109 places, 134/147 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-09 finished in 5459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Graph (complete) has 283 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 123 edges and 102 vertex of which 91 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 101 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 55 place count 53 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 41 transition count 68
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 41 transition count 68
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 29 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 29 transition count 44
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 114 place count 18 transition count 22
Iterating global reduction 2 with 11 rules applied. Total rules applied 125 place count 18 transition count 22
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 136 place count 7 transition count 11
Iterating global reduction 2 with 11 rules applied. Total rules applied 147 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 149 place count 6 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 6 transition count 9
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 152 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 5 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 4 transition count 7
Applied a total of 155 rules in 23 ms. Remains 4 /109 variables (removed 105) and now considering 7/147 (removed 140) transitions.
[2024-05-31 22:05:37] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-31 22:05:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:05:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 22:05:37] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-31 22:05:37] [INFO ] Invariant cache hit.
[2024-05-31 22:05:37] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-31 22:05:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 22:05:37] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-31 22:05:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/109 places, 7/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 4/109 places, 7/147 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-12 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 105 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 103 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 103 transition count 141
Applied a total of 12 rules in 9 ms. Remains 103 /109 variables (removed 6) and now considering 141/147 (removed 6) transitions.
// Phase 1: matrix 141 rows 103 cols
[2024-05-31 22:05:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 22:05:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 22:05:38] [INFO ] Invariant cache hit.
[2024-05-31 22:05:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 22:05:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-31 22:05:38] [INFO ] Invariant cache hit.
[2024-05-31 22:05:38] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/244 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 68/172 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 172 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/244 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 68/172 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 140/312 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 312 constraints, problems are : Problem set: 0 solved, 140 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 5739ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 5740ms
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 141/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5915 ms. Remains : 103/109 places, 141/147 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-14
Stuttering criterion allowed to conclude after 291 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-14 finished in 6072 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((G(p0)||X((p1||X(p2)))||G(p3))))'
[2024-05-31 22:05:44] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:05:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:05:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 147 transitions and 429 arcs took 4 ms.
Total runtime 65906 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193144523

--------------------
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
mcc2024
ltl formula name DiscoveryGPU-PT-13a-LTLCardinality-01
ltl formula formula --ltl=/tmp/1440/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 109 places, 147 transitions and 429 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1440/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1440/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1440/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1440/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 18 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 111 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 110, there are 573 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~118!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 298
pnml2lts-mc( 0/ 4): unique transitions count: 3429
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 138
pnml2lts-mc( 0/ 4): - claim success count: 304
pnml2lts-mc( 0/ 4): - cum. max stack depth: 304
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 304 states 3475 transitions, fanout: 11.431
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10133, Transitions per second: 115833
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.2 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 147 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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