About the Execution of LoLa+red for DiscoveryGPU-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 385.239 | 36290.00 | 54552.00 | 700.80 | FTFFFFFFFFTTFTFF | normal |
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-167819414000291.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-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414000291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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-06b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678314602630
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:30:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 22:30:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:30:05] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-08 22:30:05] [INFO ] Transformed 184 places.
[2023-03-08 22:30:05] [INFO ] Transformed 194 transitions.
[2023-03-08 22:30:05] [INFO ] Found NUPN structural information;
[2023-03-08 22:30:05] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 173 transition count 194
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 34 place count 150 transition count 171
Iterating global reduction 1 with 23 rules applied. Total rules applied 57 place count 150 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 144 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 144 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 140 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 140 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 137 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 137 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 135 transition count 154
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 135 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 133 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 133 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 131 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 131 transition count 150
Applied a total of 95 rules in 113 ms. Remains 131 /184 variables (removed 53) and now considering 150/194 (removed 44) transitions.
// Phase 1: matrix 150 rows 131 cols
[2023-03-08 22:30:05] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-08 22:30:06] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-08 22:30:06] [INFO ] Invariant cache hit.
[2023-03-08 22:30:06] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-08 22:30:06] [INFO ] Invariant cache hit.
[2023-03-08 22:30:06] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/184 places, 150/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 131/184 places, 150/194 transitions.
Support contains 24 out of 131 places after structural reductions.
[2023-03-08 22:30:07] [INFO ] Flatten gal took : 79 ms
[2023-03-08 22:30:07] [INFO ] Flatten gal took : 33 ms
[2023-03-08 22:30:07] [INFO ] Input system was already deterministic with 150 transitions.
Finished random walk after 529 steps, including 2 resets, run visited all 13 properties in 108 ms. (steps per millisecond=4 )
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 248 edges and 131 vertex of which 126 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 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 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Graph (complete) has 248 edges and 131 vertex of which 126 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 125 transition count 124
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 104 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 103 transition count 123
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 45 place count 103 transition count 107
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 77 place count 87 transition count 107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 83 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 83 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 83 transition count 101
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 82 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 79 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 79 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 77 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 77 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 75 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 75 transition count 92
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 161 place count 45 transition count 62
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 40 transition count 52
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 40 transition count 52
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 36 transition count 48
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 36 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 32 transition count 40
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 32 transition count 40
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 28 transition count 36
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 28 transition count 36
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 24 transition count 28
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 24 transition count 28
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 20 transition count 24
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 20 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 18 transition count 21
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 18 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 219 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 222 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 10 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 6 with 4 rules applied. Total rules applied 227 place count 8 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 8 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 6 transition count 10
Applied a total of 230 rules in 75 ms. Remains 6 /131 variables (removed 125) and now considering 10/150 (removed 140) transitions.
[2023-03-08 22:30:07] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 6 cols
[2023-03-08 22:30:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 22:30:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 22:30:07] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-08 22:30:07] [INFO ] Invariant cache hit.
[2023-03-08 22:30:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 22:30:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:30:07] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-08 22:30:07] [INFO ] Invariant cache hit.
[2023-03-08 22:30:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/131 places, 10/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 6/131 places, 10/150 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-03 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 s3 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-03 finished in 527 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((G(p1)&&p0))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 150
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 120 transition count 139
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 120 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 117 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 117 transition count 136
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 115 transition count 134
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 115 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 112 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 111 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 111 transition count 129
Applied a total of 39 rules in 28 ms. Remains 111 /131 variables (removed 20) and now considering 129/150 (removed 21) transitions.
// Phase 1: matrix 129 rows 111 cols
[2023-03-08 22:30:08] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 22:30:08] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 22:30:08] [INFO ] Invariant cache hit.
[2023-03-08 22:30:08] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-08 22:30:08] [INFO ] Invariant cache hit.
[2023-03-08 22:30:08] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/131 places, 129/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 111/131 places, 129/150 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s104 0) (EQ s8 1)), p1:(OR (EQ s33 0) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 373 steps with 1 reset in 7 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-04 finished in 870 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 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Graph (complete) has 248 edges and 131 vertex of which 126 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 125 transition count 124
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 104 transition count 124
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 43 place count 104 transition count 108
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 75 place count 88 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 84 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 84 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 83 place count 84 transition count 102
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 83 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 80 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 79 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 79 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 78 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 78 transition count 96
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 157 place count 47 transition count 65
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 43 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 43 transition count 57
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 39 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 39 transition count 53
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 35 transition count 45
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 35 transition count 45
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 31 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 31 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 28 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 28 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 198 place count 25 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 201 place count 25 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 25 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 23 transition count 29
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 26 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 211 place count 18 transition count 23
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 215 place count 15 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 215 place count 15 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 14 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 13 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 11 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 11 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 9 transition count 16
Applied a total of 228 rules in 40 ms. Remains 9 /131 variables (removed 122) and now considering 16/150 (removed 134) transitions.
[2023-03-08 22:30:09] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2023-03-08 22:30:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 22:30:09] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-08 22:30:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:09] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/131 places, 16/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 9/131 places, 16/150 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-07 finished in 177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 150
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 120 transition count 139
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 120 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 116 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 113 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 111 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 109 transition count 126
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 108 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 107 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 107 transition count 124
Applied a total of 47 rules in 24 ms. Remains 107 /131 variables (removed 24) and now considering 124/150 (removed 26) transitions.
// Phase 1: matrix 124 rows 107 cols
[2023-03-08 22:30:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/131 places, 124/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 107/131 places, 124/150 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s44 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][false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-08 finished in 375 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&&X(p1)))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 121 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 121 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 118 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 118 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 116 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 116 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 131
Applied a total of 34 rules in 11 ms. Remains 114 /131 variables (removed 17) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 114 cols
[2023-03-08 22:30:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 22:30:09] [INFO ] Invariant cache hit.
[2023-03-08 22:30:09] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/131 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 114/131 places, 131/150 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s105 1)), p1:(OR (EQ s20 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33292 reset in 528 ms.
Product exploration explored 100000 steps with 33429 reset in 225 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 224 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 604 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 409 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-08 22:30:12] [INFO ] Invariant cache hit.
[2023-03-08 22:30:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 22:30:12] [INFO ] Invariant cache hit.
[2023-03-08 22:30:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 22:30:12] [INFO ] Invariant cache hit.
[2023-03-08 22:30:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 114/114 places, 131/131 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 224 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 4812 steps, including 24 resets, run visited all 3 properties in 55 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33530 reset in 143 ms.
Product exploration explored 100000 steps with 33389 reset in 145 ms.
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 131/131 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-08 22:30:14] [INFO ] Invariant cache hit.
[2023-03-08 22:30:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 22:30:14] [INFO ] Invariant cache hit.
[2023-03-08 22:30:14] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 22:30:14] [INFO ] Invariant cache hit.
[2023-03-08 22:30:14] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 114/114 places, 131/131 transitions.
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-09 finished in 5477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 150
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 120 transition count 140
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 120 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 118 transition count 138
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 118 transition count 138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 116 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 116 transition count 135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 114 transition count 133
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 114 transition count 133
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 112 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 111 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 111 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 110 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 110 transition count 128
Applied a total of 41 rules in 10 ms. Remains 110 /131 variables (removed 21) and now considering 128/150 (removed 22) transitions.
// Phase 1: matrix 128 rows 110 cols
[2023-03-08 22:30:15] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 22:30:15] [INFO ] Invariant cache hit.
[2023-03-08 22:30:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 22:30:15] [INFO ] Invariant cache hit.
[2023-03-08 22:30:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/131 places, 128/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 110/131 places, 128/150 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s30 0) (EQ s72 1)), p1:(OR (EQ s62 0) (EQ s109 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]]
Product exploration explored 100000 steps with 13893 reset in 126 ms.
Product exploration explored 100000 steps with 13846 reset in 206 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Graph (complete) has 218 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 269 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 22:30:17] [INFO ] Invariant cache hit.
[2023-03-08 22:30:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 22:30:17] [INFO ] Invariant cache hit.
[2023-03-08 22:30:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 22:30:17] [INFO ] Invariant cache hit.
[2023-03-08 22:30:17] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 110/110 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Graph (complete) has 218 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 268 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13793 reset in 116 ms.
Product exploration explored 100000 steps with 13803 reset in 131 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 128/128 transitions.
Graph (complete) has 218 edges and 110 vertex of which 109 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 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 109 transition count 127
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 14 place count 109 transition count 127
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 32 place count 109 transition count 127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 49 place count 109 transition count 134
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 106 transition count 131
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 106 transition count 131
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 106 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 103 transition count 149
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 103 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 82 place count 94 transition count 134
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 91 place count 94 transition count 134
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 100 place count 85 transition count 119
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 109 place count 85 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 82 transition count 116
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 82 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 121 place count 76 transition count 107
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 127 place count 76 transition count 107
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 138 place count 65 transition count 90
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 149 place count 65 transition count 90
Deduced a syphon composed of 34 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 65 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 62 transition count 80
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 62 transition count 80
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 162 rules in 52 ms. Remains 62 /110 variables (removed 48) and now considering 80/128 (removed 48) transitions.
[2023-03-08 22:30:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:30:19] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 62 cols
[2023-03-08 22:30:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:30:19] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/110 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 62/110 places, 80/128 transitions.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 110 cols
[2023-03-08 22:30:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 22:30:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 22:30:19] [INFO ] Invariant cache hit.
[2023-03-08 22:30:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 22:30:19] [INFO ] Invariant cache hit.
[2023-03-08 22:30:19] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 110/110 places, 128/128 transitions.
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-10 finished in 4795 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 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Graph (complete) has 248 edges and 131 vertex of which 126 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 125
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 105 transition count 125
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 41 place count 105 transition count 109
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 73 place count 89 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 85 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 85 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 85 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 84 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 81 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 81 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 79 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 79 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 77 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 77 transition count 94
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 157 place count 47 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 162 place count 42 transition count 54
Iterating global reduction 2 with 5 rules applied. Total rules applied 167 place count 42 transition count 54
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 37 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 33 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 33 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 29 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 29 transition count 37
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 26 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 26 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 23 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 23 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 210 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 214 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 15 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 215 place count 15 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 14 transition count 20
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 4 with 4 rules applied. Total rules applied 221 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 10 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 8 transition count 14
Applied a total of 230 rules in 65 ms. Remains 8 /131 variables (removed 123) and now considering 14/150 (removed 136) transitions.
[2023-03-08 22:30:19] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 8 cols
[2023-03-08 22:30:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:30:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 22:30:19] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
[2023-03-08 22:30:19] [INFO ] Invariant cache hit.
[2023-03-08 22:30:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-08 22:30:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:30:19] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
[2023-03-08 22:30:19] [INFO ] Invariant cache hit.
[2023-03-08 22:30:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/131 places, 14/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 8/131 places, 14/150 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (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 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-14 finished in 227 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||X((G(p1) U (p0&&G(p1)))))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 150
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 119 transition count 138
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 115 transition count 134
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 112 transition count 130
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 110 transition count 128
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 108 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 107 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 106 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 106 transition count 123
Applied a total of 49 rules in 24 ms. Remains 106 /131 variables (removed 25) and now considering 123/150 (removed 27) transitions.
// Phase 1: matrix 123 rows 106 cols
[2023-03-08 22:30:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:30:20] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 22:30:20] [INFO ] Invariant cache hit.
[2023-03-08 22:30:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-08 22:30:20] [INFO ] Invariant cache hit.
[2023-03-08 22:30:20] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/131 places, 123/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 106/131 places, 123/150 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s35 1), p1:(OR (EQ s4 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-15 finished in 586 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&&X(p1)))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-06b-LTLCardinality-09
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 131/131 places, 150/150 transitions.
Graph (complete) has 248 edges and 131 vertex of which 129 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 128 transition count 125
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 106 transition count 125
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 45 place count 106 transition count 110
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 75 place count 91 transition count 110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 88 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 88 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 88 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 87 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 85 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 85 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 84 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 84 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 83 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 83 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 157 place count 50 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 46 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 46 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 42 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 42 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 39 transition count 49
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 39 transition count 49
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 182 place count 36 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 185 place count 36 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 33 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 33 transition count 40
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 193 place count 31 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 31 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 29 transition count 36
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 32 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 24 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 210 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 19 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 16 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 220 place count 13 transition count 20
Applied a total of 220 rules in 30 ms. Remains 13 /131 variables (removed 118) and now considering 20/150 (removed 130) transitions.
[2023-03-08 22:30:21] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-08 22:30:21] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 22:30:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 22:30:21] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2023-03-08 22:30:21] [INFO ] Invariant cache hit.
[2023-03-08 22:30:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-08 22:30:21] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2023-03-08 22:30:21] [INFO ] Invariant cache hit.
[2023-03-08 22:30:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/131 places, 20/150 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 147 ms. Remains : 13/131 places, 20/150 transitions.
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s12 1)), p1:(OR (EQ s3 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 12 reset in 1 ms.
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-09 finished in 460 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
[2023-03-08 22:30:21] [INFO ] Flatten gal took : 31 ms
[2023-03-08 22:30:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 22:30:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 150 transitions and 394 arcs took 3 ms.
Total runtime 16038 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-06b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678314638920
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DiscoveryGPU-PT-06b-LTLCardinality-09
lola: time limit : 1800 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-06b-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-06b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 4/32 DiscoveryGPU-PT-06b-LTLCardinality-09 618314 m, 123662 m/sec, 2772906 t fired, .
Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-06b-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-06b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 8/32 DiscoveryGPU-PT-06b-LTLCardinality-09 1231012 m, 122539 m/sec, 5827161 t fired, .
Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-06b-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
DiscoveryGPU-PT-06b-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 12/32 DiscoveryGPU-PT-06b-LTLCardinality-09 1825229 m, 118843 m/sec, 8655524 t fired, .
Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for DiscoveryGPU-PT-06b-LTLCardinality-09
lola: result : false
lola: markings : 1940322
lola: fired transitions : 9323675
lola: time used : 16.000000
lola: memory pages used : 13
lola: LAUNCH task # 4 (type EXCL) for 3 DiscoveryGPU-PT-06b-LTLCardinality-10
lola: time limit : 3584 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DiscoveryGPU-PT-06b-LTLCardinality-10
lola: result : true
lola: markings : 306
lola: fired transitions : 476
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-06b-LTLCardinality-09: LTL false LTL model checker
DiscoveryGPU-PT-06b-LTLCardinality-10: LTL true LTL model checker
Time elapsed: 16 secs. Pages in use: 13
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-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;