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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:35 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.3K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:40 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 36K 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-10a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678319466136

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-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 23:51:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 23:51:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 23:51:10] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-08 23:51:10] [INFO ] Transformed 103 places.
[2023-03-08 23:51:10] [INFO ] Transformed 141 transitions.
[2023-03-08 23:51:10] [INFO ] Found NUPN structural information;
[2023-03-08 23:51:10] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 257 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 3 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 93 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 93 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 90 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 90 transition count 125
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 90 transition count 118
Applied a total of 33 rules in 71 ms. Remains 90 /103 variables (removed 13) and now considering 118/141 (removed 23) transitions.
// Phase 1: matrix 118 rows 90 cols
[2023-03-08 23:51:10] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 23:51:11] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-08 23:51:11] [INFO ] Invariant cache hit.
[2023-03-08 23:51:11] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 23:51:11] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-08 23:51:11] [INFO ] Invariant cache hit.
[2023-03-08 23:51:11] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/103 places, 118/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 90/103 places, 118/141 transitions.
Support contains 28 out of 90 places after structural reductions.
[2023-03-08 23:51:12] [INFO ] Flatten gal took : 95 ms
[2023-03-08 23:51:12] [INFO ] Flatten gal took : 27 ms
[2023-03-08 23:51:12] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 27 out of 90 places (down from 28) after GAL structural reductions.
Finished random walk after 3413 steps, including 31 resets, run visited all 23 properties in 205 ms. (steps per millisecond=16 )
FORMULA DiscoveryGPU-PT-10a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U p1) U G(X((F(G(p2)) U p3)))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 79 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 77 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 77 transition count 105
Applied a total of 26 rules in 19 ms. Remains 77 /90 variables (removed 13) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 77 cols
[2023-03-08 23:51:13] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 23:51:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 23:51:13] [INFO ] Invariant cache hit.
[2023-03-08 23:51:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:13] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/90 places, 105/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 76/90 places, 105/118 transitions.
Stuttering acceptance computed with spot in 1362 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=1 dest: 9}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 12}, { cond=(NOT p3), acceptance={} source=2 dest: 13}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 3}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 14}, { cond=(AND p1 p0 p3), acceptance={} source=11 dest: 15}], [{ cond=(NOT p1), acceptance={} source=12 dest: 11}, { cond=(AND p3 p2), acceptance={} source=12 dest: 12}, { cond=(AND p3 (NOT p2)), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p3) p2), acceptance={1} source=12 dest: 12}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=13 dest: 11}, { cond=(NOT p3), acceptance={} source=13 dest: 12}, { cond=(NOT p3), acceptance={0, 1} source=13 dest: 13}], [{ cond=(NOT p3), acceptance={} source=14 dest: 3}, { cond=p3, acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=15 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p0) p3), acceptance={} source=15 dest: 14}, { cond=(AND p0 p3), acceptance={} source=15 dest: 15}]], initial=0, aps=[p1:(AND (EQ s32 1) (EQ s53 1)), p0:(EQ s20 1), p3:(EQ s34 1), p2:(AND (EQ s30 1) (EQ s75 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 12 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-00 finished in 1834 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||X(F(p1))))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 79 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 76 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 76 transition count 104
Applied a total of 28 rules in 20 ms. Remains 76 /90 variables (removed 14) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 76 cols
[2023-03-08 23:51:14] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 23:51:15] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 23:51:15] [INFO ] Invariant cache hit.
[2023-03-08 23:51:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:15] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-08 23:51:15] [INFO ] Invariant cache hit.
[2023-03-08 23:51:15] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/90 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 76/90 places, 104/118 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s60 1), p1:(AND (OR (AND (EQ s60 0) (OR (EQ s67 0) (EQ s75 0))) (EQ s60 0)) (EQ s60 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25038 reset in 800 ms.
Product exploration explored 100000 steps with 25042 reset in 379 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 239 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 148 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 23:51:17] [INFO ] Invariant cache hit.
[2023-03-08 23:51:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 23:51:17] [INFO ] Invariant cache hit.
[2023-03-08 23:51:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:18] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 23:51:18] [INFO ] Invariant cache hit.
[2023-03-08 23:51:18] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 76/76 places, 104/104 transitions.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 239 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 68 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33400 reset in 394 ms.
Product exploration explored 100000 steps with 33246 reset in 447 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 104/104 transitions.
Graph (complete) has 239 edges and 76 vertex of which 75 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
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 75 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 33 ms. Remains 75 /76 variables (removed 1) and now considering 103/104 (removed 1) transitions.
[2023-03-08 23:51:21] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2023-03-08 23:51:21] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/76 places, 103/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 75/76 places, 103/104 transitions.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 76 cols
[2023-03-08 23:51:21] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 23:51:21] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 23:51:21] [INFO ] Invariant cache hit.
[2023-03-08 23:51:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:21] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 23:51:21] [INFO ] Invariant cache hit.
[2023-03-08 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 76/76 places, 104/104 transitions.
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-01 finished in 7008 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)&&F(p1)))||(F(p1)&&X((F(!p0)&&X(!p1)))))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 85 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 85 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 81 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 81 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 78 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 78 transition count 106
Applied a total of 24 rules in 12 ms. Remains 78 /90 variables (removed 12) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 78 cols
[2023-03-08 23:51:21] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 23:51:22] [INFO ] Invariant cache hit.
[2023-03-08 23:51:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/90 places, 106/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 77/90 places, 106/118 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s76 1)), p0:(AND (EQ s70 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-03 finished in 660 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 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 97 edges and 83 vertex of which 70 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (trivial) has 78 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 4 ms
Free SCC test removed 19 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 44 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 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 112 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 113 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 115 place count 5 transition count 10
Applied a total of 115 rules in 24 ms. Remains 5 /90 variables (removed 85) and now considering 10/118 (removed 108) transitions.
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-08 23:51:22] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 23:51:22] [INFO ] Invariant cache hit.
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-08 23:51:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 23:51:22] [INFO ] Invariant cache hit.
[2023-03-08 23:51:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/90 places, 10/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 5/90 places, 10/118 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-04 finished in 204 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 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 87 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 98 edges and 84 vertex of which 73 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 82 edges and 73 vertex of which 40 / 73 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 53 transition count 92
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 47 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 34 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 26 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 26 transition count 40
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 18 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 18 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 10 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 10 transition count 16
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 115 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 6 transition count 11
Applied a total of 118 rules in 22 ms. Remains 6 /90 variables (removed 84) and now considering 11/118 (removed 107) transitions.
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-08 23:51:22] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-08 23:51:22] [INFO ] Invariant cache hit.
[2023-03-08 23:51:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 23:51:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 23:51:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-08 23:51:22] [INFO ] Invariant cache hit.
[2023-03-08 23:51:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/90 places, 11/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 6/90 places, 11/118 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-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:(EQ s2 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 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-05 finished in 204 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 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 86 transition count 109
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 81 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 76 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 76 transition count 104
Applied a total of 21 rules in 19 ms. Remains 76 /90 variables (removed 14) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 76 cols
[2023-03-08 23:51:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 23:51:23] [INFO ] Invariant cache hit.
[2023-03-08 23:51:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 298 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/90 places, 104/118 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 55 transition count 84
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 47 transition count 68
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 47 transition count 68
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 39 transition count 52
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 39 transition count 52
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 31 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 31 transition count 44
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 23 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 23 transition count 28
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 15 transition count 20
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 15 transition count 20
Applied a total of 120 rules in 17 ms. Remains 15 /75 variables (removed 60) and now considering 20/104 (removed 84) transitions.
[2023-03-08 23:51:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2023-03-08 23:51:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 23:51:23] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-08 23:51:23] [INFO ] Invariant cache hit.
[2023-03-08 23:51:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/90 places, 20/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 419 ms. Remains : 15/90 places, 20/118 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s14 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-08 finished in 518 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(G(p0))&&F(((!p1&&X(p2))||G(p2))))))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 114
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 82 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 82 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 79 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 79 transition count 107
Applied a total of 22 rules in 18 ms. Remains 79 /90 variables (removed 11) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 79 cols
[2023-03-08 23:51:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 23:51:23] [INFO ] Invariant cache hit.
[2023-03-08 23:51:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 23:51:23] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 23:51:23] [INFO ] Invariant cache hit.
[2023-03-08 23:51:23] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/90 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 79/90 places, 107/118 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s39 0) (EQ s78 0)) (OR (EQ s11 0) (EQ s77 0))), p2:(AND (EQ s39 1) (EQ s78 1)), p1:(AND (EQ s20 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4600 steps with 192 reset in 25 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-09 finished in 770 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 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 86 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 74 transition count 102
Applied a total of 25 rules in 29 ms. Remains 74 /90 variables (removed 16) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 74 cols
[2023-03-08 23:51:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 23:51:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 23:51:24] [INFO ] Invariant cache hit.
[2023-03-08 23:51:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:24] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 387 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 102/118 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 45 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 45 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 36 transition count 47
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 36 transition count 47
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 27 transition count 38
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 27 transition count 38
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 19 transition count 22
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 19 transition count 22
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 11 transition count 14
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 11 transition count 14
Applied a total of 125 rules in 17 ms. Remains 11 /73 variables (removed 62) and now considering 14/102 (removed 88) transitions.
[2023-03-08 23:51:24] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2023-03-08 23:51:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 23:51:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 23:51:24] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-08 23:51:24] [INFO ] Invariant cache hit.
[2023-03-08 23:51:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-08 23:51:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/90 places, 14/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 544 ms. Remains : 11/90 places, 14/118 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s10 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 14 steps with 4 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-10 finished in 729 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(p1)))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 86 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 74 transition count 102
Applied a total of 25 rules in 22 ms. Remains 74 /90 variables (removed 16) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 74 cols
[2023-03-08 23:51:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 23:51:25] [INFO ] Invariant cache hit.
[2023-03-08 23:51:25] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 102/118 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 46 transition count 67
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 46 transition count 67
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 39 transition count 53
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 39 transition count 53
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 32 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 32 transition count 46
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 25 transition count 32
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 25 transition count 32
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 18 transition count 25
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 18 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 18 transition count 25
Applied a total of 111 rules in 18 ms. Remains 18 /73 variables (removed 55) and now considering 25/102 (removed 77) transitions.
[2023-03-08 23:51:25] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 18 cols
[2023-03-08 23:51:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 23:51:25] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2023-03-08 23:51:25] [INFO ] Invariant cache hit.
[2023-03-08 23:51:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/90 places, 25/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 384 ms. Remains : 18/90 places, 25/118 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(OR (EQ s12 0) (EQ s17 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-12 finished in 560 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(p1)))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 79 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 76 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 76 transition count 104
Applied a total of 28 rules in 5 ms. Remains 76 /90 variables (removed 14) and now considering 104/118 (removed 14) transitions.
// Phase 1: matrix 104 rows 76 cols
[2023-03-08 23:51:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 23:51:25] [INFO ] Invariant cache hit.
[2023-03-08 23:51:25] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:25] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 23:51:25] [INFO ] Invariant cache hit.
[2023-03-08 23:51:25] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/90 places, 104/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 76/90 places, 104/118 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s75 1)), p1:(AND (EQ s22 1) (EQ s75 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 21 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-13 finished in 599 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(p0) U X(p1)))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 79 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 78 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 78 transition count 106
Applied a total of 24 rules in 8 ms. Remains 78 /90 variables (removed 12) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 78 cols
[2023-03-08 23:51:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 23:51:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 23:51:26] [INFO ] Invariant cache hit.
[2023-03-08 23:51:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:26] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 23:51:26] [INFO ] Invariant cache hit.
[2023-03-08 23:51:26] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/90 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 78/90 places, 106/118 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s64 1) (EQ s76 1)) (AND (EQ s3 1) (EQ s77 1))), p1:(AND (EQ s61 1) (EQ s77 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-14 finished in 680 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||X(F(p1))))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-10a-LTLFireability-01
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Graph (complete) has 264 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 86 transition count 108
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 80 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 74 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 74 transition count 102
Applied a total of 25 rules in 9 ms. Remains 74 /90 variables (removed 16) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 74 cols
[2023-03-08 23:51:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 23:51:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 23:51:27] [INFO ] Invariant cache hit.
[2023-03-08 23:51:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:27] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-08 23:51:27] [INFO ] Invariant cache hit.
[2023-03-08 23:51:27] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/90 places, 102/118 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 418 ms. Remains : 74/90 places, 102/118 transitions.
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s58 1), p1:(AND (OR (AND (EQ s58 0) (OR (EQ s65 0) (EQ s73 0))) (EQ s58 0)) (EQ s58 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24954 reset in 408 ms.
Product exploration explored 100000 steps with 24873 reset in 469 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 614 steps, including 6 resets, run visited all 2 properties in 14 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-08 23:51:29] [INFO ] Invariant cache hit.
[2023-03-08 23:51:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 23:51:29] [INFO ] Invariant cache hit.
[2023-03-08 23:51:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:29] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-08 23:51:29] [INFO ] Invariant cache hit.
[2023-03-08 23:51:29] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 74/74 places, 102/102 transitions.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 489 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 227 steps, including 2 resets, run visited all 2 properties in 9 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 438 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33288 reset in 363 ms.
Product exploration explored 100000 steps with 33254 reset in 284 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-08 23:51:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 23:51:32] [INFO ] Invariant cache hit.
[2023-03-08 23:51:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 74/74 places, 102/102 transitions.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 74 /74 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-08 23:51:32] [INFO ] Invariant cache hit.
[2023-03-08 23:51:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 23:51:32] [INFO ] Invariant cache hit.
[2023-03-08 23:51:32] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 23:51:32] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 23:51:32] [INFO ] Invariant cache hit.
[2023-03-08 23:51:32] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 74/74 places, 102/102 transitions.
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-01 finished in 5886 ms.
[2023-03-08 23:51:32] [INFO ] Flatten gal took : 17 ms
[2023-03-08 23:51:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-08 23:51:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 118 transitions and 385 arcs took 3 ms.
Total runtime 22549 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-10a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678319533997

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DiscoveryGPU-PT-10a-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 DiscoveryGPU-PT-10a-LTLFireability-01 691778 m, 138355 m/sec, 4673347 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 9/32 DiscoveryGPU-PT-10a-LTLFireability-01 1355408 m, 132726 m/sec, 9693829 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 14/32 DiscoveryGPU-PT-10a-LTLFireability-01 2041404 m, 137199 m/sec, 14678420 t fired, .

Time elapsed: 15 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 18/32 DiscoveryGPU-PT-10a-LTLFireability-01 2689668 m, 129652 m/sec, 19548005 t fired, .

Time elapsed: 20 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 22/32 DiscoveryGPU-PT-10a-LTLFireability-01 3279360 m, 117938 m/sec, 24449770 t fired, .

Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 26/32 DiscoveryGPU-PT-10a-LTLFireability-01 3874190 m, 118966 m/sec, 29352176 t fired, .

Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 29/32 DiscoveryGPU-PT-10a-LTLFireability-01 4428592 m, 110880 m/sec, 34259034 t fired, .

Time elapsed: 35 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for DiscoveryGPU-PT-10a-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-10a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-10a-LTLFireability-01: LTL unknown AGGR


Time elapsed: 40 secs. Pages in use: 32

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-10a"
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-10a, 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-167819414100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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