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-171631132500388.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-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132500388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 54K 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-07b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717192107074

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:48:28] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-31 21:48:28] [INFO ] Transformed 212 places.
[2024-05-31 21:48:28] [INFO ] Transformed 224 transitions.
[2024-05-31 21:48:28] [INFO ] Found NUPN structural information;
[2024-05-31 21:48:28] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 46 place count 166 transition count 192
Iterating global reduction 1 with 32 rules applied. Total rules applied 78 place count 166 transition count 192
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 158 transition count 184
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 158 transition count 184
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 152 transition count 178
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 152 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 147 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 147 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 145 transition count 169
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 145 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 144 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 144 transition count 168
Applied a total of 122 rules in 88 ms. Remains 144 /212 variables (removed 68) and now considering 168/224 (removed 56) transitions.
// Phase 1: matrix 168 rows 144 cols
[2024-05-31 21:48:29] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 21:48:29] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-31 21:48:29] [INFO ] Invariant cache hit.
[2024-05-31 21:48:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-31 21:48:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/312 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 15 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:48:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/312 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 160 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/312 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 167/327 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 327 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 14/14 constraints]
After SMT, in 12566ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 12578ms
Starting structural reductions in LTL mode, iteration 1 : 144/212 places, 168/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13218 ms. Remains : 144/212 places, 168/224 transitions.
Support contains 27 out of 144 places after structural reductions.
[2024-05-31 21:48:42] [INFO ] Flatten gal took : 35 ms
[2024-05-31 21:48:42] [INFO ] Flatten gal took : 13 ms
[2024-05-31 21:48:42] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 26 out of 144 places (down from 27) after GAL structural reductions.
RANDOM walk for 3842 steps (14 resets) in 239 ms. (16 steps per ms) remains 0/23 properties
FORMULA DiscoveryGPU-PT-07b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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&&X((F(p1)&&X(X(G(p2))))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 127 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 125 transition count 146
Applied a total of 38 rules in 10 ms. Remains 125 /144 variables (removed 19) and now considering 146/168 (removed 22) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-31 21:48:42] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:48:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:48:42] [INFO ] Invariant cache hit.
[2024-05-31 21:48:43] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-31 21:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:48:44] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 141 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 286 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4463 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 14/14 constraints]
After SMT, in 9191ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 9193ms
Starting structural reductions in LTL mode, iteration 1 : 125/144 places, 146/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9364 ms. Remains : 125/144 places, 146/168 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 134 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-00 finished in 9900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 126 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 126 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 123 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 123 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 122 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 122 transition count 142
Applied a total of 44 rules in 23 ms. Remains 122 /144 variables (removed 22) and now considering 142/168 (removed 26) transitions.
// Phase 1: matrix 142 rows 122 cols
[2024-05-31 21:48:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:48:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 21:48:52] [INFO ] Invariant cache hit.
[2024-05-31 21:48:52] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-31 21:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/264 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:48:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:48:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:48:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 139 constraints, problems are : Problem set: 0 solved, 141 unsolved in 4419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/264 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 141/280 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 280 constraints, problems are : Problem set: 0 solved, 141 unsolved in 4633 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 15/15 constraints]
After SMT, in 9088ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 9090ms
Starting structural reductions in LTL mode, iteration 1 : 122/144 places, 142/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9237 ms. Remains : 122/144 places, 142/168 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-01 finished in 9402 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 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 130 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 127 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 125 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 124 transition count 145
Applied a total of 40 rules in 15 ms. Remains 124 /144 variables (removed 20) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 124 cols
[2024-05-31 21:49:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:49:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 21:49:02] [INFO ] Invariant cache hit.
[2024-05-31 21:49:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-31 21:49:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-31 21:49:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:49:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
[2024-05-31 21:49:04] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 15/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 141 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/285 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 285 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 15/15 constraints]
After SMT, in 8884ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 8886ms
Starting structural reductions in LTL mode, iteration 1 : 124/144 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9041 ms. Remains : 124/144 places, 145/168 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1151 steps with 4 reset in 13 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-02 finished in 9153 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) U (p1&&G(p0)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 5 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-31 21:49:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:49:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 21:49:11] [INFO ] Invariant cache hit.
[2024-05-31 21:49:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-31 21:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-31 21:49:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:49:12] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:49:13] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 134 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3897 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 11/11 constraints]
After SMT, in 7870ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 7872ms
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8010 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-03 finished in 8162 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(F(p0))))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 10 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
[2024-05-31 21:49:19] [INFO ] Invariant cache hit.
[2024-05-31 21:49:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 21:49:19] [INFO ] Invariant cache hit.
[2024-05-31 21:49:19] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-31 21:49:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:21] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 134 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4064 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 11/11 constraints]
After SMT, in 8012ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8013ms
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8145 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-04
Stuttering criterion allowed to conclude after 212 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-04 finished in 8297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 141 transition count 140
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 116 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 51 place count 116 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 92 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 92 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 92 transition count 114
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 101 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 89 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 88 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 87 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 87 transition count 109
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 177 place count 53 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 48 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 48 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 43 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 43 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 202 place count 38 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 38 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 212 place count 33 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 217 place count 33 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 28 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 28 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 232 place count 23 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 22 transition count 27
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 241 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 250 place count 15 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 11 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 6 transition count 11
Applied a total of 264 rules in 60 ms. Remains 6 /144 variables (removed 138) and now considering 11/168 (removed 157) transitions.
[2024-05-31 21:49:27] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-31 21:49:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:49:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 21:49:27] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-31 21:49:27] [INFO ] Invariant cache hit.
[2024-05-31 21:49:27] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-31 21:49:27] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 21:49:27] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-31 21:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 124 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 42 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/144 places, 11/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 6/144 places, 11/168 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-05 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 134 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 134 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 128 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 128 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 124 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 124 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 121 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 120 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 120 transition count 140
Applied a total of 48 rules in 14 ms. Remains 120 /144 variables (removed 24) and now considering 140/168 (removed 28) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-31 21:49:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:49:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 21:49:28] [INFO ] Invariant cache hit.
[2024-05-31 21:49:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-31 21:49:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-31 21:49:29] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:49:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:49:30] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
After SMT, in 8249ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 8251ms
Starting structural reductions in LTL mode, iteration 1 : 120/144 places, 140/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8415 ms. Remains : 120/144 places, 140/168 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-06
Product exploration explored 100000 steps with 17666 reset in 186 ms.
Product exploration explored 100000 steps with 17685 reset in 109 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/120 stabilizing places and 23/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-31 21:49:37] [INFO ] Invariant cache hit.
[2024-05-31 21:49:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 21:49:38] [INFO ] Invariant cache hit.
[2024-05-31 21:49:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-31 21:49:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:49:39] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:40] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
After SMT, in 8238ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 8240ms
Finished structural reductions in LTL mode , in 1 iterations and 8381 ms. Remains : 120/120 places, 140/140 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/120 stabilizing places and 23/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17635 reset in 67 ms.
Product exploration explored 100000 steps with 17713 reset in 73 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Graph (complete) has 241 edges and 120 vertex of which 119 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 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 119 transition count 139
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 15 place count 119 transition count 139
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 38 place count 119 transition count 139
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 56 place count 119 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 116 transition count 143
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 116 transition count 143
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 116 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 110 transition count 161
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 110 transition count 161
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 92 transition count 131
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 92 transition count 131
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 143 place count 74 transition count 101
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 161 place count 74 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 68 transition count 95
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 68 transition count 95
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 185 place count 56 transition count 77
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 197 place count 56 transition count 77
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 221 place count 32 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 245 place count 32 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 249 place count 32 transition count 37
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 250 place count 31 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 251 place count 31 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 251 rules in 31 ms. Remains 31 /120 variables (removed 89) and now considering 36/140 (removed 104) transitions.
[2024-05-31 21:49:47] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-31 21:49:47] [INFO ] Flow matrix only has 35 transitions (discarded 1 similar events)
// Phase 1: matrix 35 rows 31 cols
[2024-05-31 21:49:47] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:49:47] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 21:49:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 21:49:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 33 unsolved
Problem TDEAD0 is UNSAT
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 TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 4 (OVERLAPS) 34/65 variables, 31/35 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 14/49 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/50 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/50 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/50 constraints. Problems are: Problem set: 22 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 50 constraints, problems are : Problem set: 22 solved, 13 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 22 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/4 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 32/47 variables, 15/19 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 13/32 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 13/45 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/45 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 16/63 variables, 15/60 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/60 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/65 variables, 2/62 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/66 variables, 1/63 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/63 constraints. Problems are: Problem set: 22 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/66 variables, 0/63 constraints. Problems are: Problem set: 22 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 63 constraints, problems are : Problem set: 22 solved, 13 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 13/35 constraints, Known Traps: 2/2 constraints]
After SMT, in 567ms problems are : Problem set: 22 solved, 13 unsolved
Search for dead transitions found 22 dead transitions in 568ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 31/120 places, 14/140 transitions.
Graph (complete) has 33 edges and 31 vertex of which 13 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 13 /31 variables (removed 18) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/120 places, 14/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 607 ms. Remains : 13/120 places, 14/140 transitions.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-31 21:49:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:49:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 21:49:48] [INFO ] Invariant cache hit.
[2024-05-31 21:49:48] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-31 21:49:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:49:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3738 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
After SMT, in 7865ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 7866ms
Finished structural reductions in LTL mode , in 1 iterations and 7990 ms. Remains : 120/120 places, 140/140 transitions.
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-06 finished in 28326 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 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 141 transition count 141
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 117 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 49 place count 117 transition count 120
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 92 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 89 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 88 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 87 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 87 transition count 108
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 173 place count 55 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 51 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 51 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 47 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 43 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 39 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 39 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 35 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 35 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 31 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 31 transition count 40
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 223 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 29 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 228 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 26 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 23 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 34 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 18 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 16 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 14 transition count 21
Applied a total of 249 rules in 30 ms. Remains 14 /144 variables (removed 130) and now considering 21/168 (removed 147) transitions.
[2024-05-31 21:49:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-31 21:49:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:49:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 21:49:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-31 21:49:56] [INFO ] Invariant cache hit.
[2024-05-31 21:49:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-31 21:49:56] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-31 21:49:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-31 21:49:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/31 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/144 places, 21/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 14/144 places, 21/168 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-07 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 141 transition count 141
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 117 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 116 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 51 place count 116 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 91 place count 96 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 92 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 92 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 99 place count 92 transition count 114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 89 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 88 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 87 transition count 109
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 175 place count 54 transition count 76
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 49 transition count 66
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 49 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 190 place count 44 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 195 place count 44 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 40 transition count 53
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 36 transition count 48
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 36 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 32 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 223 place count 28 transition count 36
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 228 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 27 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 240 place count 20 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 244 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 252 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 255 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 258 place count 9 transition count 15
Applied a total of 258 rules in 41 ms. Remains 9 /144 variables (removed 135) and now considering 15/168 (removed 153) transitions.
[2024-05-31 21:49:56] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2024-05-31 21:49:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:49:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 21:49:57] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-31 21:49:57] [INFO ] Invariant cache hit.
[2024-05-31 21:49:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 21:49:57] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 21:49:57] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-31 21:49:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 51 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 47 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/144 places, 15/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 9/144 places, 15/168 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-09 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(F(p1))))&&X(p0))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 8 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-31 21:49:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:49:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 21:49:57] [INFO ] Invariant cache hit.
[2024-05-31 21:49:57] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-31 21:49:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-31 21:49:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:49:58] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:49:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 133 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 10/10 constraints]
After SMT, in 7858ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 7859ms
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7998 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 212 steps with 4 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-10 finished in 8261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(X(p0))))||(p1&&G(F(p2)))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 125 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 121 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 121 transition count 141
Applied a total of 46 rules in 10 ms. Remains 121 /144 variables (removed 23) and now considering 141/168 (removed 27) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-31 21:50:05] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:50:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 21:50:05] [INFO ] Invariant cache hit.
[2024-05-31 21:50:05] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-31 21:50:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:50:07] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 138 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/278 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 278 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 15/15 constraints]
After SMT, in 8422ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8424ms
Starting structural reductions in LTL mode, iteration 1 : 121/144 places, 141/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8567 ms. Remains : 121/144 places, 141/168 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 365 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-11 finished in 9097 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 141 transition count 140
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 116 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 115 transition count 139
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 53 place count 115 transition count 119
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 95 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 90 transition count 112
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 90 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 103 place count 90 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 86 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 85 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 84 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 84 transition count 105
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 181 place count 51 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 187 place count 45 transition count 60
Iterating global reduction 3 with 6 rules applied. Total rules applied 193 place count 45 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 199 place count 39 transition count 53
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 39 transition count 53
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 210 place count 34 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 215 place count 34 transition count 44
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 29 transition count 38
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 29 transition count 38
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 24 transition count 29
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 24 transition count 29
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 240 place count 19 transition count 23
Iterating global reduction 3 with 5 rules applied. Total rules applied 245 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 250 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 255 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 5 transition count 8
Applied a total of 265 rules in 23 ms. Remains 5 /144 variables (removed 139) and now considering 8/168 (removed 160) transitions.
[2024-05-31 21:50:14] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-31 21:50:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:50:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 21:50:14] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-31 21:50:14] [INFO ] Invariant cache hit.
[2024-05-31 21:50:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-31 21:50:14] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 21:50:14] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-31 21:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[State Equation: 5/5 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 39 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/144 places, 8/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 5/144 places, 8/168 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-12 finished in 222 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&&F(p1))) U G((G(p2) U p3)))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 136 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 136 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 131 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 131 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 128 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 128 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 125 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 124 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 124 transition count 145
Applied a total of 40 rules in 9 ms. Remains 124 /144 variables (removed 20) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 124 cols
[2024-05-31 21:50:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:50:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 21:50:14] [INFO ] Invariant cache hit.
[2024-05-31 21:50:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-31 21:50:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:50:16] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:50:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:50:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:50:17] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:50:17] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:50:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 139 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 283 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 13/13 constraints]
After SMT, in 8806ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 8808ms
Starting structural reductions in LTL mode, iteration 1 : 124/144 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8953 ms. Remains : 124/144 places, 145/168 transitions.
Stuttering acceptance computed with spot in 845 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-14 finished in 9840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-07b-LTLFireability-06
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 144/144 places, 168/168 transitions.
Graph (complete) has 279 edges and 144 vertex of which 142 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 142 transition count 140
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 116 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 53 place count 116 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 93 place count 96 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 98 place count 91 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 103 place count 91 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 103 place count 91 transition count 112
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 105 place count 90 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 87 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 86 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 85 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 85 transition count 106
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 185 place count 50 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 44 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 44 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 38 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 38 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 32 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 32 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 227 place count 26 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 233 place count 26 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 239 place count 20 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 20 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 251 place count 14 transition count 16
Iterating global reduction 2 with 6 rules applied. Total rules applied 257 place count 14 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 13 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 13 transition count 15
Applied a total of 259 rules in 19 ms. Remains 13 /144 variables (removed 131) and now considering 15/168 (removed 153) transitions.
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 13 cols
[2024-05-31 21:50:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:50:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 21:50:25] [INFO ] Invariant cache hit.
[2024-05-31 21:50:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 21:50:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/144 places, 15/168 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 9 transition count 11
Applied a total of 7 rules in 3 ms. Remains 9 /12 variables (removed 3) and now considering 11/15 (removed 4) transitions.
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2024-05-31 21:50:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:50:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:25] [INFO ] Invariant cache hit.
[2024-05-31 21:50:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 21:50:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/144 places, 11/168 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 151 ms. Remains : 9/144 places, 11/168 transitions.
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLFireability-06
Product exploration explored 100000 steps with 20000 reset in 98 ms.
Product exploration explored 100000 steps with 20000 reset in 93 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/9 stabilizing places and 9/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-31 21:50:26] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:26] [INFO ] Invariant cache hit.
[2024-05-31 21:50:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 21:50:26] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:26] [INFO ] Invariant cache hit.
[2024-05-31 21:50:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 21:50:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-31 21:50:26] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:26] [INFO ] Invariant cache hit.
[2024-05-31 21:50:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 9/9 places, 11/11 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/9 stabilizing places and 9/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 126 ms.
Product exploration explored 100000 steps with 20000 reset in 86 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-31 21:50:28] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 21:50:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:28] [INFO ] Invariant cache hit.
[2024-05-31 21:50:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 9/9 places, 11/11 transitions.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-31 21:50:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:28] [INFO ] Invariant cache hit.
[2024-05-31 21:50:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 21:50:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:28] [INFO ] Invariant cache hit.
[2024-05-31 21:50:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 21:50:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-31 21:50:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-31 21:50:28] [INFO ] Invariant cache hit.
[2024-05-31 21:50:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 9/18 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 9/9 places, 11/11 transitions.
Treatment of property DiscoveryGPU-PT-07b-LTLFireability-06 finished in 3830 ms.
[2024-05-31 21:50:28] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:50:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 21:50:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 168 transitions and 444 arcs took 3 ms.
Total runtime 120049 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DiscoveryGPU-PT-07b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717192228804

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DiscoveryGPU-PT-07b-LTLFireability-06
ltl formula formula --ltl=/tmp/2012/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 144 places, 168 transitions and 444 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2012/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2012/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2012/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2012/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 146 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 145, there are 174 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 390
pnml2lts-mc( 0/ 4): unique states count: 390
pnml2lts-mc( 0/ 4): unique transitions count: 845
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 546
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 62
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 467 states 1185 transitions, fanout: 2.537
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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.3 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 168 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-07b"
export BK_EXAMINATION="LTLFireability"
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-07b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07b.tgz
mv DiscoveryGPU-PT-07b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;