Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K Apr 12 02:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 02:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K 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-09b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716363590998

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:39:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:39:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-22 07:39:52] [INFO ] Transformed 268 places.
[2024-05-22 07:39:52] [INFO ] Transformed 284 transitions.
[2024-05-22 07:39:52] [INFO ] Found NUPN structural information;
[2024-05-22 07:39:52] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 251 transition count 284
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 58 place count 210 transition count 243
Iterating global reduction 1 with 41 rules applied. Total rules applied 99 place count 210 transition count 243
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 201 transition count 234
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 201 transition count 234
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 194 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 194 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 136 place count 189 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 141 place count 189 transition count 222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 146 place count 184 transition count 212
Iterating global reduction 1 with 5 rules applied. Total rules applied 151 place count 184 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 156 place count 179 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 161 place count 179 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 165 place count 175 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 169 place count 175 transition count 203
Applied a total of 169 rules in 97 ms. Remains 175 /268 variables (removed 93) and now considering 203/284 (removed 81) transitions.
// Phase 1: matrix 203 rows 175 cols
[2024-05-22 07:39:52] [INFO ] Computed 2 invariants in 17 ms
[2024-05-22 07:39:52] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 07:39:53] [INFO ] Invariant cache hit.
[2024-05-22 07:39:53] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-22 07:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 203/377 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 29 ms to minimize.
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:39:56] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:39:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 1/378 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 195 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/377 variables, 174/194 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 201/395 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 397 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 18/18 constraints]
After SMT, in 25068ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 25082ms
Starting structural reductions in LTL mode, iteration 1 : 175/268 places, 203/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25638 ms. Remains : 175/268 places, 203/284 transitions.
Support contains 27 out of 175 places after structural reductions.
[2024-05-22 07:40:18] [INFO ] Flatten gal took : 53 ms
[2024-05-22 07:40:18] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:40:18] [INFO ] Input system was already deterministic with 203 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (132 resets) in 1019 ms. (39 steps per ms) remains 1/16 properties
BEST_FIRST walk for 13856 steps (7 resets) in 49 ms. (277 steps per ms) remains 0/1 properties
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 341 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 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((p0||G(F(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Graph (complete) has 341 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 170 transition count 173
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 144 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 143 transition count 172
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 55 place count 143 transition count 146
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 107 place count 117 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 114 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 114 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 113 place count 114 transition count 142
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 115 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 111 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 111 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 109 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 109 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 108 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 108 transition count 136
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 209 place count 66 transition count 94
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 59 transition count 80
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 59 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 52 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 52 transition count 72
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 45 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 45 transition count 59
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 38 transition count 51
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 38 transition count 51
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 272 place count 31 transition count 38
Iterating global reduction 3 with 7 rules applied. Total rules applied 279 place count 31 transition count 38
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 286 place count 24 transition count 30
Iterating global reduction 3 with 7 rules applied. Total rules applied 293 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 23 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 23 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 23 transition count 28
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 297 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 299 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 306 place count 16 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 310 place count 12 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 316 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 9 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 7 transition count 13
Applied a total of 319 rules in 50 ms. Remains 7 /175 variables (removed 168) and now considering 13/203 (removed 190) transitions.
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 7 cols
[2024-05-22 07:40:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 07:40:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 07:40:19] [INFO ] Invariant cache hit.
[2024-05-22 07:40:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 07:40:19] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 07:40:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 142 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 91 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/175 places, 13/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 7/175 places, 13/203 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-02 finished in 653 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(G(p0))&&F(p1))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Graph (complete) has 341 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 170 transition count 175
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 146 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 145 transition count 174
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 51 place count 145 transition count 148
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 103 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 116 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 114 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 114 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 112 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 112 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 110 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 110 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 109 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 109 transition count 136
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 205 place count 68 transition count 95
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 212 place count 61 transition count 81
Iterating global reduction 3 with 7 rules applied. Total rules applied 219 place count 61 transition count 81
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 226 place count 54 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 233 place count 54 transition count 73
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 239 place count 48 transition count 62
Iterating global reduction 3 with 6 rules applied. Total rules applied 245 place count 48 transition count 62
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 251 place count 42 transition count 55
Iterating global reduction 3 with 6 rules applied. Total rules applied 257 place count 42 transition count 55
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 262 place count 37 transition count 46
Iterating global reduction 3 with 5 rules applied. Total rules applied 267 place count 37 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 33 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 33 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 32 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 32 transition count 40
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 278 place count 32 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 46 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 283 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 284 place count 27 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 290 place count 24 transition count 33
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 20 transition count 29
Applied a total of 294 rules in 42 ms. Remains 20 /175 variables (removed 155) and now considering 29/203 (removed 174) transitions.
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 20 cols
[2024-05-22 07:40:19] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 07:40:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-22 07:40:19] [INFO ] Invariant cache hit.
[2024-05-22 07:40:19] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-22 07:40:19] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 07:40:19] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-22 07:40:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 24/39 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 5/44 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 20 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 24/39 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 5/44 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 41 constraints, problems are : Problem set: 0 solved, 20 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/175 places, 29/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 20/175 places, 29/203 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-03 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p2)||p1))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 162 transition count 189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 162 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 159 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 159 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 156 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 156 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 154 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 154 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 153 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 153 transition count 178
Applied a total of 44 rules in 18 ms. Remains 153 /175 variables (removed 22) and now considering 178/203 (removed 25) transitions.
// Phase 1: matrix 178 rows 153 cols
[2024-05-22 07:40:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 07:40:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 07:40:20] [INFO ] Invariant cache hit.
[2024-05-22 07:40:20] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 07:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/330 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 07:40:22] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 07:40:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:40:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-22 07:40:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 17/171 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 1/331 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 172 constraints, problems are : Problem set: 0 solved, 177 unsolved in 7400 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/330 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 176/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 1/331 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/331 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 349 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 17/17 constraints]
After SMT, in 18421ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18428ms
Starting structural reductions in LTL mode, iteration 1 : 153/175 places, 178/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18638 ms. Remains : 153/175 places, 178/203 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 304 edges and 153 vertex of which 149 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-10 finished in 19217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(F(p2))&&p1))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 196
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 164 transition count 191
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 164 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 161 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 161 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 186
Applied a total of 30 rules in 11 ms. Remains 160 /175 variables (removed 15) and now considering 186/203 (removed 17) transitions.
// Phase 1: matrix 186 rows 160 cols
[2024-05-22 07:40:39] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 07:40:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 07:40:39] [INFO ] Invariant cache hit.
[2024-05-22 07:40:39] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-22 07:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/345 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:40:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:40:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 1/346 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/346 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 178 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7966 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/345 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 184/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 363 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints]
After SMT, in 19140ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 19143ms
Starting structural reductions in LTL mode, iteration 1 : 160/175 places, 186/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19328 ms. Remains : 160/175 places, 186/203 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 316 edges and 160 vertex of which 157 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-11 finished in 19755 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((F(p1)||G(p0)))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 174 transition count 203
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 165 transition count 194
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 165 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 163 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 163 transition count 191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 162 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 162 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 161 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 161 transition count 189
Applied a total of 27 rules in 16 ms. Remains 161 /175 variables (removed 14) and now considering 189/203 (removed 14) transitions.
// Phase 1: matrix 189 rows 161 cols
[2024-05-22 07:40:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:40:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 07:40:59] [INFO ] Invariant cache hit.
[2024-05-22 07:40:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2024-05-22 07:40:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 189/350 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 15/178 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/350 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 178 constraints, problems are : Problem set: 0 solved, 188 unsolved in 7179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/350 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 188/366 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 366 constraints, problems are : Problem set: 0 solved, 188 unsolved in 7599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 15/15 constraints]
After SMT, in 14833ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 14835ms
Starting structural reductions in LTL mode, iteration 1 : 161/175 places, 189/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15035 ms. Remains : 161/175 places, 189/203 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 325 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-13 finished in 15439 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 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Graph (complete) has 341 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 170 transition count 173
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 144 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 143 transition count 172
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 55 place count 143 transition count 148
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 103 place count 119 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 115 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 115 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 111 place count 115 transition count 143
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 113 place count 114 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 112 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 112 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 110 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 108 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 108 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 107 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 107 transition count 134
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 211 place count 65 transition count 92
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 58 transition count 78
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 58 transition count 78
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 51 transition count 70
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 51 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 246 place count 44 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 253 place count 44 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 260 place count 37 transition count 49
Iterating global reduction 3 with 7 rules applied. Total rules applied 267 place count 37 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 273 place count 31 transition count 38
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 31 transition count 38
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 284 place count 26 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 289 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 25 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 25 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 25 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 300 place count 18 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 303 place count 15 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 303 place count 15 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 14 transition count 21
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 5 with 2 rules applied. Total rules applied 307 place count 13 transition count 20
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 5 with 2 rules applied. Total rules applied 309 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 314 place count 9 transition count 15
Applied a total of 314 rules in 35 ms. Remains 9 /175 variables (removed 166) and now considering 15/203 (removed 188) transitions.
[2024-05-22 07:41:14] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 9 cols
[2024-05-22 07:41:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 07:41:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 07:41:14] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 07:41:14] [INFO ] Invariant cache hit.
[2024-05-22 07:41:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 07:41:14] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 07:41:14] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 07:41:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 49 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/21 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 49 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/175 places, 15/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 9/175 places, 15/203 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-14 finished in 296 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)||(p1 U X(p2))))'
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 203/203 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 174 transition count 203
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 164 transition count 193
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 164 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 161 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 161 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 159 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 159 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 157 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 155 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 155 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 154 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 154 transition count 181
Applied a total of 41 rules in 15 ms. Remains 154 /175 variables (removed 21) and now considering 181/203 (removed 22) transitions.
// Phase 1: matrix 181 rows 154 cols
[2024-05-22 07:41:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:41:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 07:41:15] [INFO ] Invariant cache hit.
[2024-05-22 07:41:15] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 07:41:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/335 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:41:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 07:41:18] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:41:18] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:41:18] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:41:18] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 168 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/335 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 180/348 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 348 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 12/12 constraints]
After SMT, in 13014ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 13017ms
Starting structural reductions in LTL mode, iteration 1 : 154/175 places, 181/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13200 ms. Remains : 154/175 places, 181/203 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 310 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 21 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09b-LTLCardinality-15 finished in 13731 ms.
All properties solved by simple procedures.
Total runtime 96513 ms.
ITS solved all properties within timeout

BK_STOP 1716363688828

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DiscoveryGPU-PT-09b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131100419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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