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-167819414300396.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-13a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414300396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 13:42 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.5K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 46K 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-13a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678325719563

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:35:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 01:35:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:35:22] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-09 01:35:22] [INFO ] Transformed 133 places.
[2023-03-09 01:35:22] [INFO ] Transformed 183 transitions.
[2023-03-09 01:35:22] [INFO ] Found NUPN structural information;
[2023-03-09 01:35:22] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 171
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 109 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 109 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 102 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 102 transition count 145
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 102 transition count 139
Applied a total of 68 rules in 80 ms. Remains 102 /133 variables (removed 31) and now considering 139/183 (removed 44) transitions.
// Phase 1: matrix 139 rows 102 cols
[2023-03-09 01:35:23] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-09 01:35:23] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-09 01:35:23] [INFO ] Invariant cache hit.
[2023-03-09 01:35:23] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:23] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-09 01:35:23] [INFO ] Invariant cache hit.
[2023-03-09 01:35:24] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/133 places, 139/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 102/133 places, 139/183 transitions.
Support contains 19 out of 102 places after structural reductions.
[2023-03-09 01:35:24] [INFO ] Flatten gal took : 70 ms
[2023-03-09 01:35:24] [INFO ] Flatten gal took : 30 ms
[2023-03-09 01:35:24] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 18 out of 102 places (down from 19) after GAL structural reductions.
Finished random walk after 481 steps, including 3 resets, run visited all 19 properties in 131 ms. (steps per millisecond=3 )
FORMULA DiscoveryGPU-PT-13a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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(F(p0))) U (G(F(p1))||G(p2))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 136
Applied a total of 6 rules in 17 ms. Remains 99 /102 variables (removed 3) and now considering 136/139 (removed 3) transitions.
// Phase 1: matrix 136 rows 99 cols
[2023-03-09 01:35:25] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-09 01:35:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 01:35:25] [INFO ] Invariant cache hit.
[2023-03-09 01:35:25] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:25] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-09 01:35:25] [INFO ] Invariant cache hit.
[2023-03-09 01:35:25] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 136/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 99/102 places, 136/139 transitions.
Stuttering acceptance computed with spot in 604 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s98 1)), p2:(EQ s18 1), p0:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22308 reset in 561 ms.
Stack based approach found an accepted trace after 4050 steps with 877 reset with depth 8 and stack size 8 in 24 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-01 finished in 1867 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(G(p0))))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 134
Applied a total of 10 rules in 11 ms. Remains 97 /102 variables (removed 5) and now considering 134/139 (removed 5) transitions.
// Phase 1: matrix 134 rows 97 cols
[2023-03-09 01:35:26] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:35:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 01:35:27] [INFO ] Invariant cache hit.
[2023-03-09 01:35:27] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:27] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/102 places, 134/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 96/102 places, 134/139 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-03 finished in 659 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)&&X(X(X(G(p1))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 134
Applied a total of 10 rules in 5 ms. Remains 97 /102 variables (removed 5) and now considering 134/139 (removed 5) transitions.
[2023-03-09 01:35:27] [INFO ] Invariant cache hit.
[2023-03-09 01:35:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-09 01:35:27] [INFO ] Invariant cache hit.
[2023-03-09 01:35:27] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:27] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 303 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/102 places, 134/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 311 ms. Remains : 96/102 places, 134/139 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s95 1)), p1:(AND (EQ s80 1) (EQ s95 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-04 finished in 592 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 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 97 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 97 transition count 134
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 0 with 2 rules applied. Total rules applied 11 place count 96 transition count 133
Applied a total of 11 rules in 26 ms. Remains 96 /102 variables (removed 6) and now considering 133/139 (removed 6) transitions.
// Phase 1: matrix 133 rows 96 cols
[2023-03-09 01:35:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:35:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 01:35:28] [INFO ] Invariant cache hit.
[2023-03-09 01:35:28] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:28] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 01:35:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 01:35:28] [INFO ] Invariant cache hit.
[2023-03-09 01:35:28] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/102 places, 133/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 96/102 places, 133/139 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-05 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 (EQ s44 1) (EQ s95 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 150 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-05 finished in 566 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((F(p0)&&F(G(p1)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 123 edges and 98 vertex of which 92 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (trivial) has 102 edges and 92 vertex of which 52 / 92 are part of one of the 26 SCC in 5 ms
Free SCC test removed 26 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 66 transition count 119
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 55 place count 54 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 43 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 43 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 33 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 33 transition count 51
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 23 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 23 transition count 31
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 13 transition count 21
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 8 transition count 14
Applied a total of 146 rules in 28 ms. Remains 8 /102 variables (removed 94) and now considering 14/139 (removed 125) transitions.
[2023-03-09 01:35:28] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-09 01:35:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:35:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 01:35:28] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2023-03-09 01:35:28] [INFO ] Invariant cache hit.
[2023-03-09 01:35:28] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-09 01:35:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 01:35:28] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2023-03-09 01:35:28] [INFO ] Invariant cache hit.
[2023-03-09 01:35:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/102 places, 14/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 8/102 places, 14/139 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 0), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-06 finished in 260 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(F(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 123 edges and 98 vertex of which 91 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 102 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 56 place count 53 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 67 place count 42 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 78 place count 42 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 31 transition count 48
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 31 transition count 48
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 20 transition count 26
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 20 transition count 26
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 9 transition count 15
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 5 transition count 10
Applied a total of 151 rules in 16 ms. Remains 5 /102 variables (removed 97) and now considering 10/139 (removed 129) transitions.
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 01:35:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-09 01:35:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/102 places, 10/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 5/102 places, 10/139 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-07 finished in 201 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&&F(G(p0)))) U p1))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 101 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 8 place count 95 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 95 transition count 132
Applied a total of 13 rules in 29 ms. Remains 95 /102 variables (removed 7) and now considering 132/139 (removed 7) transitions.
// Phase 1: matrix 132 rows 95 cols
[2023-03-09 01:35:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-09 01:35:29] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/102 places, 132/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 464 ms. Remains : 95/102 places, 132/139 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s72 1) (EQ s94 1)), p0:(EQ s30 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 126 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-08 finished in 572 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(F(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 123 edges and 98 vertex of which 91 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 102 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 56 place count 53 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 67 place count 42 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 78 place count 42 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 31 transition count 48
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 31 transition count 48
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 20 transition count 26
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 20 transition count 26
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 9 transition count 15
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 5 transition count 10
Applied a total of 151 rules in 22 ms. Remains 5 /102 variables (removed 97) and now considering 10/139 (removed 129) transitions.
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 01:35:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-09 01:35:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:35:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-09 01:35:29] [INFO ] Invariant cache hit.
[2023-03-09 01:35:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/102 places, 10/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 5/102 places, 10/139 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-10 finished in 194 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(G(p0))&&F(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 97 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 97 transition count 134
Applied a total of 10 rules in 6 ms. Remains 97 /102 variables (removed 5) and now considering 134/139 (removed 5) transitions.
// Phase 1: matrix 134 rows 97 cols
[2023-03-09 01:35:29] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:35:30] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 01:35:30] [INFO ] Invariant cache hit.
[2023-03-09 01:35:30] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:30] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-09 01:35:30] [INFO ] Invariant cache hit.
[2023-03-09 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/102 places, 134/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 97/102 places, 134/139 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s71 0) (EQ s96 0)), p1:(AND (EQ s22 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-11 finished in 598 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((X(F(p1))&&p0))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 136
Applied a total of 6 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 136/139 (removed 3) transitions.
// Phase 1: matrix 136 rows 99 cols
[2023-03-09 01:35:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:35:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 01:35:30] [INFO ] Invariant cache hit.
[2023-03-09 01:35:30] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:30] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-09 01:35:30] [INFO ] Invariant cache hit.
[2023-03-09 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 136/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 99/102 places, 136/139 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s75 1), p0:(AND (EQ s32 1) (EQ s98 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][false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-14 finished in 575 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 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 318 edges and 102 vertex of which 101 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 removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 101 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 8 place count 95 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 95 transition count 132
Applied a total of 13 rules in 15 ms. Remains 95 /102 variables (removed 7) and now considering 132/139 (removed 7) transitions.
// Phase 1: matrix 132 rows 95 cols
[2023-03-09 01:35:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:35:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 01:35:31] [INFO ] Invariant cache hit.
[2023-03-09 01:35:31] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-09 01:35:31] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-09 01:35:31] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 01:35:31] [INFO ] Invariant cache hit.
[2023-03-09 01:35:31] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/102 places, 132/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 454 ms. Remains : 95/102 places, 132/139 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s69 1) (EQ s94 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]]
Product exploration explored 100000 steps with 3186 reset in 307 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-15 finished in 818 ms.
All properties solved by simple procedures.
Total runtime 9300 ms.
ITS solved all properties within timeout

BK_STOP 1678325732964

--------------------
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 LTLFireability -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-13a"
export BK_EXAMINATION="LTLFireability"
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-13a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414300396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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