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-171631151400252.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:40 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 61K 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-08b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421062093

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-08b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:37:43] [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:37:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:37:43] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-22 23:37:43] [INFO ] Transformed 240 places.
[2024-05-22 23:37:44] [INFO ] Transformed 254 transitions.
[2024-05-22 23:37:44] [INFO ] Found NUPN structural information;
[2024-05-22 23:37:44] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 55 place count 185 transition count 215
Iterating global reduction 1 with 39 rules applied. Total rules applied 94 place count 185 transition count 215
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 177 transition count 207
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 177 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 172 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 167 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 167 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 134 place count 163 transition count 189
Iterating global reduction 1 with 4 rules applied. Total rules applied 138 place count 163 transition count 189
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 142 place count 159 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 146 place count 159 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 156 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 156 transition count 182
Applied a total of 152 rules in 86 ms. Remains 156 /240 variables (removed 84) and now considering 182/254 (removed 72) transitions.
// Phase 1: matrix 182 rows 156 cols
[2024-05-22 23:37:44] [INFO ] Computed 2 invariants in 15 ms
[2024-05-22 23:37:44] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 23:37:44] [INFO ] Invariant cache hit.
[2024-05-22 23:37:44] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-22 23:37:44] [INFO ] Invariant cache hit.
[2024-05-22 23:37:44] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/240 places, 182/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 156/240 places, 182/254 transitions.
Support contains 19 out of 156 places after structural reductions.
[2024-05-22 23:37:44] [INFO ] Flatten gal took : 36 ms
[2024-05-22 23:37:44] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:37:44] [INFO ] Input system was already deterministic with 182 transitions.
Finished random walk after 884 steps, including 3 resets, run visited all 13 properties in 69 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 307 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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&&F(G(p1))) U (G((p0&&F(G(p1))))||(p0&&X((p2&&F(G(p1))))))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 150 transition count 175
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 150 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 146 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 146 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 145 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 145 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 144 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 143 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 142 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 142 transition count 166
Applied a total of 28 rules in 20 ms. Remains 142 /156 variables (removed 14) and now considering 166/182 (removed 16) transitions.
// Phase 1: matrix 166 rows 142 cols
[2024-05-22 23:37:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:37:45] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 23:37:45] [INFO ] Invariant cache hit.
[2024-05-22 23:37:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-22 23:37:45] [INFO ] Invariant cache hit.
[2024-05-22 23:37:45] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/156 places, 166/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 142/156 places, 166/182 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 428 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s122 1) (EQ s132 1)), p1:(OR (EQ s48 0) (EQ s13 1)), p2:(NEQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 389 reset in 287 ms.
Stack based approach found an accepted trace after 1386 steps with 5 reset with depth 62 and stack size 62 in 3 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-08 finished in 1044 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((G(p0)||F(p1)))&&F(((!p2&&X(F((!p2 U (p3||G(!p2))))))||G(F((!p2 U (p3||G(!p2)))))))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 177
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 177
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 150 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 150 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 147 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 147 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 146 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 146 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 145 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 145 transition count 169
Applied a total of 22 rules in 22 ms. Remains 145 /156 variables (removed 11) and now considering 169/182 (removed 13) transitions.
// Phase 1: matrix 169 rows 145 cols
[2024-05-22 23:37:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:37:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 23:37:46] [INFO ] Invariant cache hit.
[2024-05-22 23:37:46] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-22 23:37:46] [INFO ] Invariant cache hit.
[2024-05-22 23:37:46] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/156 places, 169/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 145/156 places, 169/182 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s62 1)), p1:(AND (EQ s112 0) (EQ s48 1)), p2:(OR (EQ s66 0) (EQ s129 1)), p3:(AND (NOT (OR (EQ s66 0) (EQ s129 1))) (NOT (OR (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 431 steps with 2 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-11 finished in 500 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(p0)||X(F((G(F(p2))||p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 150 transition count 176
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 150 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 146 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 146 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 144 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 144 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 139 transition count 163
Applied a total of 34 rules in 14 ms. Remains 139 /156 variables (removed 17) and now considering 163/182 (removed 19) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 23:37:46] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:37:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:37:46] [INFO ] Invariant cache hit.
[2024-05-22 23:37:46] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-22 23:37:46] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/156 places, 163/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 139/156 places, 163/182 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s134 1), p1:(OR (EQ s74 0) (EQ s78 1)), p2:(EQ s134 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-12 finished in 879 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((X(F(p1))||p0))||X(X(X(F(p2)))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Graph (complete) has 307 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 152 transition count 158
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 132 transition count 158
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 41 place count 132 transition count 132
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 93 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 102 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 102 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 102 transition count 126
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 103 place count 101 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 98 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 98 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 97 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 96 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 96 transition count 120
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 177 place count 64 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 58 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 58 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 52 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 52 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 47 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 47 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 43 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 223 place count 39 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 227 place count 39 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 35 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 35 transition count 44
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 35 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 35 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 33 transition count 41
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 40 edges and 31 vertex of which 28 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 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 246 place count 28 transition count 35
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 251 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 24 transition count 33
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 262 place count 19 transition count 28
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 5 with 4 rules applied. Total rules applied 266 place count 17 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 17 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 16 transition count 24
Applied a total of 269 rules in 57 ms. Remains 16 /156 variables (removed 140) and now considering 24/182 (removed 158) transitions.
[2024-05-22 23:37:47] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 16 cols
[2024-05-22 23:37:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:37:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 23:37:47] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 23:37:47] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 23:37:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:37:47] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 23:37:47] [INFO ] Invariant cache hit.
[2024-05-22 23:37:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/156 places, 24/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 16/156 places, 24/182 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-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) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s6 1)), p1:(AND (EQ s1 0) (EQ s14 1)), p2:(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, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 132 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-15 finished in 336 ms.
All properties solved by simple procedures.
Total runtime 4354 ms.

BK_STOP 1716421069041

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.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-08b"
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-08b, 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-171631151400252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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