Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.9K Feb 25 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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-13b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678326029710

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:40:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 01:40:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:40:33] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-09 01:40:33] [INFO ] Transformed 380 places.
[2023-03-09 01:40:33] [INFO ] Transformed 404 transitions.
[2023-03-09 01:40:33] [INFO ] Found NUPN structural information;
[2023-03-09 01:40:33] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 355 transition count 404
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 86 place count 294 transition count 343
Iterating global reduction 1 with 61 rules applied. Total rules applied 147 place count 294 transition count 343
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 158 place count 283 transition count 332
Iterating global reduction 1 with 11 rules applied. Total rules applied 169 place count 283 transition count 332
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 178 place count 274 transition count 323
Iterating global reduction 1 with 9 rules applied. Total rules applied 187 place count 274 transition count 323
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 193 place count 268 transition count 317
Iterating global reduction 1 with 6 rules applied. Total rules applied 199 place count 268 transition count 317
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 204 place count 263 transition count 307
Iterating global reduction 1 with 5 rules applied. Total rules applied 209 place count 263 transition count 307
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 214 place count 258 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 219 place count 258 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 223 place count 254 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 227 place count 254 transition count 298
Applied a total of 227 rules in 191 ms. Remains 254 /380 variables (removed 126) and now considering 298/404 (removed 106) transitions.
// Phase 1: matrix 298 rows 254 cols
[2023-03-09 01:40:34] [INFO ] Computed 2 place invariants in 25 ms
[2023-03-09 01:40:34] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 01:40:34] [INFO ] Invariant cache hit.
[2023-03-09 01:40:35] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2023-03-09 01:40:35] [INFO ] Invariant cache hit.
[2023-03-09 01:40:35] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/380 places, 298/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1501 ms. Remains : 254/380 places, 298/404 transitions.
Support contains 29 out of 254 places after structural reductions.
[2023-03-09 01:40:35] [INFO ] Flatten gal took : 103 ms
[2023-03-09 01:40:35] [INFO ] Flatten gal took : 47 ms
[2023-03-09 01:40:36] [INFO ] Input system was already deterministic with 298 transitions.
Finished random walk after 1443 steps, including 3 resets, run visited all 15 properties in 181 ms. (steps per millisecond=7 )
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 505 edges and 254 vertex of which 249 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Graph (complete) has 505 edges and 254 vertex of which 249 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 248 transition count 258
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 213 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 211 transition count 256
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 75 place count 211 transition count 215
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 157 place count 170 transition count 215
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 165 place count 162 transition count 206
Iterating global reduction 3 with 8 rules applied. Total rules applied 173 place count 162 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 173 place count 162 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 161 transition count 205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 182 place count 154 transition count 196
Iterating global reduction 3 with 7 rules applied. Total rules applied 189 place count 154 transition count 196
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 148 transition count 186
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 148 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 205 place count 144 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 144 transition count 182
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 317 place count 90 transition count 128
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 327 place count 80 transition count 108
Iterating global reduction 3 with 10 rules applied. Total rules applied 337 place count 80 transition count 108
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 347 place count 70 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 357 place count 70 transition count 98
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 366 place count 61 transition count 80
Iterating global reduction 3 with 9 rules applied. Total rules applied 375 place count 61 transition count 80
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 384 place count 52 transition count 71
Iterating global reduction 3 with 9 rules applied. Total rules applied 393 place count 52 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 402 place count 43 transition count 53
Iterating global reduction 3 with 9 rules applied. Total rules applied 411 place count 43 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 419 place count 35 transition count 45
Iterating global reduction 3 with 8 rules applied. Total rules applied 427 place count 35 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 428 place count 35 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 429 place count 35 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 431 place count 33 transition count 42
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 37 edges and 31 vertex of which 28 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 removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 440 place count 28 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 446 place count 22 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 454 place count 18 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 456 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 460 place count 14 transition count 23
Applied a total of 460 rules in 158 ms. Remains 14 /254 variables (removed 240) and now considering 23/298 (removed 275) transitions.
[2023-03-09 01:40:36] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-09 01:40:36] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-09 01:40:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 01:40:36] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2023-03-09 01:40:36] [INFO ] Invariant cache hit.
[2023-03-09 01:40:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-09 01:40:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 01:40:36] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2023-03-09 01:40:36] [INFO ] Invariant cache hit.
[2023-03-09 01:40:36] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/254 places, 23/298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 14/254 places, 23/298 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s10 0) (EQ s4 1)), p0:(OR (EQ s7 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2966 steps with 63 reset in 47 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-00 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Graph (complete) has 505 edges and 254 vertex of which 250 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 249 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 211 transition count 256
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 77 place count 211 transition count 215
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 159 place count 170 transition count 215
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 166 place count 163 transition count 207
Iterating global reduction 2 with 7 rules applied. Total rules applied 173 place count 163 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 173 place count 163 transition count 206
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 162 transition count 206
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 156 transition count 198
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 156 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 152 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 152 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 150 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 150 transition count 190
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 317 place count 91 transition count 131
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 81 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 81 transition count 111
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 71 transition count 101
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 71 transition count 101
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 61 transition count 81
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 61 transition count 81
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 51 transition count 71
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 51 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 407 place count 41 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 41 transition count 51
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 427 place count 31 transition count 41
Iterating global reduction 2 with 10 rules applied. Total rules applied 437 place count 31 transition count 41
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 31 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 441 place count 29 transition count 37
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 32 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 452 place count 24 transition count 26
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 461 place count 16 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 467 place count 13 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 471 place count 10 transition count 18
Applied a total of 471 rules in 116 ms. Remains 10 /254 variables (removed 244) and now considering 18/298 (removed 280) transitions.
[2023-03-09 01:40:37] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-09 01:40:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:40:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 01:40:37] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2023-03-09 01:40:37] [INFO ] Invariant cache hit.
[2023-03-09 01:40:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-09 01:40:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 01:40:37] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2023-03-09 01:40:37] [INFO ] Invariant cache hit.
[2023-03-09 01:40:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 18/298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 10/254 places, 18/298 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s7 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-01 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(F(p1)||G(p2)))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 298
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 243 transition count 288
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 243 transition count 288
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 237 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 237 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 232 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 232 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 227 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 227 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 224 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 224 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 222 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 220 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 220 transition count 260
Applied a total of 67 rules in 83 ms. Remains 220 /254 variables (removed 34) and now considering 260/298 (removed 38) transitions.
// Phase 1: matrix 260 rows 220 cols
[2023-03-09 01:40:37] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-09 01:40:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-09 01:40:37] [INFO ] Invariant cache hit.
[2023-03-09 01:40:38] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-09 01:40:38] [INFO ] Invariant cache hit.
[2023-03-09 01:40:38] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/254 places, 260/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 220/254 places, 260/298 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s141 0) (EQ s135 1)) (OR (EQ s181 0) (EQ s86 1))), p1:(EQ s102 1), p2:(OR (EQ s181 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1079 reset in 491 ms.
Stack based approach found an accepted trace after 87734 steps with 965 reset with depth 145 and stack size 145 in 496 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-03 finished in 1967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 298
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 241 transition count 285
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 241 transition count 285
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 233 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 233 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 226 transition count 267
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 226 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 220 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 220 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 216 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 216 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 213 transition count 251
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 213 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 210 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 210 transition count 248
Applied a total of 87 rules in 36 ms. Remains 210 /254 variables (removed 44) and now considering 248/298 (removed 50) transitions.
// Phase 1: matrix 248 rows 210 cols
[2023-03-09 01:40:39] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:40:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 01:40:39] [INFO ] Invariant cache hit.
[2023-03-09 01:40:39] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 01:40:39] [INFO ] Invariant cache hit.
[2023-03-09 01:40:40] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/254 places, 248/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 210/254 places, 248/298 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s172 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-04 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 298
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 243 transition count 287
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 243 transition count 287
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 237 transition count 281
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 237 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 232 transition count 275
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 232 transition count 275
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 228 transition count 271
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 228 transition count 271
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 224 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 224 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 221 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 221 transition count 261
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 218 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 218 transition count 258
Applied a total of 71 rules in 66 ms. Remains 218 /254 variables (removed 36) and now considering 258/298 (removed 40) transitions.
// Phase 1: matrix 258 rows 218 cols
[2023-03-09 01:40:40] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:40:40] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 01:40:40] [INFO ] Invariant cache hit.
[2023-03-09 01:40:40] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-09 01:40:40] [INFO ] Invariant cache hit.
[2023-03-09 01:40:40] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/254 places, 258/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 218/254 places, 258/298 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s167 1)), p1:(OR (EQ s149 0) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 290 reset in 378 ms.
Product exploration explored 100000 steps with 289 reset in 522 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 443 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 1692 steps, including 3 resets, run visited all 2 properties in 53 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 258/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-09 01:40:42] [INFO ] Invariant cache hit.
[2023-03-09 01:40:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 01:40:42] [INFO ] Invariant cache hit.
[2023-03-09 01:40:43] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-09 01:40:43] [INFO ] Invariant cache hit.
[2023-03-09 01:40:43] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 218/218 places, 258/258 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 443 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 282 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2244 steps, including 4 resets, run visited all 2 properties in 18 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 296 reset in 261 ms.
Entered a terminal (fully accepting) state of product in 26798 steps with 79 reset in 105 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-06 finished in 4785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 243 transition count 286
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 243 transition count 286
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 236 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 236 transition count 277
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 230 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 230 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 225 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 225 transition count 265
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 222 transition count 260
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 222 transition count 260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 220 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 220 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 218 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 218 transition count 256
Applied a total of 72 rules in 35 ms. Remains 218 /254 variables (removed 36) and now considering 256/298 (removed 42) transitions.
// Phase 1: matrix 256 rows 218 cols
[2023-03-09 01:40:45] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:40:45] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 01:40:45] [INFO ] Invariant cache hit.
[2023-03-09 01:40:45] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-09 01:40:45] [INFO ] Invariant cache hit.
[2023-03-09 01:40:45] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/254 places, 256/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 218/254 places, 256/298 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s204 0) (EQ s66 1)), p1:(AND (NEQ s173 0) (NEQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 441 edges and 218 vertex of which 215 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-10 finished in 1420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0||G(p1)))))||F(p2))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 298
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 244 transition count 288
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 244 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 237 transition count 279
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 237 transition count 279
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 230 transition count 271
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 230 transition count 271
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 224 transition count 265
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 224 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 221 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 221 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 219 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 219 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 217 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 217 transition count 256
Applied a total of 73 rules in 38 ms. Remains 217 /254 variables (removed 37) and now considering 256/298 (removed 42) transitions.
// Phase 1: matrix 256 rows 217 cols
[2023-03-09 01:40:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:40:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 01:40:46] [INFO ] Invariant cache hit.
[2023-03-09 01:40:46] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-09 01:40:46] [INFO ] Invariant cache hit.
[2023-03-09 01:40:47] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/254 places, 256/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 217/254 places, 256/298 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}]], initial=1, aps=[p2:(OR (EQ s178 0) (EQ s53 1)), p0:(EQ s124 0), p1:(AND (EQ s216 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 43 stabilizing places and 43 stable transitions
Graph (complete) has 437 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 43 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-11 finished in 1679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 298/298 transitions.
Graph (complete) has 505 edges and 254 vertex of which 249 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 248 transition count 257
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 212 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 211 transition count 256
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 75 place count 211 transition count 216
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 155 place count 171 transition count 216
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 162 place count 164 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 169 place count 164 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 169 place count 164 transition count 207
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 171 place count 163 transition count 207
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 158 transition count 200
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 158 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 154 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 154 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 152 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 152 transition count 192
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 311 place count 93 transition count 133
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 321 place count 83 transition count 114
Iterating global reduction 3 with 10 rules applied. Total rules applied 331 place count 83 transition count 114
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 341 place count 73 transition count 103
Iterating global reduction 3 with 10 rules applied. Total rules applied 351 place count 73 transition count 103
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 360 place count 64 transition count 85
Iterating global reduction 3 with 9 rules applied. Total rules applied 369 place count 64 transition count 85
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 378 place count 55 transition count 76
Iterating global reduction 3 with 9 rules applied. Total rules applied 387 place count 55 transition count 76
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 395 place count 47 transition count 60
Iterating global reduction 3 with 8 rules applied. Total rules applied 403 place count 47 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 411 place count 39 transition count 52
Iterating global reduction 3 with 8 rules applied. Total rules applied 419 place count 39 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 38 transition count 50
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 38 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 422 place count 37 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 37 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 37 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 37 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 427 place count 35 transition count 46
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 41 edges and 33 vertex of which 30 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 removed 3 transitions
Drop transitions 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 434 place count 30 transition count 39
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 438 place count 26 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 438 place count 26 transition count 38
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 440 place count 25 transition count 38
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 448 place count 21 transition count 34
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 450 place count 20 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 454 place count 20 transition count 30
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 459 place count 15 transition count 25
Applied a total of 459 rules in 58 ms. Remains 15 /254 variables (removed 239) and now considering 25/298 (removed 273) transitions.
[2023-03-09 01:40:48] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-09 01:40:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 01:40:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 01:40:48] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
[2023-03-09 01:40:48] [INFO ] Invariant cache hit.
[2023-03-09 01:40:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-09 01:40:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:40:48] [INFO ] Flow matrix only has 19 transitions (discarded 6 similar events)
[2023-03-09 01:40:48] [INFO ] Invariant cache hit.
[2023-03-09 01:40:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/254 places, 25/298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 15/254 places, 25/298 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 0) (EQ s2 1) (OR (EQ s7 0) (EQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-13 finished in 225 ms.
All properties solved by simple procedures.
Total runtime 14901 ms.
ITS solved all properties within timeout

BK_STOP 1678326049481

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-13b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-13b, 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-smll-167819414300403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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