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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 50K 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-14a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421516024

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-14a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:45:17] [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:45:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:45:17] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-22 23:45:17] [INFO ] Transformed 143 places.
[2024-05-22 23:45:17] [INFO ] Transformed 197 transitions.
[2024-05-22 23:45:17] [INFO ] Found NUPN structural information;
[2024-05-22 23:45:17] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 114 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 1 formulas.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 186
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 123 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 123 transition count 177
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 114 transition count 159
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 114 transition count 159
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 114 transition count 154
Applied a total of 63 rules in 148 ms. Remains 114 /143 variables (removed 29) and now considering 154/197 (removed 43) transitions.
// Phase 1: matrix 154 rows 114 cols
[2024-05-22 23:45:18] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 23:45:18] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 23:45:18] [INFO ] Invariant cache hit.
[2024-05-22 23:45:18] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-22 23:45:18] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 154/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 505 ms. Remains : 113/143 places, 154/197 transitions.
Support contains 25 out of 113 places after structural reductions.
[2024-05-22 23:45:18] [INFO ] Flatten gal took : 36 ms
[2024-05-22 23:45:18] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:45:18] [INFO ] Input system was already deterministic with 154 transitions.
Finished random walk after 383 steps, including 2 resets, run visited all 18 properties in 34 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 300 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 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(!p0) U X(p1)))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 109 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 149
Applied a total of 10 rules in 16 ms. Remains 108 /113 variables (removed 5) and now considering 149/154 (removed 5) transitions.
// Phase 1: matrix 149 rows 108 cols
[2024-05-22 23:45:18] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 23:45:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:45:19] [INFO ] Invariant cache hit.
[2024-05-22 23:45:19] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 23:45:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 23:45:19] [INFO ] Invariant cache hit.
[2024-05-22 23:45:19] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/113 places, 149/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 108/113 places, 149/154 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 350 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s64 0) (EQ s85 1)), p1:(OR (EQ s2 0) (EQ s27 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 293 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Detected a total of 16/108 stabilizing places and 15/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 29 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-01 finished in 1466 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(X(X(X((F(!p0) U X(G(p1))))))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 147
Applied a total of 14 rules in 7 ms. Remains 106 /113 variables (removed 7) and now considering 147/154 (removed 7) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-22 23:45:20] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 23:45:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:45:20] [INFO ] Invariant cache hit.
[2024-05-22 23:45:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 23:45:20] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-22 23:45:20] [INFO ] Invariant cache hit.
[2024-05-22 23:45:20] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/113 places, 147/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 106/113 places, 147/154 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s74 0) (EQ s43 1)), p0:(AND (OR (EQ s74 0) (EQ s43 1)) (OR (EQ s24 0) (EQ s55 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5319 reset in 300 ms.
Stack based approach found an accepted trace after 64337 steps with 3447 reset with depth 87 and stack size 86 in 162 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-03 finished in 1072 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((G(p0)&&F((F(G(p0))&&G(p1))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 105 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 105 transition count 146
Applied a total of 16 rules in 14 ms. Remains 105 /113 variables (removed 8) and now considering 146/154 (removed 8) transitions.
// Phase 1: matrix 146 rows 105 cols
[2024-05-22 23:45:21] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 23:45:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:45:21] [INFO ] Invariant cache hit.
[2024-05-22 23:45:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 23:45:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-22 23:45:21] [INFO ] Invariant cache hit.
[2024-05-22 23:45:21] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 146/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 105/113 places, 146/154 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s21 1)), p1:(EQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-06 finished in 452 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((X(p1)||G(p2)||p0)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 105 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 103 transition count 144
Applied a total of 20 rules in 7 ms. Remains 103 /113 variables (removed 10) and now considering 144/154 (removed 10) transitions.
// Phase 1: matrix 144 rows 103 cols
[2024-05-22 23:45:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:45:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:45:21] [INFO ] Invariant cache hit.
[2024-05-22 23:45:22] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 23:45:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-22 23:45:22] [INFO ] Invariant cache hit.
[2024-05-22 23:45:22] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 103/113 places, 144/154 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s85 1) (EQ s72 1)), p2:(AND (EQ s85 0) (EQ s0 1)), p1:(EQ s72 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 677 reset in 195 ms.
Product exploration explored 100000 steps with 673 reset in 221 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 18 factoid took 433 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 23:45:23] [INFO ] Invariant cache hit.
[2024-05-22 23:45:23] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 23:45:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 23:45:23] [INFO ] After 87ms 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) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 986 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 144/144 transitions.
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 102 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 55 place count 75 transition count 116
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 68 place count 62 transition count 90
Iterating global reduction 0 with 13 rules applied. Total rules applied 81 place count 62 transition count 90
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 94 place count 49 transition count 64
Iterating global reduction 0 with 13 rules applied. Total rules applied 107 place count 49 transition count 64
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 120 place count 36 transition count 51
Iterating global reduction 0 with 13 rules applied. Total rules applied 133 place count 36 transition count 51
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 25 transition count 29
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 place count 25 transition count 29
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 166 place count 14 transition count 18
Iterating global reduction 0 with 11 rules applied. Total rules applied 177 place count 14 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 14 transition count 18
Applied a total of 178 rules in 27 ms. Remains 14 /103 variables (removed 89) and now considering 18/144 (removed 126) transitions.
[2024-05-22 23:45:25] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 23:45:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:45:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 23:45:25] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 23:45:25] [INFO ] Invariant cache hit.
[2024-05-22 23:45:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:45:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-22 23:45:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:45:25] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 23:45:25] [INFO ] Invariant cache hit.
[2024-05-22 23:45:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/103 places, 18/144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 14/103 places, 18/144 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 10 factoid took 224 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10009 steps, including 124 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:45:25] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-22 23:45:25] [INFO ] Invariant cache hit.
[2024-05-22 23:45:25] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:45:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 23:45:25] [INFO ] After 35ms 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 p1 (NOT p0)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1083 reset in 203 ms.
Product exploration explored 100000 steps with 1084 reset in 152 ms.
Built C files in :
/tmp/ltsmin11008015076108398278
[2024-05-22 23:45:26] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-22 23:45:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:45:26] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-22 23:45:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:45:26] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-22 23:45:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:45:26] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11008015076108398278
Running compilation step : cd /tmp/ltsmin11008015076108398278;'/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 169 ms.
Running link step : cd /tmp/ltsmin11008015076108398278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11008015076108398278;'/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/stateBased9193380512059321293.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-08 finished in 5132 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((G(F(p0))||G((G(p2)||p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 105 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 103 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 103 transition count 144
Applied a total of 20 rules in 7 ms. Remains 103 /113 variables (removed 10) and now considering 144/154 (removed 10) transitions.
// Phase 1: matrix 144 rows 103 cols
[2024-05-22 23:45:27] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:45:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 23:45:27] [INFO ] Invariant cache hit.
[2024-05-22 23:45:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 23:45:27] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-22 23:45:27] [INFO ] Invariant cache hit.
[2024-05-22 23:45:27] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 103/113 places, 144/154 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s46 1)), p0:(AND (EQ s92 0) (EQ s37 1)), p2:(AND (EQ s46 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-13 finished in 545 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((G(p0)||G(p1)||F(p2))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 154/154 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 107 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 147
Applied a total of 14 rules in 9 ms. Remains 106 /113 variables (removed 7) and now considering 147/154 (removed 7) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-22 23:45:27] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:45:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 23:45:27] [INFO ] Invariant cache hit.
[2024-05-22 23:45:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 23:45:27] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-22 23:45:27] [INFO ] Invariant cache hit.
[2024-05-22 23:45:27] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/113 places, 147/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 106/113 places, 147/154 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (EQ s74 0) (EQ s38 1)), p1:(AND (EQ s96 0) (EQ s0 1)), p0:(AND (OR (EQ s18 0) (EQ s53 1)) (OR (EQ s38 0) (EQ s74 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 290 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 121 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14a-LTLCardinality-14 finished in 1047 ms.
All properties solved by simple procedures.
Total runtime 11097 ms.

BK_STOP 1716421529566

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

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