Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716420965927

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:36:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:36:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:36:07] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-22 23:36:07] [INFO ] Transformed 212 places.
[2024-05-22 23:36:07] [INFO ] Transformed 224 transitions.
[2024-05-22 23:36:07] [INFO ] Found NUPN structural information;
[2024-05-22 23:36:07] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 199 transition count 224
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 40 place count 172 transition count 197
Iterating global reduction 1 with 27 rules applied. Total rules applied 67 place count 172 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 166 transition count 191
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 166 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 161 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 161 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 158 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 158 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 155 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 155 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 152 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 152 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 150 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 150 transition count 172
Applied a total of 111 rules in 66 ms. Remains 150 /212 variables (removed 62) and now considering 172/224 (removed 52) transitions.
// Phase 1: matrix 172 rows 150 cols
[2024-05-22 23:36:07] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 23:36:08] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-22 23:36:08] [INFO ] Invariant cache hit.
[2024-05-22 23:36:08] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-22 23:36:08] [INFO ] Invariant cache hit.
[2024-05-22 23:36:08] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/212 places, 172/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 150/212 places, 172/224 transitions.
Support contains 29 out of 150 places after structural reductions.
[2024-05-22 23:36:08] [INFO ] Flatten gal took : 36 ms
[2024-05-22 23:36:08] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:36:08] [INFO ] Input system was already deterministic with 172 transitions.
Support contains 28 out of 150 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:36:08] [INFO ] Invariant cache hit.
[2024-05-22 23:36:08] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-22 23:36:08] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F(p0))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 137 transition count 160
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 137 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 132 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 132 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 129 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 129 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 126 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 125 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 125 transition count 146
Applied a total of 49 rules in 12 ms. Remains 125 /150 variables (removed 25) and now considering 146/172 (removed 26) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-22 23:36:09] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 23:36:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 23:36:09] [INFO ] Invariant cache hit.
[2024-05-22 23:36:09] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-22 23:36:09] [INFO ] Invariant cache hit.
[2024-05-22 23:36:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 146/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 125/150 places, 146/172 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s93 1), p0:(OR (EQ s77 0) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 248 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-00 finished in 1189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 136 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 136 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 132 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 130 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 128 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 126 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 125 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 125 transition count 146
Applied a total of 49 rules in 25 ms. Remains 125 /150 variables (removed 25) and now considering 146/172 (removed 26) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-22 23:36:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:36:10] [INFO ] Invariant cache hit.
[2024-05-22 23:36:10] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-22 23:36:10] [INFO ] Invariant cache hit.
[2024-05-22 23:36:10] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 146/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 125/150 places, 146/172 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(AND (OR (EQ s31 0) (EQ s52 1)) (OR (EQ s3 0) (EQ s105 1))), p0:(NEQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 250 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-03 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p1&&F(G(p2)))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 138 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 138 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 135 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 135 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 133 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 131 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 129 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 128 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 127 transition count 148
Applied a total of 45 rules in 22 ms. Remains 127 /150 variables (removed 23) and now considering 148/172 (removed 24) transitions.
// Phase 1: matrix 148 rows 127 cols
[2024-05-22 23:36:11] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:36:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:36:11] [INFO ] Invariant cache hit.
[2024-05-22 23:36:11] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-22 23:36:11] [INFO ] Invariant cache hit.
[2024-05-22 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/150 places, 148/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 127/150 places, 148/172 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s108 0) (EQ s68 1)), p1:(OR (EQ s58 0) (EQ s74 1)), p2:(OR (EQ s126 0) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1286 reset in 212 ms.
Product exploration explored 100000 steps with 1336 reset in 246 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 23:36:12] [INFO ] Invariant cache hit.
[2024-05-22 23:36:12] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 23:36:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:36:12] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-22 23:36:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
[2024-05-22 23:36:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 23:36:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:36:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 145 ms
[2024-05-22 23:36:12] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2024-05-22 23:36:12] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 12 factoid took 350 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 125 transition count 134
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 113 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 112 transition count 133
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 27 place count 112 transition count 110
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 73 place count 89 transition count 110
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 131 place count 60 transition count 81
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 56 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 56 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 53 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 53 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 51 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 51 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 49 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 49 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 47 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 47 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 45 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 45 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 45 transition count 57
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 45 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 43 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 67 edges and 42 vertex of which 41 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
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 4 rules applied. Total rules applied 171 place count 41 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 173 place count 39 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 185 place count 33 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 32 transition count 46
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 192 place count 27 transition count 41
Applied a total of 192 rules in 53 ms. Remains 27 /127 variables (removed 100) and now considering 41/148 (removed 107) transitions.
[2024-05-22 23:36:13] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
// Phase 1: matrix 36 rows 27 cols
[2024-05-22 23:36:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:36:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:36:13] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2024-05-22 23:36:13] [INFO ] Invariant cache hit.
[2024-05-22 23:36:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 23:36:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-22 23:36:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:13] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2024-05-22 23:36:13] [INFO ] Invariant cache hit.
[2024-05-22 23:36:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/127 places, 41/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 27/127 places, 41/148 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Computed a total of 20 stabilizing places and 26 stable transitions
Detected a total of 20/27 stabilizing places and 26/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 7 factoid took 734 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10002 steps, including 258 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:36:14] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2024-05-22 23:36:14] [INFO ] Invariant cache hit.
[2024-05-22 23:36:14] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 23:36:14] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 23:36:14] [INFO ] After 5ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-22 23:36:14] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND (NOT p2) p0 p1)), (F (AND p2 p0 p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 979 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 13912 reset in 219 ms.
Product exploration explored 100000 steps with 13979 reset in 169 ms.
Built C files in :
/tmp/ltsmin825394763282752292
[2024-05-22 23:36:16] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-22 23:36:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:36:16] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-22 23:36:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:36:16] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-22 23:36:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:36:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin825394763282752292
Running compilation step : cd /tmp/ltsmin825394763282752292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 240 ms.
Running link step : cd /tmp/ltsmin825394763282752292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin825394763282752292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12330989706101335211.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 6294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 135 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 130 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 124 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 124 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 122 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 121 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 120 transition count 140
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 120 transition count 140
Applied a total of 59 rules in 19 ms. Remains 120 /150 variables (removed 30) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-22 23:36:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/150 places, 140/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 120/150 places, 140/172 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 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]]
Product exploration explored 100000 steps with 988 reset in 124 ms.
Stack based approach found an accepted trace after 142 steps with 1 reset with depth 47 and stack size 47 in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-07 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 145 transition count 142
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 119 transition count 142
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 119 transition count 126
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 85 place count 103 transition count 126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 98 transition count 121
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 98 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 95 place count 98 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 94 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 94 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 92 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 91 transition count 113
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 183 place count 54 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 49 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 49 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 45 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 45 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 41 transition count 54
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 41 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 37 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 221 place count 33 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 33 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 29 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 28 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 28 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 247 place count 21 transition count 25
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 252 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 260 place count 12 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 265 place count 9 transition count 16
Applied a total of 265 rules in 39 ms. Remains 9 /150 variables (removed 141) and now considering 16/172 (removed 156) transitions.
[2024-05-22 23:36:17] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-22 23:36:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 23:36:17] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 23:36:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:36:17] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 23:36:17] [INFO ] Invariant cache hit.
[2024-05-22 23:36:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/150 places, 16/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 9/150 places, 16/172 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-09 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 145 transition count 143
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 120 transition count 143
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 51 place count 120 transition count 127
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 83 place count 104 transition count 127
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 99 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 99 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 93 place count 99 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 97 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 96 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 95 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 95 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 94 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 94 transition count 116
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 181 place count 55 transition count 77
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 50 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 50 transition count 67
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 45 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 45 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 40 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 40 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 35 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 35 transition count 46
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 30 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 30 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 25 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 24 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 22 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 254 place count 17 transition count 19
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 259 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 12 transition count 18
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 5 with 4 rules applied. Total rules applied 264 place count 10 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 8 transition count 13
Applied a total of 267 rules in 48 ms. Remains 8 /150 variables (removed 142) and now considering 13/172 (removed 159) transitions.
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-22 23:36:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 23:36:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/150 places, 13/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 8/150 places, 13/172 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-11 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 148 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 147 transition count 143
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 121 transition count 143
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 53 place count 121 transition count 128
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 83 place count 106 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 102 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 102 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 91 place count 102 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 100 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 99 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 99 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 98 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 98 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 97 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 97 transition count 118
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 181 place count 57 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 52 transition count 68
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 48 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 48 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 44 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 44 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 40 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 36 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 36 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 32 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 32 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 31 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 31 transition count 38
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 31 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 247 place count 24 transition count 24
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 255 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 16 transition count 23
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 262 place count 13 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 13 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 266 place count 10 transition count 16
Applied a total of 266 rules in 33 ms. Remains 10 /150 variables (removed 140) and now considering 16/172 (removed 156) transitions.
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-22 23:36:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 23:36:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:18] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/150 places, 16/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 10/150 places, 16/172 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-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:(AND (NEQ s2 0) (NEQ s9 1) (NOT (OR (EQ s9 0) (EQ s7 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-14 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 137 transition count 160
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 137 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 133 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 130 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 125 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 125 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 124 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 123 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 123 transition count 143
Applied a total of 53 rules in 20 ms. Remains 123 /150 variables (removed 27) and now considering 143/172 (removed 29) transitions.
// Phase 1: matrix 143 rows 123 cols
[2024-05-22 23:36:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 23:36:18] [INFO ] Invariant cache hit.
[2024-05-22 23:36:18] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/150 places, 143/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 123/150 places, 143/172 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-15 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 (OR (EQ s43 0) (EQ s82 1)) (OR (EQ s71 0) (EQ s117 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]]
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 245 edges and 123 vertex of which 122 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-15 finished in 580 ms.
All properties solved by simple procedures.
Total runtime 11659 ms.

BK_STOP 1716420980123

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-07b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-07b, 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 r153-tall-171631151400242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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