About the Execution of ITS-Tools for DiscoveryGPU-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 396.340 | 34812.00 | 53401.00 | 284.40 | TFFFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132700443.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 itstools
Input is DiscoveryGPU-PT-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700443
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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-11a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716378105162
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 11:41:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:41:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:41:46] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-22 11:41:46] [INFO ] Transformed 113 places.
[2024-05-22 11:41:46] [INFO ] Transformed 155 transitions.
[2024-05-22 11:41:46] [INFO ] Found NUPN structural information;
[2024-05-22 11:41:46] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 146
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 96 transition count 138
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 96 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 91 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 91 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 91 transition count 122
Applied a total of 50 rules in 31 ms. Remains 91 /113 variables (removed 22) and now considering 122/155 (removed 33) transitions.
// Phase 1: matrix 122 rows 91 cols
[2024-05-22 11:41:46] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 11:41:46] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 11:41:46] [INFO ] Invariant cache hit.
[2024-05-22 11:41:46] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-22 11:41:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 122/155 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 90/113 places, 122/155 transitions.
Support contains 34 out of 90 places after structural reductions.
[2024-05-22 11:41:47] [INFO ] Flatten gal took : 27 ms
[2024-05-22 11:41:47] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:41:47] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 33 out of 90 places (down from 34) after GAL structural reductions.
RANDOM walk for 31145 steps (258 resets) in 898 ms. (34 steps per ms) remains 0/20 properties
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 236 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 236 edges and 90 vertex of which 88 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 88 transition count 117
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 11 place count 82 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 82 transition count 114
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 55 place count 61 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 63 place count 53 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 53 transition count 77
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 79 place count 45 transition count 61
Iterating global reduction 3 with 8 rules applied. Total rules applied 87 place count 45 transition count 61
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 37 transition count 53
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 37 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 111 place count 29 transition count 37
Iterating global reduction 3 with 8 rules applied. Total rules applied 119 place count 29 transition count 37
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 21 transition count 29
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 21 transition count 29
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 136 place count 21 transition count 29
Applied a total of 136 rules in 31 ms. Remains 21 /90 variables (removed 69) and now considering 29/122 (removed 93) transitions.
[2024-05-22 11:41:47] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2024-05-22 11:41:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:41:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 11:41:47] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-22 11:41:47] [INFO ] Invariant cache hit.
[2024-05-22 11:41:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 11:41:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-22 11:41:47] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-22 11:41:47] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-22 11:41:47] [INFO ] Invariant cache hit.
[2024-05-22 11:41:48] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/46 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/46 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 747ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/90 places, 29/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 876 ms. Remains : 21/90 places, 29/122 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-01 finished in 1085 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((X(p1)||p0))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 87 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 87 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 85 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 85 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 116
Applied a total of 12 rules in 13 ms. Remains 84 /90 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 84 cols
[2024-05-22 11:41:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:41:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 11:41:48] [INFO ] Invariant cache hit.
[2024-05-22 11:41:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:41:49] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-22 11:41:49] [INFO ] Invariant cache hit.
[2024-05-22 11:41:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/200 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 56/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 141 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/200 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 56/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 115/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 256 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 4185ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 4187ms
Starting structural reductions in LTL mode, iteration 1 : 84/90 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4360 ms. Remains : 84/90 places, 116/122 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-02 finished in 4509 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 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 236 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 105 edges and 86 vertex of which 78 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Graph (trivial) has 79 edges and 78 vertex of which 38 / 78 are part of one of the 19 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 103
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 42 place count 51 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 48 transition count 81
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 54 place count 39 transition count 63
Iterating global reduction 3 with 9 rules applied. Total rules applied 63 place count 39 transition count 63
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 72 place count 30 transition count 45
Iterating global reduction 3 with 9 rules applied. Total rules applied 81 place count 30 transition count 45
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 24 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 24 transition count 33
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 18 transition count 27
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 18 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 17 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 109 place count 16 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 16 transition count 24
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 11 transition count 19
Applied a total of 118 rules in 25 ms. Remains 11 /90 variables (removed 79) and now considering 19/122 (removed 103) transitions.
[2024-05-22 11:41:53] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2024-05-22 11:41:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:41:53] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 11:41:53] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-22 11:41:53] [INFO ] Invariant cache hit.
[2024-05-22 11:41:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 11:41:53] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-22 11:41:53] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-22 11:41:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 6/26 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 57 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 6/26 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 80 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/90 places, 19/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 11/90 places, 19/122 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-04 finished in 347 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(F(p1)))&&p0))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 84 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 84 transition count 116
Applied a total of 12 rules in 6 ms. Remains 84 /90 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 84 cols
[2024-05-22 11:41:53] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:41:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:41:53] [INFO ] Invariant cache hit.
[2024-05-22 11:41:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:41:53] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-22 11:41:53] [INFO ] Invariant cache hit.
[2024-05-22 11:41:53] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/200 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 56/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 141 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/200 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 56/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 115/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 256 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 4050ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 4052ms
Starting structural reductions in LTL mode, iteration 1 : 84/90 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4207 ms. Remains : 84/90 places, 116/122 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-05
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-05 finished in 4368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(((X(p1) U G(p1)) U p2)))))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 117
Applied a total of 10 rules in 10 ms. Remains 85 /90 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 85 cols
[2024-05-22 11:41:58] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:41:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:41:58] [INFO ] Invariant cache hit.
[2024-05-22 11:41:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 11:41:58] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-22 11:41:58] [INFO ] Invariant cache hit.
[2024-05-22 11:41:58] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/202 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 143 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/202 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 116/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 259 constraints, problems are : Problem set: 0 solved, 116 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 3899ms
Starting structural reductions in LTL mode, iteration 1 : 85/90 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4032 ms. Remains : 85/90 places, 117/122 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-06
Product exploration explored 100000 steps with 953 reset in 285 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 43 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-06 finished in 4721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 83 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 83 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 114
Applied a total of 16 rules in 5 ms. Remains 82 /90 variables (removed 8) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 11:42:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:42:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 11:42:02] [INFO ] Invariant cache hit.
[2024-05-22 11:42:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:02] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:02] [INFO ] Invariant cache hit.
[2024-05-22 11:42:03] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3778ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3781ms
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3919 ms. Remains : 82/90 places, 114/122 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-09 finished in 4063 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(p0)||F(p1)))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 236 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 105 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 84 edges and 77 vertex of which 44 / 77 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 55 transition count 101
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 44 place count 46 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 54 place count 36 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 64 place count 36 transition count 59
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 27 transition count 41
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 27 transition count 41
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 19 transition count 25
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 19 transition count 25
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 11 transition count 17
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 11 transition count 17
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 116 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 10 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 7 transition count 11
Applied a total of 122 rules in 15 ms. Remains 7 /90 variables (removed 83) and now considering 11/122 (removed 111) transitions.
[2024-05-22 11:42:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 7 cols
[2024-05-22 11:42:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:42:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 11:42:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:42:06] [INFO ] Invariant cache hit.
[2024-05-22 11:42:06] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 11:42:06] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 11:42:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/90 places, 11/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 7/90 places, 11/122 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-11 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1) U p2))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 83 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 83 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 114
Applied a total of 16 rules in 5 ms. Remains 82 /90 variables (removed 8) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 11:42:07] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:42:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 11:42:07] [INFO ] Invariant cache hit.
[2024-05-22 11:42:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:07] [INFO ] Invariant cache hit.
[2024-05-22 11:42:07] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3838ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3840ms
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3967 ms. Remains : 82/90 places, 114/122 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-13 finished in 4724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 83 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 83 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 114
Applied a total of 16 rules in 4 ms. Remains 82 /90 variables (removed 8) and now considering 114/122 (removed 8) transitions.
[2024-05-22 11:42:11] [INFO ] Invariant cache hit.
[2024-05-22 11:42:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 11:42:11] [INFO ] Invariant cache hit.
[2024-05-22 11:42:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:11] [INFO ] Invariant cache hit.
[2024-05-22 11:42:11] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3724ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3726ms
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3831 ms. Remains : 82/90 places, 114/122 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-14 finished in 3950 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(p0))&&F(p1))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 83 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 83 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 114
Applied a total of 16 rules in 8 ms. Remains 82 /90 variables (removed 8) and now considering 114/122 (removed 8) transitions.
[2024-05-22 11:42:15] [INFO ] Invariant cache hit.
[2024-05-22 11:42:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:42:15] [INFO ] Invariant cache hit.
[2024-05-22 11:42:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 11:42:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:42:15] [INFO ] Invariant cache hit.
[2024-05-22 11:42:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3791ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3793ms
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3907 ms. Remains : 82/90 places, 114/122 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-15 finished in 4146 ms.
All properties solved by simple procedures.
Total runtime 33637 ms.
BK_STOP 1716378139974
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-11a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DiscoveryGPU-PT-11a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132700443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;